Constant-time hardware implementation of Modular Inversion with Kaliski’s Algorithm for ECC
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.
Authors
- Linh Tran (ORCID: https://orcid.org/0000-0001-6490-5413)
- Khai Nguyen
- Hung Van Nguyen (ORCID: https://orcid.org/0000-0002-1282-319X)
- Tung Nguyen
Publication Details
- Journal
- PLoS ONE
- Published
- 2026-07-28
- DOI
- https://doi.org/10.1371/journal.pone.0354145
- Primary Topic
- Cryptography and Residue Arithmetic
- Type
- article
- Field-Weighted Citation Impact
- 0.00