| 指数对的k阶自适应窗口表示算法 |
| |
| 引用本文： | 李学俊,胡磊. 指数对的k阶自适应窗口表示算法[J]. 电子学报, 2006, 34(8): 1513-1516 |
| |
| 作者姓名： | 李学俊 胡磊 |
| |
| 作者单位： | 西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西,西安,710071;中科院研究生院信息安全国家重点实验室,北京,100049;中科院研究生院信息安全国家重点实验室,北京,100049 |
| |
| 摘 要： | 给出了一种新的计算指数对gahb的Straus-Shamir类算法,该算法基于整数对的一个新表示,即k阶自适应窗口表示(k-AWE).证明了k-AWE的平均联合Hamming密度为3／(3k+1),与同类算法相比,本文算法更为有效.明确分析了在512到2048比特密钥长度的密码学应用中,窗口宽度的最佳取值为k=3.
|
| 关 键 词： | 指数对 k阶自适应窗口表示 Straus-Shamirs算法 |
| 文章编号： | 0372-2112（2006）08-1513-4 |
| 收稿时间： | 2005-03-30 |
| 修稿时间： | 2005-03-302006-04-10 |
Adaptive k-Ary Window Expansion Algorithm for Pairs of Exponentiations |
| |
| LI Xue-jun,HU Lei. Adaptive k-Ary Window Expansion Algorithm for Pairs of Exponentiations[J]. Acta Electronica Sinica, 2006, 34(8): 1513-1516 |
| |
| Authors: | LI Xue-jun HU Lei |
| |
| Affiliation: | 1. Key Laboratory of Computer Networks and Information Security,Ministry of Education,Xidian University,Xi'an,Shaanxi 710071, China;2. State Key Laboratory of Information Security,Graduate School of the Chinese Academy of Sciences,Beijing 100049,China |
| |
| Abstract: | Based on a new expansion for pairs of integers called adaptive k-ary window expansion (k-AWE),a new Straus-Shamir-like method for computing gahb is proposed.The average joint Hamming weight of the k-AWE is 3/(3k+1).Comparing with other methods,it is shown that the method can be on-line implemented more efficiently.At the same time,the optimal value for k is also precisely analyzed.Our result shows that k=3 is a best choice for cryptographic application of usual 512~2048 bits key size. |
| |
| Keywords: | pairs of exponentiations adaptive k-ary window expansion(k-AWE) Straus-Shamir algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载免费的PDF全文 |
|
