Improved RNS Montgomery Modular Multiplication with Residue Recovery

Finite field arithmetic in residue number system (RNS) necessitates modular reductions, which can be carried out with RNS Montgomery algorithm. By transforming long-precision modular multiplications into modular multiplications with small moduli, the computational complexity has decreased much. In this work, two implementation methods of RNS Montgomery algorithm, residue recovery as well as parallel base conversion, are reviewed and compared. Then, we propose a new residue recovery method that directly employs binary system rather than mixed radix system to perform RNS modular multiplications. This improvement is appropriate for a series of long-precision modular multiplications with variant operands, in which it is more efficient than parallel base conversion method.

[1]  Atsushi Shimbo,et al.  Implementation of RSA Algorithm Based on RNS Montgomery Multiplication , 2001, CHES.

[2]  Eric Peeters,et al.  Parallel FPGA implementation of RSA with residue number systems - can side-channel threats be avoided? , 2003, 2003 46th Midwest Symposium on Circuits and Systems.

[3]  Aggelos Kiayias,et al.  Traceable Signatures , 2004, EUROCRYPT.

[4]  Nicolas Guillermin.  A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over \mathbbFp\mathbb{F}_p , 2010, CHES.

[5]  Dai Zi-bin,et al.  An improved RNS Montgomery modular multiplier , 2010, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

[6]  Atsushi Shimbo,et al.  Cox-Rower Architecture for Fast Parallel Montgomery Multiplication , 2000, EUROCRYPT.

[7]  Michael A. Soderstrand,et al.  Residue number system arithmetic: modern applications in digital signal processing , 1986 .

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

[9]  Laurent Imbert,et al.  Leak Resistant Arithmetic , 2004, CHES.

[10]  Yinan Kong,et al.  Highly parallel modular multiplication in the residue number system using sum of residues reduction , 2010, Applicable Algebra in Engineering, Communication and Computing.

[11]  F. J. Taylor,et al.  Residue Arithmetic A Tutorial with Examples , 1984, Computer.

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

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

[14]  Laurent Imbert,et al.  a full RNS implementation of RSA , 2004, IEEE Transactions on Computers.

[15]  Li-Tian Liu,et al.  Elliptic Curve Point Multiplication by Generalized Mersenne Numbers , 2012 .

[16]  Jean-Claude Bajard,et al.  Modular multiplication and base extensions in residue number systems , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

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

[18]  P. V. Mohan,et al.  Residue Number Systems: Algorithms and Architectures , 2011 .

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