## CryptoDB

### Paper: Computing Modular Polynomials

Authors: Denis Charles Kristin E. Lauter URL: http://eprint.iacr.org/2004/189 Search ePrint Search Google We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our algorithm has the distinguishing feature that it does not involve the computation of Fourier coefficients of modular forms. We avoid computing the exponentially large integral coefficients by working directly modulo a prime and computing isogenies between elliptic curves via Velu's formulas.
##### BibTeX
@misc{eprint-2004-12161,
title={Computing Modular Polynomials},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / elliptic curve cryptosystems, number theory},
url={http://eprint.iacr.org/2004/189},
note={to appear in London Math Society Journal of Computation and Mathematics klauter@microsoft.com 12949 received 3 Aug 2004, last revised 15 Jun 2005},
author={Denis Charles and Kristin E. Lauter},
year=2004
}