On the Generation of Cryptographically Strong Elliptic Curves
Volker Müller, Sachar Paulus · TUbilio (Technical University of Darmstadt) · 1997
We discuss two methods for generating cryptographically strong elliptic curves defined over finite prime fields. The advantages and disadvantages of these algorithms are discussed and a practical comparison of the algorithms is given.