Computing modular polynomials modulo large primes

Systems and methods for computing modular polynomials modulo large primes are described. In one aspect, the systems and methods generate l-isogenous elliptic curves. A modular polynomial modulo a large prime p is then computed as a function of l-isogenous elliptic curves modulo p. In one aspect, the...

Full description

Saved in:
Bibliographic Details
Main Authors LAUTER KRISTIN E, CHARLES DENIS X
Format Patent
LanguageEnglish
Published 04.09.2012
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Systems and methods for computing modular polynomials modulo large primes are described. In one aspect, the systems and methods generate l-isogenous elliptic curves. A modular polynomial modulo a large prime p is then computed as a function of l-isogenous elliptic curves modulo p. In one aspect, the modular polynomial may be used in a cryptosystem.
Bibliography:Application Number: US20090510991