Montgomery algorithm is a fast modular multiplication algorithm and has been widely used in the base operation of public-key cryptography algorithms such as RSA and ElGamal. The algorithm is analyzed deeply and deduced systematically in this paper. Then, two typical methods is realized and compared, and two other improvements is given.
参考文献
相似文献
引证文献
引用本文
李明久 季晓勇 刘鞭箭. Montgomery算法分析与研究[J]. 科学技术与工程, 2006, (12): 1628-1631. LI Mingjiu, JI Xiaoyong, LIU Bianjian. Analyzing and Researching Montgomery Algorithm[J]. Science Technology and Engineering,2006,(12):1628-1631.
