Design of an 8192-bit RNS montgomery multiplier

Abstract

Modular multiplier is the key to implement RSA algorithm. This paper proposes the design of an 8192-bit residue number system (RNS) Montgomery multiplier based on Cox-Rower architecture. To accelerate the reduction unit, we select modulo with a small Hamming weigh, and modulo are grouped by the number of Rowers. Each Rower unit only needs to support the reduction processes of one group of modulo instead of all modulo, thus eliminating the redundancy of the conventional structure and reducing delay and area of reduction units. Our reduction unit is smaller and faster than classic reduction unit. In SMIC μm, one 8192-bit modular multiplication is accomplished in 8056 ns at the cost of 1240 KG.