29 citations · 118 across the 25 of their papers we have counts for
3 papers · 1 filter
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…
Quantum solutions to possible challenges of Blockchain technology
Nivedita Dey, Mrityunjay Ghosh, Amlan Chakrabarti
Technological advancements of Blockchain and other Distributed Ledger Techniques (DLTs) promise to provide significant advantages to applications seeking transparency, redundancy,…