EUVIMEDEUVIMED entdecken
Crossref

Probabilistic Methods in Cryptology: Entropy, Tail Bounds, and Operational Randomness Testing

Mohamed Humaid Saleem

The Harvard Undergraduate Research Journal · 01.12.2025 · 16 (1)

DOI: 10.62571/gujf5t1klb25ms ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Harvard Undergraduate Research Journal, online erschienen am 01.12.2025. Verfasst von Mohamed Humaid Saleem.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Saleem, M. H. (2025). Probabilistic Methods in Cryptology: Entropy, Tail Bounds, and Operational Randomness Testing. The Harvard Undergraduate Research Journal, 16(1). https://doi.org/10.62571/gujf5t1klb25ms

Vancouver

Saleem MH. Probabilistic Methods in Cryptology: Entropy, Tail Bounds, and Operational Randomness Testing. The Harvard Undergraduate Research Journal. 2025;16(1). doi:10.62571/gujf5t1klb25ms

BibTeX
@article{Saleem2025,
  author = {Saleem, Mohamed Humaid},
  title = {Probabilistic Methods in Cryptology: Entropy, Tail Bounds, and Operational Randomness Testing},
  journal = {The Harvard Undergraduate Research Journal},
  year = {2025},
  volume = {16},
  number = {1},
  doi = {10.62571/gujf5t1klb25ms}
}
Kostenlos starten →