Residue Number System Hardware Emulator and Instructions Generator

Residue Number System (RNS) is an alternative form of representing integers on which a large value gets represented by a set of smaller and independent integers. Cryptographic and signal filtering algorithms benefit from the use of RNS, due to its capabilities to increase performance and security. Herein, a simulation tool is presented which emulates the hardware implementation of an actual RNS co-processor. An “high-level to assembly” instructions generator is also built into this tool. The programmability and scalable architecture of the considered processor along with the high level description of the algorithm allows researchers and developers to easily evaluate and test their RNS algorithms on an actual architecture, using Java.

[1]  Jizeng Wei,et al.  A Unified Cryptographic Processor for RSA and ECC in RNS , 2013, NCCET.

[2]  Marc Joye,et al.  The Montgomery Powering Ladder , 2002, CHES.

[3]  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.

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

[5]  Milos D. Ercegovac,et al.  Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation , 2010, IACR Cryptol. ePrint Arch..

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

[7]  Leonel Sousa,et al.  An Efficient Scalable RNS Architecture for Large Dynamic Ranges , 2014, J. Signal Process. Syst..

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

[9]  Richard Conway,et al.  Improved RNS FIR filter architectures , 2004, IEEE Transactions on Circuits and Systems II: Express Briefs.

[10]  Thanos Stouraitis,et al.  A RNS Montgomery multiplication architecture , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

[11]  Harvey L. Garner,et al.  RESIDUE NUMBER SYSTEM ENHANCEMENTS FOR PROGRAMMABLE PROCESSORS , 2008 .

[12]  Hilarie K. Orman,et al.  Fast Key Exchange with Elliptic Curve Systems , 1995, CRYPTO.

[13]  Thanos Stouraitis,et al.  Hardware-fault attack handling in RNS-based Montgomery multipliers , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).