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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Area-Efficient FPGA Implementation of Elliptic Curve Point Multiplication for Cryptography

Md. Moshiur Rahman, Md. Sazedur Rahman, Ibnul Zarrah, Md. Morsalin et al.
Cryptography and Residue Arithmetic
article

Area-Efficient FPGA Implementation of Elliptic Curve Point Multiplication for Cryptography

Md. Moshiur Rahman, Md. Sazedur Rahman, Ibnul Zarrah, Md. Morsalin, Pritom Mojumder
article en

Abstract

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.

Hajee Mohammad Danesh Science and Technology University (BD)
Openalex Percentile: Top 63%
Cryptography and Residue Arithmetic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.