Class invariants by the CRT method

22Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

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|>1015. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Enge, A., & Sutherland, A. V. (2010). Class invariants by the CRT method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6197 LNCS, pp. 142–156). https://doi.org/10.1007/978-3-642-14518-6_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free