The complexity of class polynomial computation via floating point approximations
From MaRDI portal
Recommendations
Cites work
- Building curves with arbitrary small MOV degree over finite prime fields
- Class invariants by Shimura's reciprocity law
- Computing Frobenius maps and factoring polynomials
- Constructing elliptic curves of prime order
- Constructing elliptic curves over finite fields using double eta-quotients
- Die singulären Werte der Weberschen Funktionen f, f1, f2, 2, 3.
- Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
- Effective lower and upper bounds for the Fourier coefficients of powers of the modular invariant~j
- Elliptic Curves and Primality Proving
- Elliptic curves suitable for pairing based cryptography
- Elliptic Curves with a Given Number of Points
- Explicit Bounds for Primality Testing and Related Problems
- Fast evaluation of modular functions using Newton iterations and the AGM
- Fast Multiple-Precision Evaluation of Elementary Functions
- Fast multiplication of large numbers
- Faster integer multiplication
- scientific article; zbMATH DE number 1689862 (Why is no real title available?)
- 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 1186963 (Why is no real title available?)
- scientific article; zbMATH DE number 1273650 (Why is no real title available?)
- scientific article; zbMATH DE number 1142300 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- scientific article; zbMATH DE number 2154267 (Why is no real title available?)
- scientific article; zbMATH DE number 2086888 (Why is no real title available?)
- scientific article; zbMATH DE number 2086890 (Why is no real title available?)
- scientific article; zbMATH DE number 3198945 (Why is no real title available?)
- Modern computer algebra
- MPFR
- Prime sieves using binary quadratic forms
- Weber's class invariants revisited
- Über die Classenzahl quadratischer Zahlkörper
Cited in
(37)- Expander graphs based on GRH with an application to elliptic curve cryptography
- Gross-Zagier type CM value formulas on X₀^(p)
- Generalized class polynomials
- A taxonomy of pairing-friendly elliptic curves
- On the computation of generalized division polynomials
- Computing Igusa class polynomials
- Generalised Weber functions
- Computing class polynomials for abelian surfaces
- Constructing irreducible polynomials over finite fields
- Computing theta functions in quasi-linear time in genus two and above
- Fast evaluation of modular functions using Newton iterations and the AGM
- A p-adic algorithm to compute the Hilbert class polynomial
- Computing modular polynomials in quasi-linear time
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Finding elliptic curves with a subgroup of prescribed size
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Choosing the correct elliptic curve in the CM method
- On the evaluation of some sparse polynomials
- Computing Jacobi's theta in quasi-linear time
- Short addition sequences for theta functions
- scientific article; zbMATH DE number 2086890 (Why is no real title available?)
- Generalized division polynomials
- Spanning the isogeny class of a power of an elliptic curve
- Isogenous hyperelliptic and non-hyperelliptic Jacobians with maximal complex multiplication
- scientific article; zbMATH DE number 7310076 (Why is no real title available?)
- Accelerating the CM method
- Computing Hilbert Class Polynomials
- Modular polynomials via isogeny volcanoes
- Finding singular moduli on a complex line
- Efficiently computable complex multiplication of elliptic curves
- Certified Newton schemes for the evaluation of low-genus theta functions
- The complex multiplication method for genus 3 curves
- FastECPP over MPI
- On random sampling of supersingular elliptic curves
- Evaluation of modular polynomial from supersingular elliptic curves
- Schertz style class invariants for higher degree CM fields
- Class polynomials for nonholomorphic modular functions
This page was built for publication: The complexity of class polynomial computation via floating point approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055132)
