A p-adic algorithm to compute the Hilbert class polynomial
From MaRDI portal
A $p$-adic algorithm to compute the Hilbert class polynomial
Recommendations
- Computing Hilbert Class Polynomials
- p-Adic Computation of Real Quadratic Class Numbers
- Picard Groups and Refined Discrete Logarithms
- Explicit p-adic method for elliptic and hyperelliptic curves
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Class invariants by the CRT method
- The complexity of class polynomial computation via floating point approximations
- Improvements in the computation of ideal class groups of imaginary quadratic number fields
- Supersingular j-invariants and the class number of ℚ(−p)
- Generalized class invariants with `Thetanullwerte'
Cites work
- A Rigorous Time Bound for Factoring Integers
- Algorithmic Number Theory
- Counting points on elliptic curves over finite fields
- Factoring integers with elliptic curves
- 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 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 3973001 (Why is no real title available?)
- scientific article; zbMATH DE number 3563269 (Why is no real title available?)
- scientific article; zbMATH DE number 1313469 (Why is no real title available?)
- scientific article; zbMATH DE number 706265 (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 825072 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- scientific article; zbMATH DE number 3092634 (Why is no real title available?)
- Modern computer algebra
- Nonsingular plane cubic curves over finite fields
- The complexity of class polynomial computation via floating point approximations
Cited in
(17)- Gross-Zagier type CM value formulas on X₀^(p)
- On the hardness of the computational ring-LWR problem and its applications
- CSIDH: an efficient post-quantum commutative group action
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Computing class polynomials for abelian surfaces
- Computing Hilbert class polynomials with the Chinese remainder theorem
- p-adic class invariants
- Choosing the correct elliptic curve in the CM method
- scientific article; zbMATH DE number 3636092 (Why is no real title available?)
- Accelerating the CM method
- A polynomial time algorithm for computing the HNF of a module over the integers of a number field
- A nonsplit sum of coefficients of modular forms
- Computing Hilbert Class Polynomials
- Modular polynomials via isogeny volcanoes
- Finding singular moduli on a complex line
- $\mathbf{Li}^{\boldsymbol{(p)}}$-service? An algorithm for computing $\boldsymbol{p}$-adic polylogarithms
- scientific article; zbMATH DE number 5240961 (Why is no real title available?)
This page was built for publication: A $p$-adic algorithm to compute the Hilbert class polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055076)
