A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2

DOI10.1007/3-540-36178-2_20zbMath1065.11098OpenAlexW1547991217MaRDI QIDQ4412806

Pierrick Gaudry

Publication date: 16 July 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36178-2_20

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Computational aspects of algebraic curves (14Q05)

Related Items (5)

Elliptic curve point counting over finite fields with Gaussian normal basis ⋮ Counting Points in Medium Characteristic Using Kedlaya's Algorithm ⋮ Algebraic curves and cryptography ⋮ Efficient CM-constructions of elliptic curves over finite fields ⋮ A \(p\)-adic point counting algorithm for elliptic curves on Legendre form

This page was built for publication: A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2