Area-Time Efficient Hardware Implementations of Polynomial Modular Division Algorithms over Galois Binary Finite Fields
Information · 17.11.2026 · 17 (11) · 1163
DOI: 10.3390/info17111163 ↗Kurz gefasst
Fachartikel in der Zeitschrift Information, online erschienen am 17.11.2026. Verfasst von Yamin Li. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Modular division is an essential but time-consuming computation in elliptic curve cryptography (ECC). This paper presents evaluation results of polynomial modular division algorithms over Galois binary finite fields using open-source and reproducible Verilog HDL code, with a particular focus on both Fermat’s Little Theorem (FLT) using the Itoh-Tsujii algorithm (ITA) and the extended Euclidean algorithm (EEA) in the same environment. To reduce the execution time of polynomial modular division, we investigate several architectures of ITA that use parallel squarers (PSQs). To reduce the kilo-area-time (KAT) product, we propose a polynomial Brunner extended Euclidean division algorithm (BEEDA) and a radix-4 BEEDA that achieve a very high frequency in hardware implementations. The experimental results on an Altera Cyclone 10 FPGA chip show that PSQs with 9, 29, and 3 squarers achieve shorter division execution time of 0.65 μs, 0.73 μs, and 1.97 μs; the BEEDA achieves lower KATs of 2.75, 5.72, and 9.11; and the radix-4 BEEDA achieves lower KATs of 2.51, 5.20, and 7.82, for Koblitz curves K-163, K-233, and K-283, respectively. Based on this evaluation, we conclude that PSQs are suitable for platforms with high-speed requirements and abundant resources, while our proposed BEEDA or radix-4 BEEDA is the optimal choice for resource-constrained FPGAs.
Zitieren
APA
Li, Y. (2026). Area-Time Efficient Hardware Implementations of Polynomial Modular Division Algorithms over Galois Binary Finite Fields. Information, 17(11), 1163. https://doi.org/10.3390/info17111163
Vancouver
Li Y. Area-Time Efficient Hardware Implementations of Polynomial Modular Division Algorithms over Galois Binary Finite Fields. Information. 2026;17(11):1163. doi:10.3390/info17111163
BibTeX
@article{Li2026,
author = {Li, Yamin},
title = {Area-Time Efficient Hardware Implementations of Polynomial Modular Division Algorithms over Galois Binary Finite Fields},
journal = {Information},
year = {2026},
volume = {17},
number = {11},
pages = {1163},
doi = {10.3390/info17111163}
}
EUVIMED