Predictive Models for Min-entropy Estimation

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, as in [5, 7, 10]. For this reason, correctly estimating the amount of entropy available from a source is critical.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[2]  Liam Paninski,et al.  Estimation of Entropy and Mutual Information , 2003, Neural Computation.

[3]  Ueli Maurer,et al.  A universal statistical test for random bit generators , 1990, Journal of Cryptology.

[4]  Aaron D. Wyner,et al.  Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression , 1989, IEEE Trans. Inf. Theory.

[5]  Aaron D. Wyner,et al.  Prediction and Entropy of Printed English , 1993 .

[6]  Benny Pinkas,et al.  Cryptanalysis of the random number generator of the Windows operating system , 2009, TSEC.

[7]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[8]  Benny Pinkas,et al.  Analysis of the Linux random number generator , 2006, 2006 IEEE Symposium on Security and Privacy (S&P'06).

[9]  Claude E. Shannon,et al.  Prediction and Entropy of Printed English , 1951 .

[10]  Khalid Sayood.  6 – Context-Based Compression , 2006 .

[11]  Patrick Hagerty,et al.  ENTROPY BOUNDS AND STATISTICAL TESTS , 2010 .

[12]  Eric Wustrow,et al.  Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices , 2012, USENIX Security Symposium.

[13]  Cédric Lauradoux,et al.  Online Entropy Estimation for Non-Binary Sources and Applications on iPhone , 2011 .

[14]  Shai Halevi,et al.  A model and architecture for pseudo-random generation with applications to /dev/random , 2005, CCS '05.

[15]  Yuri M. Suhov,et al.  Nonparametric Entropy Estimation for Stationary Processesand Random Fields, with Applications to English Text , 1998, IEEE Trans. Inf. Theory.

[16]  William M. Daley,et al.  Security Requirements for Cryptographic Modules , 1999 .

[17]  A. Antos,et al.  Convergence properties of functional estimates for discrete distributions , 2001 .