Computing Hilbert Class Polynomials
From MaRDI portal
Abstract: We present and analyze two algorithms for computing the Hilbert class polynomial . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm which uses the class group action on CM-curves over finite fields. Our run time analysis gives tighter bounds for the complexity of all known algorithms for computing , and we show that all methods have comparable run times.
Recommendations
Cites work
- A p-adic algorithm to compute the Hilbert class polynomial
- Abelian varieties over finite fields
- Constructing elliptic curves over finite fields using double eta-quotients
- Counting points on elliptic curves over finite fields
- Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
- Elliptic Curves and Primality Proving
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 4198182 (Why is no real title available?)
- scientific article; zbMATH DE number 3563269 (Why is no real title available?)
- scientific article; zbMATH DE number 1771885 (Why is no real title available?)
- scientific article; zbMATH DE number 2154267 (Why is no real title available?)
- scientific article; zbMATH DE number 3995866 (Why is no real title available?)
- scientific article; zbMATH DE number 2086888 (Why is no real title available?)
- scientific article; zbMATH DE number 2086892 (Why is no real title available?)
- Modern computer algebra
- Supersingular elliptic curves and maximal quaternionic orders
- The complexity of class polynomial computation via floating point approximations
- Weber's class invariants revisited
Cited in
(30)- Computing with barycentric polynomials
- On the computation of Hilbert class fields
- Gross-Zagier type CM value formulas on X₀^(p)
- Generalized class polynomials
- A reduction algorithm for Hilbert modular groups
- Hilbert modular polynomials
- On the computation of generalized division polynomials
- Computing Igusa class polynomials
- Computing class polynomials for abelian surfaces
- Improved CRT algorithm for class polynomials in genus 2
- A p-adic algorithm to compute the Hilbert class polynomial
- The complexity of class polynomial computation via floating point approximations
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Modular Polynomials for Genus 2
- p-adic class invariants
- A quasi-linear time algorithm for computing modular polynomials in dimension 2
- Choosing the correct elliptic curve in the CM method
- Pairing the volcano
- Class invariants by the CRT method
- Isogenous hyperelliptic and non-hyperelliptic Jacobians with maximal complex multiplication
- Accelerating the CM method
- Primes dividing invariants of CM Picard curves
- Constructing elliptic curves over finite fields with prescribed torsion
- Modular polynomials via isogeny volcanoes
- Constructing Picard curves with complex multiplication using the Chinese remainder theorem
- Explicit computations in Iwasawa theory
- Computing the endomorphism ring of an elliptic curve over a number field
- The complex multiplication method for genus 3 curves
- Pairing-based algorithms for Jacobians of genus 2 curves with maximal endomorphism ring
- Class polynomials for nonholomorphic modular functions
This page was built for publication: Computing Hilbert Class Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387605)
