Modular multiplication in the residue number system with application to massively-parallel public-key cryptography systems

Modular multiplication is a fundamental operation in many public-key cryptography systems including RSA. Residue number system (RNS) implementation of modular multiplication has been of recent interest due to inherent RNS properties of multiplicative complexity reduction and digit independence over addition and multiplication. In this paper, a new RNS modular multiplication technique is introduced which relies solely upon modular arithmetic. The overhead formerly associated with such methods is rendered negligible, and the complexity roughly matches that of the most efficient mixed-arithmetic method. Application to massively-parallel systems is examined, revealing significant advantages over weighted number system counterparts.

[1]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[2]  Behrooz Parhami,et al.  Fast RNS Division Algorithms for Fixed Divisors with Application to RSA Encrytion , 1994, Inf. Process. Lett..

[3]  Colin D. Walter.  Logarithmic speed modular multiplication , 1994 .

[4]  Reinhard Posch,et al.  Modulo Reduction in Residue Number Systems , 1995, IEEE Trans. Parallel Distributed Syst..

[5]  Ramdas Kumaresan,et al.  Fast Base Extension Using a Redundant Modulus in RNS , 1989, IEEE Trans. Computers.

[6]  Holger Orup,et al.  Simplifying quotient determination in high-radix modular multiplication , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[7]  Mark Shand,et al.  Fast implementations of RSA cryptography , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[8]  Jean-Claude Bajard,et al.  An RNS Montgomery Modular Multiplication Algorithm , 1998, IEEE Trans. Computers.

[9]  K.K. Parhi,et al.  Montgomery modular multiplication and exponentiation in the residue number system , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).

[10]  Richard I. Tanaka,et al.  Residue arithmetic and its applications to computer technology , 1967 .

[11]  Keshab K. Parhi,et al.  Parallel modular multiplication with application to VLSI RSA implementation , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[12]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[13]  Franco P. Preparata,et al.  O(n)-Depth Modular Exponentiation Circuit Algorithm , 1997, IEEE Trans. Computers.

[14]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.