GF（2^m）域上椭圆曲线点乘算法的改进  

Improvement of scalar multiplication algorithm on elliptic curve over GF(2m)

作　　者：陈维海[1] 岳轩[2] 贺毅朝 

机构地区：[1]中国华融资产管理公司石家庄办事处,石家庄050000 [2]河北省地方税务局信息中心,石家庄050000 [3]石家庄市粮食技工学校,石家庄050000

出　　处：《河北省科学院学报》2002年第4期208-212,共5页Journal of The Hebei Academy of Sciences

摘　　要：介绍了在GF(2 m)域上实现非超异椭圆曲线的点乘的算法 ,它是Montgomery算法的改进。该算法无需乘法预处理 ,运算速度快于IEEEP1363草案标准上“加 -减”算法 ,而且占用的内存资源少 ,易于软、硬件方式的实现。因此 ,该算法更利于在那些资源有限的环境中实现椭圆曲线加密体制。This paper describes an algorithm for computing scalar multiplications on non-supersingular elliptic curve defined over GF(2m). This algorithm is an optimized version of Montgomery's method. It requires no precomputed multiples of a point and is faster than the addition-subtraction method described in draft standard IEEE P1363. In addition, it is easy to implement in both hardware and software, requires less memory than projective schemes. Therefore, it is much convenient to implement ECC in restricted environments.

关 键 词：点乘算法 椭圆曲线 GF(2^M)域 公钥加密体制 MONTGOMERY算法 密码学 

分 类 号：TN918.1[电子电信—通信与信息系统]