Paper 2015/600

Predictive Models for Min-Entropy Estimation

John Kelsey, Kerry A. McKay, and Meltem Sonmez Turan


Random numbers are essential for cryptography. In most real-world systems, these values come from a cryptographic pseudorandom number generator (PRNG), which in turn is seeded by an entropy source. The security of the entire cryptographic system then relies on the accuracy of the claimed amount of entropy provided by the source. If the entropy source provides less unpredictability than is expected, the security of the cryptographic mechanisms is undermined. For this reason, correctly estimating the amount of entropy available from a source is critical. In this paper, we develop a set of tools for estimating entropy, based on mechanisms that attempt to predict the next sample in a sequence based on all previous samples. These mechanisms are called predictors. We develop a framework for using predictors to estimate entropy, and test them experimentally against both simulated and real noise sources. For comparison, we subject the entropy estimates defined in the August 2012 draft of NIST Special Publication 800-90B to the same tests, and compare their performance.

Available format(s)
Publication info
Published by the IACR in CHES 2015
Entropy estimationMin-entropyRandom number generation
Contact author(s)
meltemsturan @ gmail com
2015-06-21: received
Short URL
Creative Commons Attribution


      author = {John Kelsey and Kerry A.  McKay and Meltem Sonmez Turan},
      title = {Predictive Models for Min-Entropy Estimation},
      howpublished = {Cryptology ePrint Archive, Paper 2015/600},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.