Title :
Still faster modular multiplication
Author_Institution :
Comput. Dept., Univ. of Manchester Inst. of Sci. & Technol., UK
fDate :
2/16/1995 12:00:00 AM
Abstract :
By an appropriate choice of the modulus used in RSA cryptography, it is possible to simplify the hardware for performing the required modular multiplication steps, and thereby increase the speed of encryption and decryption. The author considers this when the algorithm of Montgomery is used
Keywords :
iterative methods; public key cryptography; Montgomery algorithm; RSA cryptography; decryption speed; encryption speed; modular multiplication;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19950217
