Constant-time hardware implementation of Modular Inversion with Kaliski’s Algorithm for ECC

Khai Nguyen, Tung Nguyen, Hung Nguyen and Linh Tran

PLOS ONE, 2026, vol. 21, issue 7, 1-13

Abstract: This paper introduces a hardware architecture designed for constant-time modular inversion over prime fields, a critical function in Elliptic Curve Cryptography (ECC). We use Kaliski’s Almost Inversion Algorithm to develop an efficient FPGA-based solution. The proposed design guarantees constant-time execution, optimizing modular inverse computations for ECC applications. When synthesized on a Xilinx Kintex-7 FPGA, the accelerator reaches a frequency of 222.9 MHz, occupying 1.7k Slices without using any DSP blocks. This work focuses on improving the speed and resource usage of modular inversion units, specifically for resource-constrained digital environments.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0354145 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 54145&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0354145

DOI: 10.1371/journal.pone.0354145

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().