An energy-efficient FPGA-based soft-core processor with a configurable word size ECC arithmetic accelerator

This paper proposes an FPGA-based soft core processor architecture equipped with a configurable accelerator to speed up GF(2m) arithmetic for elliptic curve cryptography (ECC) systems. Focusing on the fact the number of operations required for GF(2m) arithmetic is influenced by the relationship between the irreducible polynomial and the machine word size, we propose an approach where the word size of the accelerator is tailored to a given irreducible polynomial. The evaluation results reveal that the performance and the energy efficiency of GF(2m) multiplication including reduction can be improved by up to 6.67 times and 5.24 times, respectively.

[1]  Yuichiro Shibata,et al.  A soft-core processor for finite field arithmetic with a variable word size accelerator , 2014, 2014 24th International Conference on Field Programmable Logic and Applications (FPL).

[2]  Michael Scott,et al.  Optimal Irreducible Polynomials for GF(2m) Arithmetic , 2007, IACR Cryptol. ePrint Arch..

[3]  Christof Paar,et al.  Reconfigurable Instruction Set Extension for Enabling ECC on an 8-Bit Processor , 2004, FPL.

[4]  Kazumaro Aoki,et al.  SEC X.2: Recommended Elliptic Curve Domain Parameters , 2008 .

[5]  Jian Huang,et al.  FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field , 2008, J. Syst. Archit..

[6]  Kris Gaj,et al.  FPGA accelerated tate pairing based cryptosystems over binary fields , 2006, 2006 IEEE International Conference on Field Programmable Technology.