Paper 2024/551
Probabilistic Algorithms with applications to countering Fault Attacks on Lattice based Post-Quantum Cryptography
Abstract
Fault attacks that exploit the propagation of effective/ineffective faults present a richer attack surface than Differential Fault Attacks, in the sense that the adversary depends on a single bit of information to eventually leak secret cryptographic material. In the recent past, a number of propagation-based fault attacks on Lattice-based Key Encapsulation Mechanisms have been proposed; many of which have no known countermeasures. In this work, we propose an orthogonal countermeasure principle that does not follow adhoc strategies (like shuffling operations on secret coefficients), but rather depends on cryptographically-backed guarantees to provide quantifiable defence against aforementioned fault attacks. Concretely, we propose a framework that uses rejection sampling (which has been traditionally used as alternatives to trapdoors) to convert otherwise deterministic algorithms to probabilistic ones. Our specific goals allow careful selection of distributions such that our framework functions with a constant number of retries (around
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- Keywords
- rejection samplingpost-quantum cryptographyfault attacks
- Contact author(s)
-
nimish mishra @ kgpian iitkgp ac in
debdeep @ cse iitkgp ac in - History
- 2024-04-10: approved
- 2024-04-09: received
- See all versions
- Short URL
- https://ia.cr/2024/551
- License
-
CC BY-NC-SA
BibTeX
@misc{cryptoeprint:2024/551, author = {Nimish Mishra and Debdeep Mukhopadhyay}, title = {Probabilistic Algorithms with applications to countering Fault Attacks on Lattice based Post-Quantum Cryptography}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/551}, year = {2024}, url = {https://eprint.iacr.org/2024/551} }