Area-Efficient FPGA Implementation of Elliptic Curve Point Multiplication for Cryptography
Efficient elliptic curve point multiplication (ECPM) with minimal hardware resources is a crucial requirement in elliptic curve cryptography (ECC) for secure communication. To address this, a high-performance ECC processor (ECCP) has been developed, featuring an optimized architecture that operates over a 256-bit Fp. Supporting a 256-bit ECPM on the Edwards25519 curve in public-private key pair generation and digital signature schemes employs reduced hardware structures for point doubling and point addition, completing these operations in 516 and 1029 clock cycles, respectively. Only 1.48 ms is needed to execute a single ECPM at 213.2 MHz, achieving a throughput of 207 Kbps. With a resource utilization of only 7100 slices on a Virtex-7 FPGA, the design ensures a balance among area, speed, efficiency, and throughput rate. It is well-suited design for cryptographic applications that require high performance.
Authors
- Md. Moshiur Rahman
- Md. Sazedur Rahman (ORCID: https://orcid.org/0009-0008-4295-1708)
- Ibnul Zarrah
- Md. Morsalin
- Pritom Mojumder
Institutions
- Hajee Mohammad Danesh Science and Technology University (BD)
Publication Details
- Published
- 2025-06-27
- DOI
- https://doi.org/10.1109/ncim65934.2025.11160183
- Primary Topic
- Cryptography and Residue Arithmetic
- Type
- article
- Field-Weighted Citation Impact
- 0.00