Exact Error Bound of Cox-Rower Architecture for RNS Arithmetic

Residue Number System (RNS) is a method for representing an integer as an n-tuple of its residues with respect to a given base. Since RNS has inherent parallelism, it is actively researched to implement fast public-key cryptography using RNS. This paper derives the exact error bound of approximation on the Cox-Rower architecture which was proposed for RNS modular multiplication. This is the tightest bound ever found and enables us to find new parameter sets for the Cox-Rower architecture, which cannot be found with old bounds. Keywords— Residue Number System; error bound; base extension; cryptography

[1]  Ingrid Verbauwhede,et al.  Faster Pairing Coprocessor Architecture , 2012, Pairing.

[2]  Ingrid Verbauwhede,et al.  FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction , 2011, CHES.

[3]  Thanos Stouraitis,et al.  Multifunction Residue Architectures for Cryptography , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.

[4]  Thomas Plantard,et al.  RNS Arithmetic Approach in Lattice-based Cryptography , 2015 .

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

[6]  Nicolas Guillermin.  A high speed coprocessor for elliptic curve scalar multiplication over Fp , 2010 .

[7]  Thanos Stouraitis,et al.  An RNS Implementation of an $F_{p}$ Elliptic Curve Point Multiplier , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

[9]  Jean-Claude Bajard,et al.  Double Level Montgomery Cox-Rower Architecture, New Bounds , 2014, CARDIS.

[10]  Filippo Gandino,et al.  An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS , 2012, IEEE Transactions on Computers.

[11]  T. Stouraitis,et al.  A new approach to elliptic curve cryptography: an RNS architecture , 2006, MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference.

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

[13]  Reinhard Posch,et al.  RNS-modulo reduction upon a restricted base value set and its applicability to RSA cryptography , 1998, Comput. Secur..

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

[15]  Arnaud Tisserand,et al.  Improving Modular Inversion in RNS using the Plus-Minus Method , 2013, IACR Cryptol. ePrint Arch..

[16]  Arnaud Tisserand,et al.  Single Base Modular Multiplication for Efficient Hardware RNS Implementations of ECC , 2015, CHES.

[17]  Leonel Sousa,et al.  RNS-Based Elliptic Curve Point Multiplication for Massive Parallel Architectures , 2012, Comput. J..