DocumentCode :
2551417
Title :
On multiple precision based Montgomery multiplication without precomputation of N´0=-N0-1 mod W
Author :
Ploog, H. ; Timmermann, D.
Author_Institution :
Dept. of Electr. Eng., Rostock Univ., Germany
fYear :
2000
fDate :
2000
Firstpage :
589
Lastpage :
590
Abstract :
An efficient implementation of modular exponentiation, i.e., the main building block of many public key cryptographic devices, is achieved by algorithmic optimization of the Montgomery modular multiplication algorithm based on multiple precision such that pre-computation of N´0=-N0-1 mod W can be avoided. This can be attained by modifications of the multiplier used
Keywords :
optimisation; public key cryptography; algorithmic optimization; modular exponentiation; multiple precision; multiple precision based Montgomery multiplication; public key cryptographic devices; Algorithm design and analysis; Clocks; Delay; Field programmable gate arrays; Flip-flops; Hardware; Information technology; Performance analysis; Public key cryptography; Smart cards;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Design, 2000. Proceedings. 2000 International Conference on
Conference_Location :
Austin, TX
ISSN :
1063-6404
Print_ISBN :
0-7695-0801-4
Type :
conf
DOI :
10.1109/ICCD.2000.878350
Filename :
878350
Link To Document :
بازگشت