Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download
Contributor : Aurore Guillevic Connect in order to contact the contributor
Submitted on : Tuesday, November 7, 2017 - 6:49:49 PM
Last modification on : Friday, November 18, 2022 - 10:13:54 AM
Long-term archiving on: : Thursday, February 8, 2018 - 3:02:06 PM


Files produced by the author(s)



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⟩



Record views


Files downloads