A Parallel Architecture for Koblitz Curve Scalar Multiplications on FPGA Platforms

Elliptic curve scalar multiplication is the central operation in elliptic curve cryptography. The paper presents a parallel architecture to accelerate scalar multiplications on Koblitz curves. The scalar multiplier architecture converts the scalar into τ-NAF representation and processes the zero digits of the scalar in parallel to point additions. Since the conversion from integer to τ-NAF is a time consuming operation, the proposed architecture uses recently developed double lazy reduction algorithm for conversion of scalar. The scalar multiplier processes two consecutive τ-NAF digits in every iteration. This facilitates parallel processing of large number of consecutive zero digits during a single point addition and practically no time is spent for processing the zero digits of the scalar. The proposed techniques are incorporated in a scalar multiplier and validated on Xilinx Virtex IV FPGA. Experimental results show that our architecture in F2163 has the best performance and has the computation time comparable with the fastest known implementation, which uses window based scalar multiplication algorithm.

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

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

[3]  Chester Rebeiro,et al.  Revisiting the Itoh-Tsujii Inversion Algorithm for FPGA Platforms , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

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

[5]  Francisco Rodríguez-Henríquez,et al.  Cryptographic Algorithms on Reconfigurable Hardware (Signals and Communication Technology) , 2006 .

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

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

[8]  J. Olivos,et al.  Speeding up the computations on an elliptic curve using addition-subtraction chains , 1990, RAIRO Theor. Informatics Appl..

[9]  Christof Paar,et al.  Security on FPGAs: State-of-the-art implementations and attacks , 2004, TECS.

[10]  Chester Rebeiro,et al.  Power Attack Resistant Efficient FPGA Architecture for Karatsuba Multiplier , 2008, 21st International Conference on VLSI Design (VLSID 2008).

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

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

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

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

[15]  Vassil S. Dimitrov,et al.  FPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers , 2006, CHES.

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