| 基于Montgomery的分段并行标量乘快速算法 |
| |
| 引用本文： | 赵耿,彭程培,李晓东,张栋. 基于Montgomery的分段并行标量乘快速算法[J]. 计算机工程与应用, 2010, 46(6): 112-115. DOI: 10.3778/j.issn.1002-8331.2010.06.032 |
| |
| 作者姓名： | 赵耿 彭程培 李晓东 张栋 |
| |
| 作者单位： | 北京电子科技学院,北京,100070;西安电子科技大学,通信工程学院,西安,710071;北京电子科技学院,北京,100070 |
| |
| 基金项目： | 国家自然科学基金(No.60773120);;北京市自然科学基金(No.4092040);;北京电子科技学院信息安全与保密重点实验室资助项目(No.YZDJ0607)~~ |
| |
| 摘 要： | 在椭圆曲线二进制域上,Montgomery算法利用在计算kP过程中只需计算x坐标,在最后才恢复y坐标的特性,使该算法的计算量更少。在此基础上提出基于Montgomery的分段并行标量乘算法来更进一步提高算法的效率,经分析,将整数标量分两段并行计算,算法效率可提高约25%,将其分三段时其效率可提高约37%。通过编程实现验证了新算法的效率确实有明显提高,新算法对椭圆曲线标量乘快速实现有实际意义。
|
| 关 键 词： | 椭圆曲线 标量乘 Montgomery方法 |
| 收稿时间： | 2008-09-25 |
| 修稿时间： | 2009-4-1 |
Subsection simultaneous fast scalar multiplication algorithm based on Montgomery algorithm |
| |
| ZHAO Geng,PENG Cheng-pei,LI Xiao-dong,ZHANG Dong. Subsection simultaneous fast scalar multiplication algorithm based on Montgomery algorithm[J]. Computer Engineering and Applications, 2010, 46(6): 112-115. DOI: 10.3778/j.issn.1002-8331.2010.06.032 |
| |
| Authors: | ZHAO Geng PENG Cheng-pei LI Xiao-dong ZHANG Dong |
| |
| Affiliation: | 1.Beijing Electronic Science and Technology Institute,Beijing 100070,China 2.College of Communication Engineering,Xidian University,Xi’an 710071,China |
| |
| Abstract: | In the elliptic curve binary field,it needs less computation amount for that the Montgomery algorithm only computes the x coordinate in the whole course and gets the y coordinate in the last step.A new computational algorithm based on the Montgomery subsection method is proposed to enhance the efficiency further for computer kP,the computation amount decreases 25% for the new algorithm of two subsection and 37% for the new algorithm of three subsection compared with the original algorithm.The efficiency of ... |
| |
| Keywords: | elliptic curve scalar multiplication Montgomery algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
|
