Vol. 1, No. 1, 2013

Download this article
Download this article For screen
For printing
Recent Volumes
The Open Book Series
About the Series
Ethics Statement
Other MSP Publications
On the evaluation of modular polynomials

Andrew V. Sutherland

Vol. 1 (2013), No. 1, 531–555

We present two algorithms that, given a prime and an elliptic curve EFq, directly compute the polynomial Φ(j(E),Y ) Fq[Y ] whose roots are the j-invariants of the elliptic curves that are -isogenous to E. We do not assume that the modular polynomial Φ(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 =  100,019.

elliptic curves, isogenies, point counting, SEA algorithm
Mathematical Subject Classification 2010
Primary: 11Y16
Secondary: 11G15, 11G20
Published: 14 November 2013
Andrew V. Sutherland
Department of Mathematics
Massachusetts Institute of Technology
Cambridge, MA 02139
United States