Computing modular polynomials in quasi-linear time
From MaRDI portal
Recommendations
Cites work
- Computing Modular Polynomials
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
- Constructing elliptic curves of prime order
- Constructing elliptic curves over finite fields using double eta-quotients
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Fast evaluation of modular functions using Newton iterations and the AGM
- Fast multiplication of large numbers
- Faster integer multiplication
- scientific article; zbMATH DE number 3987351 (Why is no real title available?)
- scientific article; zbMATH DE number 1210367 (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 2086892 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- scientific article; zbMATH DE number 3198945 (Why is no real title available?)
- Hyperelliptic modular curves
- Modern computer algebra
- Modular curves of composite level
- MPFR
- On the coefficients of the transformation polynomials for the elliptic modular function
- The complexity of class polynomial computation via floating point approximations
Cited in
(32)- Expander graphs based on GRH with an application to elliptic curve cryptography
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- Some properties of reduced modular polynomials
- Hilbert modular polynomials
- Learning read-constant polynomials of constant degree modulo composites
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites
- Fast evaluation of modular functions using Newton iterations and the AGM
- The complexity of class polynomial computation via floating point approximations
- Computing Hilbert class polynomials with the Chinese remainder theorem
- A quasi-linear time algorithm for computing modular polynomials in dimension 2
- The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear
- Choosing the correct elliptic curve in the CM method
- Low-Weight Polynomial Form Integers for Efficient Modular Multiplication
- Short addition sequences for theta functions
- A subexponential algorithm for evaluating large degree isogenies
- Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields
- Exploiting Linearity of Modular Multiplication
- Modular forms constructed from moduli of elliptic curves, with applications to explicit models of modular curves
- Q-adic transform revisited
- Modular polynomials via isogeny volcanoes
- Computing Modular Polynomials
- Computational Number Theory, Past, Present, and Future
- Certified Newton schemes for the evaluation of low-genus theta functions
- Computing modular polynomials by deformation
- Computing isogenies from modular equations in genus two
- Towards computing canonical lifts of ordinary elliptic curves in medium characteristic
- On the efficient representation of isogenies. A survey for NuTMiC 2024
- Modular polynomials on Hilbert surfaces
- Class polynomials for nonholomorphic modular functions
- An explicit height bound for the classical modular polynomial
This page was built for publication: Computing modular polynomials in quasi-linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055173)
