@inproceedings{4fe05d0c2f8c4ed2bb7b8b62a695ebfd,
title = "Comparing invariants for class fields of imaginary quadratic fields",
abstract = "Class fields of imaginary quadratic number fields can be constructed from singular values of modular functions, called class invariants. From a computational point of view, it is desirable that the associated minimal polynomials be small. We examine different approaches to measure the size of the polynomials. Based on experimental evidence, we compare two families of class invariants suggested in the literature with respect to these criteria. Our results lead to more efficient constructions of elliptic curves for cryptography or in the context of elliptic curve primality proving (ECPP).",
author = "Andreas Enge and Fran{\c c}ois Morain",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 5th International Algorithmic Number Theory Symposium, ANTS 2002 ; Conference date: 07-07-2002 Through 12-07-2002",
year = "2002",
month = jan,
day = "1",
doi = "10.1007/3-540-45455-1\_21",
language = "English",
isbn = "3540438637",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "252--266",
editor = "Claus Fieker and Kohel, \{David R.\}",
booktitle = "Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings",
}