Parallel Montgomery multipliers

• Published in: Proceedings. 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors, 2004 pp. 63 - 72
• Main Authors: Sanu, M.O., Swartzlander, E.E., Chase, C.M.
• Format: Conference Proceeding
• Language: English
• Published: Los Alamitos CA IEEE 2004; IEEE Computer Society
• Subjects: Applied sciences; Computer architecture; Cryptographic protocols; Electronics; Elliptic curve cryptography; Elliptic curves; Exact sciences and technology; Hardware; Integrated circuits; Integrated circuits by function (including memories and processors); Kernel; Public key cryptography; Security; Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices; Smart cards; Table lookup; Montgomery multiplier; Circuit design; Modular design; Massive parallelism; Public key cryptography; Custom circuit; Look up table
• ISBN: 9780769522265; 0769522262
• ISSN: 2160-0511; 2160-052X
• DOI: 10.1109/ASAP.2004.1342459

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.