Optimization and Application of Montgomery Algorithm in RSA
Xiangning Chen · Computer Technology and Development · 2007
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.Firstly,the algorithm of RSA and Montgomery are simply introduced and analyzed.Method and calcutive steps of normal application of Montgomery algorithm in RSA are expatiated also.Algorithm in most conmmon use chooses parameter r to power of 2 and the base to 2.Via analyzing the method and calcutive steps of normal algorithm,discusses changing the numerical value of parameter r and the base and use the fast algorithm of Dusse in the meantime,to advance the calcutive velocity a lot.