On the evaluation of modular polynomials
From MaRDI portal
Abstract: We present two algorithms that, given a prime ell and an elliptic curve E/Fq, directly compute the polynomial Phi_ell(j(E),Y) in Fq[Y] whose roots are the j-invariants of the elliptic curves that are ell-isogenous to E. We do not assume that the modular polynomial Phi_ell(X,Y) is given. The algorithms may be adapted to handle other types of modular polynomials, and we consider applications to point counting and the computation of endomorphism rings. We demonstrate the practical efficiency of the algorithms by setting a new point-counting record, modulo a prime q with more than 5,000 decimal digits, and by evaluating a modular polynomial of level ell = 100,019.
Recommendations
- Modular polynomials
- Computing Modular Polynomials
- On the computation of the modular equation
- scientific article; zbMATH DE number 1281911
- scientific article; zbMATH DE number 5005627
- Algorithmic Number Theory
- On the computation of the coefficients of modular forms
- Some modular results on the Euler and Bernoulli polynomials
- On cyclotomic factors of polynomials related to modular forms
Cited in
(27)- Calculating root numbers of elliptic curves over \(\mathbb{Q}\)
- Some properties of reduced modular polynomials
- New examples of maximal curves with low genus
- Constructing cycles in isogeny graphs of supersingular elliptic curves
- Computing modular polynomials in quasi-linear time
- Fast algorithms for computing isogenies between elliptic curves
- Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields
- Improved supersingularity testing of elliptic curves
- Computing the characteristic polynomial of a finite rank two Drinfeld module
- scientific article; zbMATH DE number 6739364 (Why is no real title available?)
- Modular polynomials via isogeny volcanoes
- Computing Modular Polynomials
- On the Correlation Between Parity and Modular Polynomials
- Polynomials defining Teichmüller curves and their factorizations mod p
- On explicit formulas for the modular equation
- Computational Number Theory, Past, Present, and Future
- Accelerating the Delfs-Galbraith algorithm with fast subfield root detection
- Towards a quantum-resistant weak verifiable delay function
- Computing modular polynomials by deformation
- Computing isogenies from modular equations in genus two
- On the efficient representation of isogenies. A survey for NuTMiC 2024
- Evaluation of modular polynomial from supersingular elliptic curves
- The SEA algorithm for endomorphisms of supersingular elliptic curves
- On some properties of modular polynomials for the lambda function
- Modular polynomials on Hilbert surfaces
- Practical isogeny-based key-exchange with optimal tightness
- Class polynomials for nonholomorphic modular functions
This page was built for publication: On the evaluation of modular polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949511)
