Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (1): 68-68.

• 学术探讨 • Previous Articles     Next Articles

Analyzing and Researching Montgomery Algorithm

Mingjiu Li,,   

  1. 南京大学电子科学与工程系
  • Received:2006-01-11 Revised:1900-01-01 Online:2007-01-01 Published:2007-01-01
  • Contact: Mingjiu Li

Montgomery算法分析与应用改进

李明久   

  1. 南京大学电子科学与工程系
  • 通讯作者: 李明久 limingjiu

Abstract: Montgomery algorithm is a fast modular multiplication algorithm and is widely used in the base operation of public-key cryptography algorithms such as RSA and ElGamal. The algorithm is deeply analyzed and deduced systematically. Finally, two typical methods is realized and compared, and two other improvements is given.

Key words: RSA, Montgomery algorithm, Modular multiplication

摘要: Montgomery算法作为一种快速模乘算法,常被应用于RSA、ElGamal等公钥密码算法的基本运算。文章对Montgomery算法进行了深入的剖析和系统的理论推导,实际分析比较了有代表性的两种实现方案并提出了一些应用改进。

关键词: RSA, Montgomery算法, 模乘