Title :
Montgomery exponentiation needs no final subtractions
Author_Institution :
Comput. Dept., Univ. of Manchester Inst. of Sci. & Technol., UK
fDate :
10/14/1999 12:00:00 AM
Abstract :
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
Keywords :
cryptography; digital arithmetic; Montgomery exponentiation; RSA cryptosystem; modular multiplication algorithm;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19991230
