The Research of Generating Secure Elliptic Curve over GF(p)
Aiqin Hou, Baojian Gao, Jun Wang · 2009
Generating a secure elliptic curve is complicated and there are only a few algorithms for some special elliptic curves at present. In this paper an algorithm of generating an elliptic curve over prime field GF (p) with a prime number order is discussed. Another algorithm of generating an elliptic curve with an order which equals to the product of two prime numbers is proposed.