Title :
Parallel Montgomery multipliers
Author :
Sanu, Moboluwaji O. ; Swartzlander, Earl E., Jr. ; Chase, Craig M.
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA
Abstract :
Modular multiplication is an essential operation in virtually all public-key cryptosystems in use today. This work presents four designs for speeding up modular multiplication on application-specific crypto-processors. All the approaches utilize small look-up tables and fast, massively parallel multipliers. Two of the approaches trade off smaller look-up tables for a larger, slightly slower multiplier. The other two approaches use larger look-up tables but a smaller, faster multiplier.
Keywords :
digital arithmetic; parallel algorithms; public key cryptography; table lookup; application-specific cryptoprocessors; look-up tables; modular multiplication; parallel Montgomery multipliers; public-key cryptosystems; Computer architecture; Cryptographic protocols; Elliptic curve cryptography; Elliptic curves; Hardware; Kernel; Public key cryptography; Security; Smart cards; Table lookup;
Conference_Titel :
Application-Specific Systems, Architectures and Processors, 2004. Proceedings. 15th IEEE International Conference on
Print_ISBN :
0-7695-2226-2
DOI :
10.1109/ASAP.2004.1342459
