Class invariants by the CRT method

Abstract : We adapt the CRT approach for 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}$.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/inria-00448729
Contributor : Andreas Enge <>
Submitted on : Saturday, May 1, 2010 - 3:33:06 PM
Last modification on : Wednesday, June 26, 2019 - 2:48:03 PM
Long-term archiving on : Thursday, September 23, 2010 - 12:31:20 PM

Files

classinv.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Andreas Enge, Andrew V. Sutherland. Class invariants by the CRT method. Ninth Algorithmic Number Theory Symposium ANTS-IX, Jul 2010, Nancy, France. pp.142-156, ⟨10.1007/978-3-642-14518-6_14⟩. ⟨inria-00448729v2⟩

Share

Metrics

Record views

334

Files downloads

512