@inproceedings{c2df9c40c8df4c6daf6497bf8c2990d4,
title = "Building cyclic elliptic curves modulo large primes",
abstract = "Elliptic curves play an important r{\^o}le in many areas of modern cryptology such as integer factorization and primality proving. Moreover, they can be used in cryptosystems based on discrete logarithms for building one-way permutations. For the latter purpose, it is required to have cyclic elliptic curves over finite fields. The aim of this note is to explain how to construct such curves over a finite field of large prime cardinality, using the ECPP primality proving test of Atkin and Morain.",
author = "Fran{\c c}ois Morain",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991 ; Conference date: 08-04-1991 Through 11-04-1991",
year = "1991",
month = jan,
day = "1",
doi = "10.1007/3-540-46416-6\_28",
language = "English",
isbn = "9783540546207",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "328--336",
editor = "Davies, \{Donald W.\}",
booktitle = "Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings",
}