6 papers
A Lightweight Fault-Detection Scheme for Barrett Modular Multiplication Using Multiple Conditional Reduction Paths
Rourab Paul, Paresh Baidya, Krishnendu Guha +1
Polynomial multiplication is the most resource-, time-, and energy-critical operation in lattice-based Post-Quantum Cryptography (PQC) and Fully Homomorphic Encryption (FHE) scheme…
Trojan-Resilient NTT: Protecting Against Control Flow and Timing Faults on Reconfigurable Platforms
Rourab Paul, Krishnendu Guha, Amlan Chakrabarti
Number Theoretic Transform (NTT) is the most essential component for polynomial multiplications used in lattice-based Post-Quantum Cryptography (PQC) algorithms such as Kyber, Dili…
Error Detection Schemes for Barrett Reduction of CT-BU on FPGA in Post Quantum Cryptography
Paresh Baidya, Rourab Paul, Vikas Srivastava +1
A fault can occur naturally or intentionally. However, intentionally injecting faults into hardware accelerators of Post-Quantum Cryptographic (PQC) algorithms may leak sensitive i…
Lightweight Fault Detection Architecture for NTT on FPGA
Rourab Paul, Paresh Baidya, Krishnendu Guha
Post-Quantum Cryptographic (PQC) algorithms are mathematically secure and resistant to quantum attacks but can still leak sensitive information in hardware implementations due to n…
Energy-Efficient NTT Sampler for Kyber Benchmarked on FPGA
Paresh Baidya, Rourab Paul, Vikas Srivastava +1
Kyber is a lattice-based key encapsulation mechanism selected for standardization by the NIST Post-Quantum Cryptography (PQC) project. A critical component of Kyber's key generatio…
FastFlow in FPGA Stacks of Data Centers
Rourab Paul, Alberto Ottimo, Marco Danelutto
FPGA programming is more complex as compared to Central Processing Units (CPUs) and Graphics Processing Units (GPUs). The coding languages to define the abstraction of Register Tra…