KHNTT: A Configurable and High-Performance Polynomial Multiplication Unit Based on FPGA
IEEE Transactions on Circuits and Systems I: Regular Papers · 2026-05 · 73 (5) · 3410-3423
DOI: 10.1109/tcsi.2026.3667103 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Circuits and Systems I: Regular Papers, 2026-05. Verfasst von Bin Li und 5 weiteren Autor:innen. Die Arbeit nennt 36 Literaturangaben. Gefördert von: Open Fund of Advanced Cryptography and System Security Key Laboratory of Sichuan Province, Songshan Laboratory.
Abstract (Originalsprache)
Polynomial multiplication is a critical performance bottleneck in lattice-based cryptographic schemes, in which efficient and flexible hardware implementations are essential. This paper presents a high-performance and reconfigurable polynomial multiplication unit that integrates the cooptimization of algorithmic and architectural optimizations. As the core operation of polynomial multiplication, we propose the Karatsuba-based high-efficiency radix-4 number theoretic transform (KHNTT) algorithm, which reduces the computational complexity by leveraging low-bit-width arithmetic and parallel processing techniques. Based on this algorithm, we develop a unified radix-4 butterfly unit capable of supporting modular polynomial operations under various parameter configurations, and to further improve the computational efficiency and architectural flexibility, key algorithm modules such as modular reduction and data flow scheduling are deeply optimized. Furthermore, we introduce an iterative interleaving memory strategy combined with a bank resource sharing mechanism to eliminate memory access conflicts and improve data access efficiency. The proposed polynomial multiplication unit allows flexible configuration of the butterfly units and supports polynomial computations of various degrees without the need for recompilation. The FPGA implementation results demonstrate that, compared with existing solutions, our architecture achieves a $1.25\times $ to $5.27\times $ improvement in the polynomial multiplication throughput and a $1.14\times $ to $2.7\times $ enhancement in the area efficiency, fully leveraging the computational advantages of FPGAs.
Förderung
- Open Fund of Advanced Cryptography and System Security Key Laboratory of Sichuan Province
- Songshan Laboratory
Zitieren
APA
Li, B., Han, H., Liu, L., Yu, S., Zhou, Q., & Li, B. (2026). KHNTT: A Configurable and High-Performance Polynomial Multiplication Unit Based on FPGA. IEEE Transactions on Circuits and Systems I: Regular Papers, 73(5), 3410-3423. https://doi.org/10.1109/tcsi.2026.3667103
Vancouver
Li B, Han H, Liu L, Yu S, Zhou Q, Li B. KHNTT: A Configurable and High-Performance Polynomial Multiplication Unit Based on FPGA. IEEE Transactions on Circuits and Systems I: Regular Papers. 2026;73(5):3410-3423. doi:10.1109/tcsi.2026.3667103
BibTeX
@article{Li2026,
author = {Li, Bin and Han, Heru and Liu, Linying and Yu, Shiliang and Zhou, Qinglei and Li, Binyong},
title = {KHNTT: A Configurable and High-Performance Polynomial Multiplication Unit Based on FPGA},
journal = {IEEE Transactions on Circuits and Systems I: Regular Papers},
year = {2026},
volume = {73},
number = {5},
pages = {3410--3423},
doi = {10.1109/tcsi.2026.3667103}
}
EUVIMED