Skip to Main content Skip to Navigation
Conference papers

Counting points on hyperelliptic curves over finite fields

Abstract : 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 groups we handle are larger than those previously reported in the literature.
Document type :
Conference papers
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/inria-00512403
Contributor : Pierrick Gaudry <>
Submitted on : Monday, August 30, 2010 - 1:26:17 PM
Last modification on : Thursday, March 5, 2020 - 6:21:44 PM
Long-term archiving on: : Thursday, December 1, 2016 - 11:19:57 PM

File

antsIV.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Pierrick Gaudry, Robert Harley. Counting points on hyperelliptic curves over finite fields. ANTS-IV, 2000, Leiden, Netherlands. pp.313-332, ⟨10.1007/10722028_18⟩. ⟨inria-00512403⟩

Share

Metrics

Record views

333

Files downloads

902