Error Detection Schemes for Barrett Reduction of CT-BU on FPGA in Post Quantum Cryptography

• URL: http://arxiv.org/abs/2509.04070v1
• Date: Thu, 04 Sep 2025 10:03:47 GMT
• Title: Error Detection Schemes for Barrett Reduction of CT-BU on FPGA in Post Quantum Cryptography
• Abstract summary: This paper introduces a new algorithm, Recomputation with Swapped Operand (RESWO) for fault detection.<n>RESWO shows lesser delay compared to both RENO and RESO.<n>The fault detection efficiency of RESWO, RENO, and RESO is nearly 100%.
• Score: 0.9251324073335038
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A fault can occur naturally or intentionally. However, intentionally injecting faults into hardware accelerators of Post-Quantum Cryptographic (PQC) algorithms may leak sensitive information. This intentional fault injection in side-channel attacks compromises the reliability of PQC implementations. The recently NIST-standardized key encapsulation mechanism (KEM), Kyber may also leak information at the hardware implementation level. This work proposes three efficient and lightweight recomputation-based fault detection methods for Barrett Reduction in the Cooley-Tukey Butterfly Unit (CT-BU) of Kyber on a Field Programmable Gate Array (FPGA). The CT-BU and Barrett Reduction are fundamental components in structured lattice-based PQC algorithms, including Kyber, NTRU, Falcon, CRYSTALS-Dilithium, etc. 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 Barrett Reduction before. The proposed RESWO method consumes a similar number of slices compared to RENO and RESO. However, RESWO shows lesser delay compared to both RENO and RESO. The fault detection efficiency of RESWO, RENO, and RESO is nearly 100%.

Related papers

• EI-DDLGN: Efficient Encrypted Inference with Deep Differentiable Logic Gate Networks under TFHE [0.0]
  We present EI-DDLGN, the first in-depth study of TFHE-based DDLGN inference.<n>We also introduce Model-Fixed-Wire PBS Bypass, a semantics-preserving execution strategy.<n> Evaluations across 72 depth-width configurations on MNIST, FashionMNIST, and UCI Phishing show that DDLGNs constitute an efficient alternative to arithmetic TFHE inference.
  arXiv  Detail & Related papers  (2026-09-12T01:00:19Z)
• Measurement-Based Loss Tolerance in Graph-GKP Codes through Syndrome-Resolved Pauli-Frame Decoding [46.2474896050764]
  We develop a causal framework that unifies these mechanisms for measurement-based loss tolerance under pure loss.<n>We derive decoder-conditioned branch restriction, signed-outcome reconstruction, Pauli-frame updating, and syndrome-resolved logical fusion.<n>The resulting graph-GKP interface provides a unified causal control layer for fault-tolerant MBQC, fusion-based computation, and all-photonic repeaters.
  arXiv  Detail & Related papers  (2026-08-01T19:14:42Z)
• AI-Enabled Decoding of Qubit Loss for Quantum Error-Correcting Codes [16.0178741156376]
  Qubit loss is a major source of error in quantum computation.<n>We develop an artificial-intelligence-enabled decoder based on a Graph Neural Network architecture.
  arXiv  Detail & Related papers  (2026-04-15T17:59:35Z)
• Trojan-Resilient NTT: Protecting Against Control Flow and Timing Faults on Reconfigurable Platforms [2.5909615773091526]
  Number Theoretic Transform (NTT) is the most essential component for multiplications used in lattice-based Post-Quantum Cryptography (PQC) algorithms.<n>Side-channel attacks (SCA) and hardware vulnerabilities in the form of hardware Trojans may alter control signals to disrupt the circuit's control flow.<n>We present a secure NTT architecture capable of detecting unconventional delays, control-flow disruptions, and SASCA.
  arXiv  Detail & Related papers  (2026-01-30T10:33:39Z)
• PropHunt: Automated Optimization of Quantum Syndrome Measurement Circuits [5.417269705653019]
  Syndrome Measurement (SM) circuits define a code's logical error rate.<n>PropHunt is an automated tool for optimizing SM circuits for CSS codes.<n>We also propose a near-term QEC application, Hook-ZNE, which leverages PropHunt's fine-grained control over logical error rate to improve Zero-Noise Extrapolation (ZNE)
  arXiv  Detail & Related papers  (2026-01-24T20:22:17Z)
• Lightweight Fault Detection Architecture for NTT on FPGA [0.8793721044482612]
  Post-Quantum Cryptographic (PQC) algorithms are mathematically secure and resistant to quantum attacks.<n>They can still leak sensitive information in hardware implementations due to natural faults or intentional fault injections.<n>This research proposes a lightweight, efficient, recomputation-based fault detection module.
  arXiv  Detail & Related papers  (2025-08-05T04:23:50Z)
• Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning [1.1891349121931318]
  We propose and explore reinforcement learning to automatically discover compact and hardware-adapted fault-tolerant quantum circuits. We show that in the task of fault-tolerant logical state preparation, RL discovers circuits with fewer gates and ancillary qubits than published results without and with hardware constraints of up to 15 physical qubits.
  arXiv  Detail & Related papers  (2024-02-27T18:55:13Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Check-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes [3.4602940992970908]
  We introduce a new post-processing algorithm with a hardware-friendly orientation, providing error correction performance competitive to the state-of-the-art techniques. We show that latency values close to one microsecond can be obtained on the FPGA board, and provide evidence that much lower latency values can be obtained for ASIC implementations.
  arXiv  Detail & Related papers  (2023-10-23T14:51:22Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)
• Refined Gate: A Simple and Effective Gating Mechanism for Recurrent Units [68.30422112784355]
  We propose a new gating mechanism within general gated recurrent neural networks to handle this issue. The proposed gates directly short connect the extracted input features to the outputs of vanilla gates. We verify the proposed gating mechanism on three popular types of gated RNNs including LSTM, GRU and MGU.
  arXiv  Detail & Related papers  (2020-02-26T07:51:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.