| RSA密码系统有效实现算法 |
| |
| 引用本文： | 唐勇,许金玲.RSA密码系统有效实现算法[J].微处理机,2007,28(3):63-65. |
| |
| 作者姓名： | 唐勇 许金玲 |
| |
| 作者单位： | 燕山大学信息科学与工程学院,秦皇岛,066004 |
| |
| 基金项目： | 国家自然科学基金;国家重点实验室基金 |
| |
| 摘 要： | 大整数模幂乘运算一直是制约RSA广泛应用的瓶颈,在对传统算法剖析的基础上,提出了一种新的快速模乘算法,借鉴生成Wallace tree的思想,结合查找表和并行乘法运算进行RSA模幂运算。理论分析和试验证明新算法时间复杂度降低到O(logn)。
|
| 关 键 词： | RSA算法 模幂 模乘 Wallace tree思想 时间复杂度 |
| 文章编号： | 1002-2279（2007）03-0063-03 |
| 修稿时间： | 2005-06-18 |
Efficient Algorithms for RSA Cryptosystem Implementation |
| |
| TANG Yong,XU Jin-ling.Efficient Algorithms for RSA Cryptosystem Implementation[J].Microprocessors,2007,28(3):63-65. |
| |
| Authors: | TANG Yong XU Jin-ling |
| |
| Affiliation: | The College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China |
| |
| Abstract: | Modular exponentiation of large integers is the choke point for RSA.After analyzing traditional algorithms,a new fast modular exponentiation algorithm was presented.Wallace tree,lookup table and parallel multiplication were used in the algorithm.With theoretical analyzing and practical application,it was shown that the time complexity of the new algorithm was reduced to O(logn). |
| |
| Keywords: | RSA algorithm Modular multiplication Modular exponentiation Wallace tree Time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
