On the evaluation of modular polynomials
arXiv:1202.3985 · doi:10.2140/obs.2013.1.531
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.
19 pages, corrected a typo in equation (8) and added equation (9)
References in corpus (10)
- Fast algorithms for computing isogenies between elliptic curves
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Computing Hilbert class polynomials with the Chinese Remainder Theorem
- Modular polynomials via isogeny volcanoes
- Class invariants by the CRT method
- Accelerating the CM method
- Identifying supersingular elliptic curves
- Visualizing elements of Sha[3] in genus 2 jacobians
- A Subexponential Algorithm for Evaluating Large Degree Isogenies
- An explicit height bound for the classical modular polynomial