Parallelization of scalable elliptic curve cryptosystem processors in GF(2m)

The parallelization of scalable elliptic curve cryptography (ECC) processors (ECPs) is investigated in this paper. The proposed scalable ECPs support all 5 pseudo-random curves or all 5 Koblitz curves recommended by the National Institute of Standards and Technology (NIST) without the need to reconfigure the hardware. The proposed ECPs parallelize the finite field arithmetic unit and the elliptic curve point multiplication (ECPM) algorithm to gain performance improvement. The finite field multiplication is separated such that the reduction step is executed in parallel with the next polynomial multiplication. Subsequently, the finite field arithmetic of the ECPs are further parallelized and the performance can be further improved by over 50%. Since the multiplier blocks consume a low number of hardware resources, the latency reduction outweighs the cost of the extra multiplier resulting in more efficient ECP designs. The technique is applied for both pseudo-random curve and Koblitz curve algorithms. A novel ECPM algorithm is also proposed for Koblitz curves that take advantage of the proposed finite field arithmetic architecture. The implementation results show that the proposed parallelized scalable ECPs have better performance compared to state-of-the-art scalable ECPs that support the same set of elliptic curves.

[1]  Mohammed Benaissa,et al.  Flexible hardware/software co-design for scalable elliptic curve cryptography for low-resource applications , 2010, ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors.

[2]  Seok-Bum Ko,et al.  Scalable Elliptic Curve Cryptosystem FPGA Processor for NIST Prime Curves , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Seok-Bum Ko,et al.  High performance scalable elliptic curve cryptosystem processor in GF(2m) , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).

[4]  Neal Koblitz,et al.  CM-Curves with Good Cryptographic Properties , 1991, CRYPTO.

[5]  Seok-Bum Ko,et al.  FPGA implementation of low latency scalable Elliptic Curve Cryptosystem processor in GF(2m) , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).

[6]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[7]  Kimmo Järvinen,et al.  High-Speed Elliptic Curve Cryptography Accelerator for Koblitz Curves , 2008, 2008 16th International Symposium on Field-Programmable Custom Computing Machines.

[8]  Kimmo Järvinen,et al.  Fast point multiplication on Koblitz curves: Parallelization method and implementations , 2009, Microprocess. Microsystems.

[9]  Mohammed Benaissa,et al.  A scalable hardware/software co-design for elliptic curve cryptography on PicoBlaze microcontroller , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

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

[11]  Ricardo Dahab,et al.  Improved Algorithms for Elliptic Curve Arithmetic in GF(2n) , 1998, Selected Areas in Cryptography.

[12]  R. Cumplido,et al.  A reconfigurable GF(2M) elliptic curve cryptographic coprocessor , 2011, 2011 VII Southern Conference on Programmable Logic (SPL).

[13]  Paulo Realpe-Muñoz,et al.  Design of elliptic curve cryptoprocessors over GF(2163) on Koblitz curves , 2014, 2014 IEEE 5th Latin American Symposium on Circuits and Systems.

[14]  Kimmo Järvinen,et al.  Optimized FPGA-based elliptic curve cryptography processor for high-speed applications , 2011, Integr..

[15]  T. Itoh,et al.  A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..

[16]  Jean-Pierre Deschamps,et al.  Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations , 2013, IEEE Transactions on Industrial Electronics.

[17]  Reza Azarderakhsh,et al.  High-Performance Implementation of Point Multiplication on Koblitz Curves , 2013, IEEE Transactions on Circuits and Systems II: Express Briefs.

[18]  Chester Rebeiro,et al.  A Parallel Architecture for Koblitz Curve Scalar Multiplications on FPGA Platforms , 2012, 2012 15th Euromicro Conference on Digital System Design.

[19]  Francisco Rodríguez-Henríquez,et al.  Faster Implementation of Scalar Multiplication on Koblitz Curves , 2012, LATINCRYPT.

[20]  M. Anwar Hasan,et al.  High performance FPGA based elliptic curve cryptographic co-processor , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[21]  Paul G. Comba,et al.  Exponentiation Cryptosystems on the IBM PC , 1990, IBM Syst. J..

[22]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[23]  Francisco Rodríguez-Henríquez,et al.  Parallel Formulations of Scalar Multiplication on Koblitz Curves , 2008, J. Univers. Comput. Sci..

[24]  Mohammed Benaissa,et al.  Low Area-Scalable Hardware/Software Co-Design for Elliptic Curve Cryptography , 2009, 2009 3rd International Conference on New Technologies, Mobility and Security.

[25]  Bodo Möller,et al.  Network Working Group Elliptic Curve Cryptography (ecc) Cipher Suites for Transport Layer Security (tls) , 2006 .

[26]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[27]  Kimmo Järvinen,et al.  On Repeated Squarings in Binary Fields , 2009, Selected Areas in Cryptography.

[28]  Vassil S. Dimitrov,et al.  A Fast Hardware Architecture for Integer to \tauNAF Conversion for Koblitz Curves , 2012, IEEE Transactions on Computers.

[29]  Vassil S. Dimitrov,et al.  Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation , 2008, IEEE Transactions on Computers.

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

[31]  Ramlan Mahmod,et al.  A New Addition Formula for Elliptic Curves over GF(2n) , 2002, IEEE Trans. Computers.

[32]  Jerome A. Solinas,et al.  Efficient Arithmetic on Koblitz Curves , 2000, Des. Codes Cryptogr..

[33]  Chester Rebeiro,et al.  High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms , 2008, INDOCRYPT.

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

[35]  Billy Bob Brumley,et al.  Conversion Algorithms and Implementations for Koblitz Curve Cryptography , 2010, IEEE Transactions on Computers.

[36]  Seok-Bum Ko,et al.  High performance scalable elliptic curve cryptosystem processor for Koblitz curves , 2013, Microprocess. Microsystems.

[37]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.