FPGA Implementation of Elliptic-Curve Point Multiplication Over GF(2233) Using Booth Polynomial Multiplier for Area-Sensitive Applications
Open Access
- 21 May 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 72847-72859
Abstract
This article presents an area-efficient hardware architecture for the implementation of elliptic-curve point multiplication (PM) operation over GF (2 233 ). The area is minimized through three strategies: (i) implementing a bit-serial-based Booth polynomial multiplication architecture to multiply two polynomials with clock cycles overhead, (ii) using one modular adder, Booth multiplier and square block in the arithmetic unit, and (iii) realizing the modular inversion computation using the implemented square and Booth multiplier circuits. Moreover, the critical path is evaluated by the placement of registers in the datapath of the PM and Booth multiplier architectures. Moreover, a dedicated finite-state machine is implemented for control functionalities. Finally, a figure-of-merit (FoM), defined as throughput/area, facilitates realistic comparisons. The implementation results are reported on Xilinx field-programmable gate array (FPGA) devices. On the Virtex-7 device, our accelerator utilizes 1343 slices and can operate on a maximum of 393 MHz , requiring 174457 clock cycles and 443.91μ s for one PM computation. It consumes 1361 mW power. The implementation results and comparison to state-of-the-art show that the proposed accelerator is suitable for cryptographic applications that demand lower hardware resource utilization without significant concerns regarding computation time.Keywords
Funding Information
- Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Research Project (RGP2/552/44)
This publication has 32 references indexed in Scilit:
- DCryp-Unit: Crypto Hardware Accelerator Unit Design for Elliptic Curve Point MultiplicationIEEE Access, 2024
- EGCrypto: A Low-Complexity Elliptic Galois Cryptography Model for Secure Data Transmission in IoTIEEE Access, 2023
- E${^2}$CSM: efficient FPGA implementation of elliptic curve scalar multiplication over generic prime field GF(p)The Journal of Supercomputing, 2023
- EC-Crypto: Highly Efficient Area-Delay Optimized Elliptic Curve Cryptography ProcessorIEEE Access, 2023
- An area-time efficient point-multiplication architecture for ECC over GF(2m) using polynomial basisMicroprocessors and Microsystems, 2022
- An Optimized Architecture for Binary Huff Curves With Improved SecurityIEEE Access, 2021
- An Open-source Library of Large Integer Polynomial Multipliers2021
- ECC2: Error correcting code and elliptic curve based cryptosystemInformation Sciences, 2020
- Throughput/area optimised pipelined architecture for elliptic curve crypto processorIET Computers & Digital Techniques, 2019
- High-performance ECC processor architecture design for IoT security applicationsThe Journal of Supercomputing, 2019