A Compact and Low Latency SPM Architecture for ECC Cryptosystems
Open Access
- 3 October 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 147552-147563
Abstract
Elliptic curve cryptography (ECC) is largely deployed public key cryptographic algorithms in the design of key exchange, digital signature, and secure multiparty computation protocols. A compact and high-performance implementation of ECC is essential to enable deployments of associated protocols in privacy-preserving applications. Scalar point multiplication (SPM), the chief and performance-limiting primitive in ECC is computationally intensive. To speed up the computation of SPM with low resource consumption, this paper presents ComCrypt, a novel compact and low latency hardware architecture over any generic prime field. The proposed design features new novel unified hardware architectures for low-level finite field arithmetic primitives. These architectures are developed by introducing optimization both at algorithmic and circuit levels. In these basic primitives, parallelism opportunities are exploited at the algorithmic level to increase the achievable frequency, whereas, a novel resource-sharing strategy is deployed to reduce the hardware cost at the circuit level. Due to these efforts, the proposed SPM design produces better area-time product and efficiency results. It is implemented on Xilinx Virtex-7, Kintex-7, and Virtex-6 FPGA platforms for 256-bit modulus length. It significantly improves latency and resource consumption compared to the existing ECC-based hardware accelerators.Keywords
Funding Information
- University of Sharjah (2202150130, 2402150143)
This publication has 48 references indexed in Scilit:
- Area‐time efficient point multiplication architecture on twisted Edwards curve over general prime field GF(p)International Journal of Circuit Theory and Applications, 2023
- E${^2}$CSM: efficient FPGA implementation of elliptic curve scalar multiplication over generic prime field GF(p)The Journal of Supercomputing, 2023
- Flexible and area-efficient Galois field Arithmetic Logic Unit for soft-core processorsComputers and Electrical Engineering, 2022
- High‐speed parallel reconfigurable Fp multipliers for elliptic curve cryptography applicationsInternational Journal of Circuit Theory and Applications, 2022
- Efficient implementation of Montgomery modular multiplier on FPGAComputers and Electrical Engineering, 2022
- An efficient hardware implementation of the elliptic curve cryptographic processor over prime field,International Journal of Circuit Theory and Applications, 2020
- High-performance ECC processor architecture design for IoT security applicationsThe Journal of Supercomputing, 2019
- A high‐speed RSD‐based flexible ECC processor for arbitrary curves over general prime fieldInternational Journal of Circuit Theory and Applications, 2018
- Montgomery curves and their arithmeticJournal of Cryptographic Engineering, 2017
- Low latency flexible FPGA implementation of point multiplication on elliptic curves over GF(p)International Journal of Circuit Theory and Applications, 2016