Abstract

We study three probabilistic tools that underpin modern cryptology: (i) entropy (and min entropy) to quantify unpredictability and compressibility, (ii) Chernoff style concentration to detect non random leakage, and (iii) empirical batteries that operationalize indistinguishability. Rather than re proving standard inequalities, we state them precisely and apply them to a concrete detection problem, then situate the analysis with a short historical case study of Andrew Gleason in WWII.