Efficient hardware implementation of modular multiplication and exponentiation for public-key cryptography

Abstract

Modular multiplication and modular exponentiation are fundamental operations in most public-key cryptosystems such as RSA and DSS. In this paper, we propose a novel implementation of these operations using systolic arrays based architectures. For this purpose, we use the Montgomery algorithm to compute the modular product and the left-to-right binary exponentiation method to yield the modular power. Our implementation improves time requirement as well as the timexarea factor when compared that of Blum's and Paar's. © Springer-Verlag Berlin Heidelberg 2003.