The ants mascot

Tenth Algorithmic Number Theory Symposium ANTS-X
University of California, San Diego
July 9 – 13, 2012

Tenth Algorithmic Number Theory Symposium (ANTS-X)
July 9 – 13, 2012

On the evaluation of modular polynomials

Andrew V. Sutherland

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

Files available: paper (PDF), slides

© 2011-12 Kiran S. Kedlaya (with thanks to Pierrick Gaudry and Emmanuel Thomé)
XHTML 1.1 valid, CSS valid