首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于加法链的快速标量乘算法
引用本文:殷新春,侯红祥,谢立. 一种基于加法链的快速标量乘算法[J]. 计算机应用, 2008, 28(1): 56-58,6
作者姓名:殷新春  侯红祥  谢立
作者单位:1. 扬州大学,信息工程学院,江苏,扬州,225009;南京大学,计算机软件新技术国家重点实验室,南京,210093
2. 扬州大学,信息工程学院,江苏,扬州,225009
3. 南京大学,计算机软件新技术国家重点实验室,南京,210093
基金项目:国家自然科学基金 , 江苏省六大人才高峰基金
摘    要:给出一种标量的串长加法链算法来提高椭圆曲线标量乘法的效率。新的标量乘算法结合底层域直接计算2Q+P、2^nR+S算法,使用大小窗口法将串长算法和滑动窗口算法结合,加法链长度、存储空间和预计算都减少,其效率比二元法提高53%,比NAF法提高47.5%,比串长算法提高46.2%,比Windows法提高42.2%。

关 键 词:椭圆曲线密码体制  标量乘法  加法链  直接计算
文章编号:1001-9081(2008)01-0056-03
收稿时间:2007-07-13
修稿时间:2007-07-13

Faster scalar multiplication algorithm based on addition chain
YIN Xin-chun,HOU Hong-xiang,XIE Li. Faster scalar multiplication algorithm based on addition chain[J]. Journal of Computer Applications, 2008, 28(1): 56-58,6
Authors:YIN Xin-chun  HOU Hong-xiang  XIE Li
Affiliation:YIN Xin-chun1,2,HOU Hong-xiang1,XIE Li2(1. College of Information Engineering,Yangzhou University,Yangzhou Jiangsu 225009,China,2. State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing Jiangsu 210093,China)
Abstract:To improve the efficiency of scalar multiplication, a run-length addition chain of scalar was proposed. New scalar multiplication integrated with algorithms of direct computing 2Q+P, 2nR+S in field, sliding window algorithm and run-length algorithm. The addition chain length, storage and pre-computing would be decreased. Its efficiency has been enhanced about 53% than binary method, about 47.5% than NAF method, about 46.2% than run-length algorithm and about 42.2% than Windows method.
Keywords:Elliptic Curve Cryptosystem (ECC)  Scalar Multiplication  Addition Chain  Direct Compute
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号