Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation

Abstract

Modular exponentiation with large modulus and exponent, which is usually accomplished by repeated modular multiplications, has been widely used in public key cryptosystems. Typically, the Montgomery's modular-multiplication algorithm is used since no trial division is necessary, and the carry-save addition (CSA) is employed to reduce the critical path. In this paper, we optimize the Montgomery's multiplication and propose architectures to perform the least significant bit first and the most significant bit first algorithms. The developed architecture has the following distinctive characteristics: 1) use of digit serial approach for Montgomery multiplication. 2) Conversion of the CSA representation of intermediate multiplication using carry-skip addition. This allows the critical path to be reduced, albeit with a small-area speed penalty; and 3) precompute the quotient value in Montgomery's iteration in order to speed up the operating frequency. In this paper, we present results in Xilinx Virtex 5 and in 0.18-μm application-specified integrated circuit technologies. For fair comparison with previous works, Xilinx Virtex 2 results are reported. Experimental results show that the proposed modular exponentiation and modular-multiplication design obtain the best delay performance compared with the published works and outperform them in terms of area-time complexity as well.Index Terms-Carry-save addition (CSA), carry-skip addition, modular exponentiation, Montgomery modular multiplication, Rivest-Shamir-Adleman (RSA) cryptosystem, very large scale integration architecture.

Under Quantum Computer Attack: Is Rainbow a Replacement of RSA and Elliptic Curves on Hardware?

“…The works in [5,6,[26][27][28][29] are believed to be the latest RSA, ECC, and multivariate public key cryptographic systems on hardware, respectively. We compare our design with these systems, which is depicted in Table 4.…”

“…Since software implementations even on multicore processors can often not provide the performance level needed, hardware implementations are thus the only option, which appear to be a promising solution to inherent performance issues of public key cryptographic systems and provide greater resistance to tampering. Among hardware implementations of public key cryptographic systems, RSA and elliptic curves systems are the most widely adopted candidates [5][6][7][8][9][10][11][12][13][14]. Their security lies in the difficulty of factorizing large integers and the discrete logarithm problem, respectively.…”

A Review on Implementation of RSA Cryptosystem Using Ancient Indian Vedic Mathematics

“…Gustavo D. Sutter, Jean-Pierre Deschamps, and José Luis Imaña [2] presented Modular exponentiation with large modulus and exponent, which is usually accomplished by repeated modular multiplications, has been widely used in public key cryptosystems. Typically, the Montgomery's modular-multiplication algorithm is used since no trial division is necessary, and the carry-save addition (CSA) is employed to reduce the critical path.…”

Dedicated Hardware for Attribute-Based Credential Verification

“…The most straightforward way of performing a modular exponentiation is by repeated squarings and multiplications to get the final result [6,34]. The square and multiply step can be performed either in parallel [22] or sequentially [13].…”