Abstract

Since the group of an elliptic curve defined over a finite field F_q... The purpose of this paper is to describe how one can search for suitable elliptic curves with random coefficients using Schoof's algorithm. We treat the important special case of characteristic 2, where one has certain simplifications in some of the algorithms.

Citations

687	The arithmetic of elliptic curves - Silverman - 1985
559	Elliptic curve cryptosystem - Koblitz - 1987
419	Uses of elliptic curves in cryptography - Miller - 1985
243	Reducing elliptic curve logarithms to logarithms in a finite field - Menezes, Okamoto, et al. - 1993
212	Introduction to Elliptic Curves and Modular Forms - Koblitz - 1984
160	A Course in Number Theory and Cryptography - Koblitz - 1994
154	Elliptic curves over finite fields and the computation of square roots mod p - Schoof - 1985
129	Hyperelliptic cryptosystems - Koblitz - 1989
90	Die Typen der Multiplikatorenringe elliptischer Funktionenkörper - Deuring - 1941
62	Almost all primes can be quickly certified - Goldwasser, Kilian - 1986
52	Recognizing primes in random polynomial time - Adleman, Huang - 1987
35	Non-singular plane cubic curves over finite fields - Schoof - 1987
19	The implementation of elliptic curve cryptosystems - Menezes, Vanstone - 1990
18	Primality of the number of points on an elliptic curve over a finite field - Koblitz - 1988
8	On the implementation of elliptic curve cryptosystems - Bender, Castagnoli - 1989
2	3'r., "Algorithms in number theory - Lenstra, Lenstra - 1987
1	Elliptic Curve, Diopiantir, e Analy, i - Lang - 1978
1	l_somorrhism classes of ellir)tic curves over finite fields - Menezes, Vanstone - 1990
1	Abeltan varieties over finite fields," Ann. Sci. tcoIe Norm. Sup., 4 e sr - Waterhouse - 1969