| Montgomery算法分析与应用改进 |
| |
| 引用本文： | 李明久. Montgomery算法分析与应用改进[J]. 计算机工程与应用, 2007, 43(1): 68-69,78 |
| |
| 作者姓名： | 李明久 |
| |
| 作者单位： | 南京大学,电子科学与工程系,南京,210093 |
| |
| 摘 要： | Montgomery算法作为一种快速模乘算法,常被应用于RSA、ElGamal等公钥密码算法的基本运算。文章对Montgomery算法进行了深入的剖析和系统的理论推导,实际分析比较了有代表性的两种实现方案并提出了一些应用改进。
|
| 关 键 词： | RSA Montgomery算法 模乘 |
| 文章编号： | 1002-8331（2007）01-0068-02 |
| 修稿时间： | 2006-05-01 |
Analysis and improvement of montgomery algorithm |
| |
| LI Ming-jiu. Analysis and improvement of montgomery algorithm[J]. Computer Engineering and Applications, 2007, 43(1): 68-69,78 |
| |
| Authors: | LI Ming-jiu |
| |
| Affiliation: | Department of EE,Nanjing University,Nanjing 210093,China |
| |
| Abstract: | Montgomery algorithm is a fast modular multiplication algorithm and is widely used in the base operation of publickey cryptography algorithms such as RSA and ElGamal.The algorithm is deeply analyzed and deduced systematically.Finally,two typical methods are realized and compared ,and two other improvements are given. |
| |
| Keywords: | RSA Montgomery algorithm modular multiplication |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
