Efficient RNS Implementation of Elliptic Curve Point Multiplication Over ${\rm GF}(p)$

Elliptic curve point multiplication (ECPM) is one of the most critical operations in elliptic curve cryptography. In this brief, a new hardware architecture for ECPM over GF(p) is presented, based on the residue number system (RNS). The proposed architecture encompasses RNS bases with various word-lengths in order to efficiently implement RNS Montgomery multiplication. Two architectures with four and six pipeline stages are presented, targeted on area-efficient and fast RNS Montgomery multiplication designs, respectively. The fast version of the proposed ECPM architecture achieves higher speeds and the area-efficient version achieves better area-delay tradeoffs compared to state-of-the-art implementations.

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

[2]  Christof Paar,et al.  A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware , 2001, CHES.

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

[4]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[5]  M. McLoone,et al.  Hardware Elliptic Curve Cryptographic Processor Over , 2006 .

[6]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[7]  Chih-Tsun Huang,et al.  Elixir: High-Throughput Cost-Effective Dual-Field Processors and the Design Framework for Elliptic Curve Cryptography , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Keivan Navi,et al.  How to Teach Residue Number System to Computer Scientists and Engineers , 2011, IEEE Transactions on Education.

[9]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[10]  Thanos Stouraitis,et al.  An RNS architecture of an F/sub p/ elliptic curve point multiplier , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[11]  P. V. Ananda Mohan,et al.  RNS-To-Binary Converter for a New Three-Moduli Set $\{2^{{n}+1}-1,2^{n},2^{n}-1\}$ , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

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

[14]  Thomas Plantard,et al.  Selected RNS Bases for Modular Multiplication , 2009, 2009 19th IEEE Symposium on Computer Arithmetic.

[15]  Joos Vandewalle,et al.  Hardware implementation of an elliptic curve processor over GF(p) , 2003, Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003.