Counting points on hyperelliptic curves over finite fields - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

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.
Fichier principal
Vignette du fichier
antsIV.pdf (280.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00512403 , version 1 (30-08-2010)

Identifiers

Cite

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⟩
163 View
1232 Download

Altmetric

Share

Gmail Facebook X LinkedIn More