Abstract:
This paper presents three methods to fasten the traditional Montgomery algorithm.They are constructed respectively from seeking inverse,modular multiplication and square of large integer,which remarkably reduce the time-complication of traditional Montgomery algorithm and improve the encryption and decryption rate of RSA algorithm.
摘要： 基于传统的Montgomery算法，提出了对其加速的3种方案。分别对求逆元、模乘以及大整数平方运算构造了相应的快速算法，大大降低了传统Montgomery算法的时间复杂度,从而提高了RSA算法的加解密速度。
关键词:
RSA算法,
Montgomery算法,
模乘
CLC Number:
LEI Ming,YE Xin,ZHANG Huanguo. Montgomery Algorithm and Its Fast Implementation[J]. , 2003, 29(14): 49-.
雷明,叶新,张焕国. Montgomery算法及其快速实现[J]. , 2003, 29(14): 49-.