Error Detection Schemes for Barrett Modular Multiplication of CT-BU on FPGA in PQC and FHE
IEEE Transactions on Emerging Topics in Computing · 2026-04 · 14 (2) · 734-745
DOI: 10.1109/tetc.2026.3698063 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Emerging Topics in Computing, 2026-04. Verfasst von Paresh Baidya und 3 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Gefördert von: CEFIPRA CSRP Project, ANRF-PMECRG.
Abstract (Originalsprache)
Unintentional or intentionally faults into hardware accelerators of Post-Quantum Cryptography (PQC) or Fully Homomorphic Encryption (FHE) algorithms may lead to the leakage of sensitive information. If appropriate fault protection mechanisms are not employed, recent PQC schemes such as Kyber, Dilithium, Falcon, and NTRU, as well as FHE schemes such as Brakerski-Fan-Vercauteren (BFV) and Brakerski Gentry Vaikuntanathan (BGV), may leak sensitive information at the hardware implementation level. This work proposes three efficient recomputation-based fault detection methods for Barrett Modular Multiplication ( $BMM$ B M M ) in the Cooley–Tukey Butterfly Unit ( $CT$ C T - $BU$ B U ) of Number Theoretic Transform ( $NTT$ N T T ), implemented on a Field-Programmable Gate Array (FPGA) for PQC and FHE algorithms. The $CT$ C T - $BU$ B U and $BMM$ B M M are fundamental components in lattice-based PQC and FHE schemes. This paper introduces a new algorithm, Recomputation with Swapped Operand (RESWO), for fault detection. While Recomputation with Negated Operand (RENO) and Recomputation with Shifted Operand (RESO) are existing methods used in other PQC hardware algorithms. To the best of our knowledge, RENO and RESO have never been used in wordwise $BMM$ B M M before. The proposed RESWO method consumes a comparable number of slices to RENO and RESO. However, for most PQC and FHE variants, RESWO achieves lower energy consumption and reduced slice utilization compared to both RENO and RESO. The fault detection efficiency of RESWO, RENO, and RESO is nearly $\sim$ ∼ 100%.
Förderung
- CEFIPRA CSRP Project
- ANRF-PMECRG
Zitieren
APA
Baidya, P., Paul, R., Srivastava, V., & Debnath, S. K. (2026). Error Detection Schemes for Barrett Modular Multiplication of CT-BU on FPGA in PQC and FHE. IEEE Transactions on Emerging Topics in Computing, 14(2), 734-745. https://doi.org/10.1109/tetc.2026.3698063
Vancouver
Baidya P, Paul R, Srivastava V, Debnath SK. Error Detection Schemes for Barrett Modular Multiplication of CT-BU on FPGA in PQC and FHE. IEEE Transactions on Emerging Topics in Computing. 2026;14(2):734-745. doi:10.1109/tetc.2026.3698063
BibTeX
@article{Baidya2026,
author = {Baidya, Paresh and Paul, Rourab and Srivastava, Vikas and Debnath, Sumit Kumar},
title = {Error Detection Schemes for Barrett Modular Multiplication of CT-BU on FPGA in PQC and FHE},
journal = {IEEE Transactions on Emerging Topics in Computing},
year = {2026},
volume = {14},
number = {2},
pages = {734--745},
doi = {10.1109/tetc.2026.3698063}
}
EUVIMED