Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication

Abstract

Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of explicit isogenies. Moving to Jacobians of genus-2 curves, the current state of the art for point counting is a generalization of Schoof's algorithm. While we are currently missing the tools we need to generalize Elkies' methods to genus 2, recently Martindale and Milio have computed analogues of modular polynomials for genus-2 curves whose Jacobians have real multiplication by maximal orders of small discriminant. In this article, we prove Atkin-style results for genus-2 Jacobians with real multiplication by maximal orders, with a view to using these new modular polynomials to improve the practicality of point-counting algorithms for these curves.
Fichier principal
Vignette du fichier
Isogenies_point_counting_genus2RM_17.pdf (293.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01421031 , version 1 (21-12-2016)
hal-01421031 , version 2 (16-01-2017)
hal-01421031 , version 3 (07-11-2017)

Licence

Attribution

Identifiers

Cite

Sean Ballentine, Aurore Guillevic, Elisa Lorenzo García, Chloe Martindale, Maike Massierer, et al.. Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication. Algebraic Geometry for Coding Theory and Cryptography, Feb 2016, Los Angeles, United States. pp.63-94, ⟨10.1007/978-3-319-63931-4_3⟩. ⟨hal-01421031v3⟩
1529 View
324 Download

Altmetric

Share

Gmail Facebook X LinkedIn More