An improved scheme of Montgomery algorithm for module power multiplication
Beibei Jin · Journal of Changchun University · 2006
Large module multiplication is the kernel of large module power multiplication in RSA.Based on the traditional Montgomery algorithm,this paper uses fast square of large integer multiplication and proposes an improved scheme,which remarkably reduces the time of large modular multiplication and improves the encryption and decryption rate of RSA algorithm.