有限域上素数阶的安全椭圆曲线的选取及实现  

Selection and Implementation of Secure Elliptic Curves of Prime Order over Finite Field

作　　者：殷新春[1] 汪彩梅[1] 陈决伟[1] 

机构地区：[1]扬州大学计算机科学与工程系,江苏扬州225009

出　　处：《计算机应用研究》2006年第8期95-96,99,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(60473012)

摘　　要：在有限域上讨论了素数阶的安全椭圆曲线的选取算法,并通过对多项式使用预处理技术和伪随机方法实现了选取算法,实验结果表明在不影响安全性的基础上,该算法比常用的随机算法的速度要快,且实验的结果可用于公钥密码体制中,具有一定的实用价值。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.

关 键 词：素数阶 安全椭圆曲线 多项式 预处理 伪随机 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]