inria-00448729, version 2
Class invariants by the CRT method
Andreas Enge
1Andrew V. Sutherland a, 2
Ninth Algorithmic Number Theory Symposium ANTS-IX 6197 (2010) 142-156
Résumé : 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}$.
- a – Massachussetts Institute of Technology (MIT)
- 1 : LFANT (INRIA Bordeaux - Sud-Ouest)
- INRIA – Université de Bordeaux – CNRS : UMR5251
- 2 : Department of Mathematics [MIT]
- Massachussetts Institute of Technology (MIT)
- Domaine : Mathématiques/Théorie des nombres
- Versions disponibles : v1 (19-01-2010) v2 (05-05-2010)
- inria-00448729, version 2
- http://hal.inria.fr/inria-00448729
- oai:hal.inria.fr:inria-00448729
- Contributeur : Andreas Enge
- Soumis le : Samedi 1 Mai 2010, 15:33:06
- Dernière modification le : Jeudi 7 Avril 2011, 17:54:50
Documents associés
Exporter