Abstract
Elliptic curves play an important rô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.
Cite
CITATION STYLE
Morain, F. (1991). Building cyclic elliptic curves modulo large primes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 547 LNCS, pp. 328–336). Springer Verlag. https://doi.org/10.1007/3-540-46416-6_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
