DocumentCode
758296
Title
Still faster modular multiplication
Author
Walter, C.D.
Author_Institution
Comput. Dept., Univ. of Manchester Inst. of Sci. & Technol., UK
Volume
31
Issue
4
fYear
1995
fDate
2/16/1995 12:00:00 AM
Firstpage
263
Lastpage
264
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;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19950217
Filename
375809
Link To Document