Low latency FPGA implementation of twisted Edward curve cryptography hardware accelerator over prime field

The performance of any elliptic curve cryptography hardware accelerator significantly relies on the efficiency of the underlying point multiplication (PM) architecture. This article presents a hardware implementation of field-programmable gate array (FPGA) based modular arithmetic, group operation,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Scientific reports Ročník 15; číslo 1; s. 15097 - 15
Hlavní autoři: Hossain, Md Rownak, Rahman, Md Sazedur, Zaman, Kh Shahriya, Fezzani, Walid El, Bhuiyan, Mohammad Arif Sobhan, Kang, Chia Chao, Yew, Teh Jia, Miraz, Mahdi H.
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Nature Publishing Group UK 29.04.2025
Nature Portfolio
Témata:
639/166
639/166/987
ECC hardware accelerator
Field programmable gate array (FPGA)
Humanities and Social Sciences
Modular multiplication
multidisciplinary
Point multiplication
Science
Science (multidisciplinary)
Twisted Edward curve
Unified point operation
Unified point operation
Field programmable gate array (FPGA)
ECC hardware accelerator
Point multiplication
Modular multiplication
Twisted Edward curve
ISSN:2045-2322, 2045-2322
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The performance of any elliptic curve cryptography hardware accelerator significantly relies on the efficiency of the underlying point multiplication (PM) architecture. This article presents a hardware implementation of field-programmable gate array (FPGA) based modular arithmetic, group operation, and point multiplication unit on the twisted Edwards curve (Edwards25519) over the 256-bit prime field. An original hardware architecture of a unified point operation module in projective coordinates that executes point addition and point doubling within a single module has been developed, taking only 646 clock cycles and ensuring a better security level than conventional approaches. The proposed point multiplication module consumes 1.4 ms time, operating at a maximal clock frequency of 117.8 MHz utilising 164,730 clock cycles having 183.38 kbps throughput on the Xilinx Virtex-5 FPGA platform for 256-bit length of key. The comparative assessment of latency and throughput across various related recent works indicates the effectiveness of our proposed PM architecture. Finally, this high throughput and low latency PM architecture will be a good candidate for rapid data encryption in high-speed wireless communication networks.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:2045-2322
2045-2322
DOI:10.1038/s41598-025-99100-x