Montgomery exponentiation needs no final subtractions 论文
1999Electronics Letters引用 250顶会
Cryptography and Residue ArithmeticCryptography and Data SecurityCoding theory and cryptography
摘要
Montgomery's modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem. It has been observed that there is no need for extra cleaning up at the end of an exponentiation if the method is correctly set up.