DocumentCode :
2816716
Title :
Fast modular multiplication by operand changing
Author :
Schimmler, Manfred ; Bunimov, Viktor
Author_Institution :
Inst. of Comput. & Commun. Eng., Technische Univ. Braunschweig, Germany
Volume :
2
fYear :
2004
fDate :
5-7 April 2004
Firstpage :
518
Abstract :
A new algorithm for modular multiplication for public key cryptography is presented. The algorithm is optimised with respect to area and time by use of a combination of adders and fast lookup tables. This leads to a multiplication method that can significantly speed up exponentiation, because the values of the lookup table do not depend on the operands of the individual multiplication. The speedup is achieved by continuous modification of one operand.
Keywords :
adders; digital arithmetic; optimisation; public key cryptography; table lookup; lookup table; modular multiplication; operand changing; public key cryptography; Algorithm design and analysis; Communication networks; Computer networks; Information technology; Parallel algorithms; Public key cryptography; Table lookup; Technological innovation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on
Print_ISBN :
0-7695-2108-8
Type :
conf
DOI :
10.1109/ITCC.2004.1286707
Filename :
1286707
Link To Document :
بازگشت