Entropic Resilience: Information-Theoretic Limits of Post-Quantum Cryptography
PAULO SÉRGIO DE ANDRADE
The looming threat of large-scale quantum computers necessitates a paradigm shift in cryptographic design, giving rise to the field of Post-Quantum Cryptography (PQC). While the computational hardness assumptions underpinning PQC schemes are well-studied, their fundamental security limits from an information-theoretic perspective remain an area requiring deeper exploration. This paper introduces and systematically investigates the concept of "entropic resilience," defined as the inherent ability of a cryptographic system to maintain its security guarantees even under an adversary possessing unbounded computational power, provided only limited information about the secret components is revealed. We present a comprehensive framework for analyzing the information-theoretic security of prominent PQC families, including lattice-based, code-based, and hash-based schemes. Our methodology leverages various entropy measures, such as min-entropy and conditional entropy, to quantify the information leakage and the irreducible uncertainty preserved in cryptographic secrets. We derive theoretical bounds on the information-theoretic security for representative PQC constructions and discuss the implications of these bounds for parameter selection, key generation, and resistance against information-theoretic attacks and side channels. The findings highlight critical trade-offs between entropy requirements, efficiency, and the achievable level of provable security in a post-quantum world. Ultimately, this work provides a foundational understanding of the ultimate security boundaries for PQC, guiding the design of more robust and provably secure schemes against both classical and quantum adversaries.
•Nov 23, 2025•0 citations