Counting Points on Hyperelliptic Curves over Finite Fields

  title={Counting Points on Hyperelliptic Curves over Finite Fields},
  author={Pierrick Gaudry and Robert Harley},
We describe some algorithms for computing the cardinality of hyperelliptic curves and their Jacobians over finite fields. They include several methods for obtaining the result modulo small primes and prime powers, in particular an algorithm à la Schoof for genus 2 using Cantor’s division polynomials. These are combined with a birthday paradox algorithm to calculate the cardinality. Our methods are practical and we give actual results computed using our current implementation. The Jacobian… CONTINUE READING
Highly Cited
This paper has 148 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 83 extracted citations

149 Citations

Citations per Year
Semantic Scholar estimates that this publication has 149 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 18 references

EC(GF(2^1999)). E-mail message to the NMBRTHRY

  • F. Vercauteren
  • 1999

Elliptic curves over nite elds and the computation of squareroots mod p

  • R. Schoof.
  • Math . Comp .
  • 1999

Endomorphisms of Abelian varieties over nite elds

  • J. Tate.
  • Invent . Math .
  • 1999


  • J W. Bosma
  • Handbook of Magma functions,
  • 1997
1 Excerpt

Catching kangaroos in function elds

  • A. Stein, E. Teske.
  • Preprint , March
  • 1995

On the analogue of the division polynomials for hyperellipticcurves

  • D. G. Cantor
  • J . Reine Angew . Math .
  • 1994

Koblitz . Hyperelliptic cryptosystems

  • N.
  • J . of Cryptology
  • 1990

Similar Papers

Loading similar papers…