You are looking at a specific version 20100122:035918 of this paper.
See the latest version.
Paper 2010/031
Class Invariants by the CRT Method
Andreas Enge and Andrew V. Sutherland
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}.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- elliptic curve cryptographycomplex multiplication
- Contact author(s)
- drew @ math mit edu
- History
- 2010-01-22: received
- Short URL
- https://ia.cr/2010/031
- License
-
CC BY