Genus 2 Curves with Complex Multiplication
Eyal Z. Goren, Kristin E. Lauter

TL;DR
This paper provides bounds on the denominators of Igusa class polynomials for genus 2 curves with complex multiplication, improving the understanding and computation of these polynomials for cryptographic applications.
Contribution
It offers a new bound on denominators of Igusa class polynomials for genus 2 curves with CM by primitive quartic CM fields, enhancing computational efficiency.
Findings
Bound on denominators of Igusa class polynomials established
Complete characterization of reduction types for various CM fields
Methods involve quaternion algebra embeddings and crystalline deformation theory
Abstract
Genus 2 curves are useful in cryptography for both discrete-log based and pairing-based systems, but a method is required to compute genus 2 curves such that the Jacobian has a given number of points. Currently, all known methods involve constructing genus 2 curves with complex multiplication via computing their three Igusa class polynomials. These polynomials have rational coefficients and require extensive computation and precision to compute. Both the computation and the complexity analysis of these algorithms can be improved by a more precise understanding of the denominators of the coefficients of the polynomials. The main goal of this paper is to give a bound on the denominators of Igusa class polynomials of genus 2 curves with CM by a primitive quartic CM field. We give an overview of Igusa's results on the moduli space of genus two curves and the method to construct genus 2…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
