Abstract
A new statistical test for random bit generators is presented that is universal in the sense that any significant deviation of the output statistics from the statistics of a perfect random bit generator is detected with high probability when the defective generator can be modeled as an ergodic stationary source with finite memory. This is in contrast to most presently used statistical tests which can detect only one type of non-randomness, for example, a bias in the distribution of 0’s and 1’s or a correlation between consecutive bits. Moreover, the new test, whose formulation was motivated by considering the universal data compression algorithms of Elias and of Willems, measures the entropy per output bit of a generator. This is shown to be the correct quality measure for a random bit generator in cryptographic applications. A generator is thus rejected with high probability if and only if the cryptographic significance of a statistical defect is above a specified threshold. The test is easy to implement and very fast and thus well-suited for practical applications.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Beker and F. Piper, Cipher Systems, London: Northwood Books, 1982.
P. Elias, Interval and recency rank source coding: Two on-line adaptive variable-length schemes, IEEE Trans. Inform. Theory, vol. IT-33, pp. 3–10, Jan. 1987.
W. Feller, An Introduction to Probability Theory and its Applications, third ed., vol. 1, New York, NY: Wiley, 1968.
D.E. Knuth, The art of computer programming, vol. 2, 2nd edition, Reading, MA: Addison-Wesley, 1981.
R.A. Rueppel, Analysis and Design of Stream Ciphers, New York, NY: Springer, 1986.
C.E. Shannon, A mathematical theory of communication, Bell Syst. Tech. J., vol. 27, pp. 379–423, 623–656, Oct. 1948.
F.M.J. Willems, Universal data compression and repetition times, IEEE Trans. Inform. Theory, vol. IT-35, pp. 54–58, Jan. 1989.
J.M. Wozencraft and B. Reiffen, Sequential Decoding, Cambridge, MA: Techn. Press of the M.I.T., 1960.
J. Ziv, Compression, tests for randomness and estimating the statistical model of an individual sequence, in: Sequences (Ed. R.M. Capocelli), New York, NY: Springer Verlag, 1990.
J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory, vol. IT-23, pp. 337–343, May 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maurer, U.M. (1991). A Universal Statistical Test for Random Bit Generators. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_30
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive