Design of elliptic curve cryptoprocessors over GF(2163) on Koblitz curves

This paper presents the design of cryptoprocessors using two multipliers over finite field GF(2163) with digit-level processing. The arithmetic operations were implemented in hardware using Gaussian Normal Bases (GNB) representation and the scalar multiplication kP was performed on Koblitz curves using window-τNAF algorithm with w = 2, 4, 8 and 16. The cryptoprocessors were designed using VHDL description, synthesized on the Stratix-IV FPGA using Quartus II 12.0, and verified using SignalTAP II and Matlab. The simulation results show that the cryptoprocessors present a very good performance using low area. In this case, the computation times for calculating the scalar multiplication for w = 2, 4, 8 and 16 were 9.88, 7.37, 6.17 and 5.05 μs.

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

[2]  Vassil S. Dimitrov,et al.  A new algorithm for double scalar multiplication over Koblitz curves , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

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

[4]  Chih-Hsiang Chang,et al.  Non-XOR approach for low-cost bit-parallel polynomial basis multiplier over GF(2m) , 2011, IET Inf. Secur..

[5]  M. Anwar Hasan,et al.  High-Performance Architecture of Elliptic Curve Scalar Multiplication , 2008, IEEE Transactions on Computers.

[6]  Reza Azarderakhsh,et al.  A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier , 2010, WAIFI.

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

[8]  Arash Reyhani-Masoleh.  Efficient algorithms and architectures for field multiplication using Gaussian normal bases , 2006, IEEE Transactions on Computers.

[9]  Chiou-Yng Lee,et al.  Scalable Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation , 2012, Journal of Signal Processing Systems.

[10]  Kimmo Järvinen,et al.  On Parallelization of High-Speed Processors for Elliptic Curve Cryptography , 2008, IEEE Trans. Very Large Scale Integr. Syst..

[11]  Zhen Wang,et al.  Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2^m) , 2012, IEEE Transactions on Computers.

[12]  Alfred Menezes,et al.  The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.

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

[14]  G. Nabil,et al.  Hardware implementation of elliptic curve digital signature algorithm (ECDSA) on Koblitz curves , 2012, 2012 8th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP).

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

[16]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

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