Muhammad KASHIF, İhsan ÇİÇEK

Field-programmable gate array (FPGA) hardware design and implementation of a new area efficient elliptic curve crypto-processor

Elliptic curve cryptography provides a widely recognized secure environment for information exchange in resource-constrained embedded system applications, such as Internet-of-Things, wireless sensor networks, and radio frequency identification. As the elliptic-curve cryptography (ECC) arithmetic is computationally very complex, there is a need for dedicated hardware for efficient computation of the ECC algorithm in which scalar point multiplication is the performance bottleneck. In this work, we present an ECC accelerator that computes the scalar point multiplication for the NIST recommended elliptic curves over Galois binary fields by using a polynomial basis. We used the Montgomery algorithm with projective coordinates for the scalar point multiplication. We designed a hybrid finite field multiplier based on the standard Karatsuba and shift-and-add multiplication algorithms that achieve one finite field multiplication in m 2 clock cycles for a key-length of m. The proposed design has been modeled in Verilog hardware description language (HDL), functionally verified with simulations, and implemented for field-programmable gate array (FPGA) devices using vendor tools to demonstrate hardware efficiency. Finally, we have integrated the ECC accelerator as an AXI4 peripheral with a synthesizable microprocessor on an FPGA device to create an elliptic curve crypto-processor.

PDF

___

[1] Wadhe A, Sabhle N. Mobile SMS banking security using elliptic curve cryptosystem in binary field. Journal of Engg Res & App (IJERA) 2019; 3 (3): 413-420.
[2] Bai T P, Rabara S, Jerald A. Elliptic curve cryptography based securing framework for Internet of Things and cloud computing. In: WSEAS 2015 Conference on Recent Advances on Computer Engineering; Seoul, South Korea; 2015. pp. 65-74.
[3] Marin L, Pawlowski MP, Jara A. Optimized ECC implementation for secure communication between heterogeneous IoT devices. Sensors (Switzerland) 2015; 15 (9): 21478-21499.
[4] Koblitz N. Elliptic curve cryptosystems. Mathematics of Computation 1987; 48 (Jan): 203-209.
[5] Koblitz AH, Koblitz N, Menezes A. Elliptic curve cryptography: the serpentine course of a paradigm shift. Journal of Number Theory 2011; 131 (5): 781-814.
[6] Rashid M, Imran M, Jafri AR. Comparative analysis of flexible cryptographic implementations. In: 2016 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC); Talinn, Estonia; 2016. pp. 1-6.
[7] Trujillo-Olaya V, Sherwood T, Koç Ç K. Analysis of performance versus security in hardware realizations of small elliptic curves for lightweight applications. Journal of Cryptographic Engineering 2012; 2 (3): 179-188.
[8] Montgomery P. Speeding the pollard and elliptic curve methods of factorization. Mathematics of Computation 1987; 48 (Jan): 243-264.
[9] Imran M, Rashid M. Architectural review of polynomial bases finite field multipliers over GF(2 m ). In: 2017 Proceedings of IEEE International Conference on Communication, Computing and Digital Systems; Islamabad, Pakistan; 2017. pp. 331-336. March 2017.
[10] Kerry CF, Secretary A, Director CR. FIPS PUB 186-4 Federal Information Processing Standards Publication Digital Signature Standard (DSS), 2013.
[11] Karatsuba A, Ofman Y. Multiplication of multidigit numbers on automata. Soviet Physics Doklady 1963; 7: 595-596.
[12] Patel Z. Enhancing speed and reducing power of shift and add. International Journal Of Electrical, Electronics And Data Communication 2016; 4(Jun): 13-17.
[13] Rashid M, Imran M, Jafri AR, Kashif M. A Throughput/Area Optimized Pipelined Architecture for Elliptic Curve Crypto Processor. IET Computers & Digital Techniques 2019; 13 (5): 361-368.
[14] Hankerson D, Menezes A, Vanstone S. Guide to Elliptic Curve Cryptography. NY, USA: Springer-Verlag, 2004.
[15] Imran M, Kashif M, Rashid M. Hardware design and implementation of scalar multiplication in elliptic curve cryptography (ECC) over GF(2163) on FPGA. In: ICICT 2015 International Conference on Information and Communication Technologies; Karachi, Pakistan; 2015. pp. 4-7. 2016.
[16] Imran M, Shehzad F. FPGA Based Crypto Processor for Elliptic Curve Point Multiplication ECPM over GF 2 233. International Journal for Information Security Research (IJISR) 2017; 7 (3): 706-713.
[17] Khan Z U A, Benaissa M. High Speed ECC Implementation on FPGA over GF (2 m ) on FPGA. IEEE Transactions on Very Large Scale Integration Systems 2017; 25 (3): 165-176.
[18] Bonifus PL, George D. ECC Encryption Ssystem Uusing Encoded Multiplier and VEDIC Mathematics. International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering 2013; 2 (11): 5531-5538.
[19] Sutter G, Deschamps J, Imana J. Efficient elliptic curve point multiplication using digit-serial binary field operations. IEEE Transactions on Industrial Electronics 2013; 60 (Jan): 217-225.
[20] Bednara M, Grabbe C, Teich J, Gathen JVZ, Shokrollahi J. FPGA Designs of Parallel High Performance GF (2 233 ) Multipliers. In: ISCAS 2003 Proceedings of the 2003 IEEE International Symposium on Circuits and Systems; Bangkok, Thailand; 2003. pp. II-268. Computer Engineering 2003: 268-271.
[21] Fan H, Hasan M. A survey of some recent bit-parallel GF(2 n ) multipliers. Finite Fields and their Applications 2105; 32: 5-43.
[22] Jafri AR, Islam M, Imran M, Rashid M. Towards an Optimized Architecture for Unified Binary Huff Curves. Journal of Circuits, Systems and Computers 2017; 26 (11): 175-178.
[23] Imran M, Rashid M, Shafi I. Lopez Dahab based elliptic crypto processor (ECP) over GF(2163) for low-area applications on FPGA. In: ICEET 2018 International Conference on Engineering and Emerging Technologies; Lahore, Pakistan; 2018. pp. 1-6.
[24] Khan Z U, Benaissa M. High speed ECC implementation on FPGA over GF(2m). In: FPL 2015 25th International Conference on Field Programmable Logic and Applications; London, UK; 2015. pp. 1-6.
[25] Halak B, Waizi S S, Islam A. A Survey on Hardware Implementations of Elliptic Curve Cryptosystems. IACR Cryptology ePrint Archive 2016; 16 (712): .
[26] Itoh T, Tsujii S. A Fast algorithm for Computing Multiplicative Inverse in GF (2 m ) Using Normal Bases. Information and Computation 1988; 78 (3): 171-177.
[27] Benselama ZA, Bencherif MA, Khorissi N, Bencherchali MA. Low cost reconfigurable Elliptic Crypto-hardware. In: AICCSA 2014 Proceedings of IEEE/ACS International Conference on Computer Systems and Applications; Doha, Qatar; 2014. pp 788-792.
[28] Imran M, Shafi I, Jafri A, Rashid M. Hardware design and implementation of ECC based crypto processor for low-area-applications on FPGA. In: ICOSST 2017 Proceedings of 2017 International Conference on Open Source Systems and Technologies; Lahore, Pakistan; 2018. pp. 54-59.
[29] Panchbhai M, Ghodeswar US. Implementation of point addition & point doubling for Elliptic Curve. In: ICCSP 2015 International Conference on Communication and Signal Processing; Chengdu, China; 2015. pp. 746-749.