|
|||||
|
|
| GF（2^m）域上椭圆曲线点乘算法的改进 | |
| 引用本文： | 陈维海,岳轩,贺毅朝.GF（2^m）域上椭圆曲线点乘算法的改进[J].河北省科学院学报,2002,19(4):208-212. |
| 作者姓名： | 陈维海 岳轩 贺毅朝 |
| 作者单位： | 1. 中国华融资产管理公司石家庄办事处,石家庄,050000 2. 河北省地方税务局信息中心,石家庄,050000 3. 石家庄市粮食技工学校,石家庄,050000 |
| 摘 要： | 介绍了在GF(2m)域上实现非超异椭圆曲线的点乘的算法,它是Montgomery 算法的改进.该算法无需乘法预处理,运算速度快于IEEE P1363草案标准上"加-减"算法,而且占用的内存资源少,易于软、硬件方式的实现.因此,该算法更利于在那些资源有限的环境中实现椭圆曲线加密体制. |
| 关 键 词： | 椭圆曲线 GF(2m)域 点乘 |
| 文章编号： | 1001-9383(2002)04-0208-05 |
| 修稿时间： | 2002年8月28日 |
Improvement of scalar multiplication algorithm on elliptic curve over GF(2m) |
|
| CHEN Wei-hai,YUE Xuan,HE Yi-chao.Improvement of scalar multiplication algorithm on elliptic curve over GF(2m)[J].Journal of The Hebei Academy of Sciences,2002,19(4):208-212. | |
| Authors: | CHEN Wei-hai YUE Xuan HE Yi-chao |
| Institution: | CHEN Wei-hai1,YUE Xuan2,HE Yi-chao3 |
| Abstract: | 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. |
| Keywords: | Elliptic curves Over GF(2m) Point multiplication |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |