CryptoDB
Class Invariants by the CRT Method
Authors: | |
---|---|
Download: | |
Abstract: | We adapt the CRT approach to computing Hilbert class polynomials to handle a wide range of class invariants. For suitable discriminants D, this improves its performance by a large constant factor, more than 200 in the most favourable circumstances. This has enabled record-breaking constructions of elliptic curves via the CM method, including examples with |D| > 10^{15}. |
BibTeX
@misc{eprint-2010-22932, title={Class Invariants by the CRT Method}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / elliptic curve cryptography, complex multiplication}, url={http://eprint.iacr.org/2010/031}, note={ drew@math.mit.edu 14629 received 20 Jan 2010}, author={Andreas Enge and Andrew V. Sutherland}, year=2010 }