| 基于双基数子集表示的快速标量乘算法 |
| |
| 引用本文： | 王圆圆,殷新春. 基于双基数子集表示的快速标量乘算法[J]. 江苏大学学报(自然科学版), 2009, 30(3) |
| |
| 作者姓名： | 王圆圆 殷新春 |
| |
| 作者单位： | 扬州职业大学,信息工程学院,江苏,扬州,225009;扬州大学,信息工程学院,江苏,扬州,225009;扬州大学,信息工程学院,江苏,扬州,225009 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，国家自然科学基金，江苏省六大人才高峰项目 |
| |
| 摘 要： | 为了减少双基数表示时间,提出双基数子集的概念,将存储空间和预计算时间从n2 降低到3n-2,同时给出求子集表示的贪婪算法.给出基于双基数子集的标量乘算法,由于搜索空间的降低,整数的双基数子集表示个数稍微多于双基数表示个数,新算法使用混合坐标进行优化.从运算量、存储空间上,将新算法分别与传统固定基点的窗口算法和Dimitrov的基于双基数链的算法进行比较,结果证明新算法显著优于前人算法.
|
| 关 键 词： | 密码 椭圆曲线 标量乘法 双基数系统 贪婪算法 混合坐标 |
Fast scalar multiplication based on subset of double-base number system |
| |
| Wang Yuanyuan,Yin Xinchun. Fast scalar multiplication based on subset of double-base number system[J]. Journal of Jiangsu University:Natural Science Edition, 2009, 30(3) |
| |
| Authors: | Wang Yuanyuan Yin Xinchun |
| |
| Affiliation: | 1.Information Engineering College;Yangzhou Polytechnic College;Yangzhou;Jiangsu 225009;China;2.Information Engineering College;Yangzhou University;China |
| |
| Abstract: | A new algorithm based on subset of double-base number system(DBNS) was proposed in order to improve the efficiency of scalar multiplication.The concept of subset of DBNS was described,and storage space and precomputation time were decreased from n2 to 3n-2.A greedy algorithm was deduced to compute the DBNS chain at the same time.The number of 2-integers is smaller,so that the length of DBNS chain becomes a little longer.Mixed-coordinate was used to optimize the algorithm.The new algorithm was compared with ... |
| |
| Keywords: | cryptography elliptic curve scalar multiplication double-base number systems greedy algorithm mixed-coordinate |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
