在有限域上讨论了素数阶的安全椭圆曲线的选取算法,并通过对多项式使用预处理技术和伪随机方法实现了选取算法,实验结果表明在不影响安全性的基础上,该算法比常用的随机算法的速度要快,且实验的结果可用于公钥密码体制中,具有一定的实用价值。
In this paper, an algorithm which generates the secure elliptic curves of prime order defined over the finite field is described. The algorithm is implemented by both the polynomials pre-process and bogus random method. Implementation results show that the algorithm is faster than other common algorithms with the same security. The results are useful and can be put into the elliptic curve cryptography.