Abstract
A new statistical test for random bit generators is presented which, in contrast to presently used statistical tests, is universal in the sense that it can detect any significant deviation of a device's output statistics from the statistics of a truly random bit source when the device can be modeled as an ergodic stationary source with finite memory but arbitrary (unknown) state transition probabilities. The test parameter is closely related to the device's per-bit entropy which is shown to be the correct quality measure for a secret-key source in a cryptographic application. The test hence measures the cryptographic badness of a device's possible defect. The test is easy to implement and very fast and thus well suited for practical applications. A sample program listing is provided.
Article PDF
Similar content being viewed by others
References
H. Beker and F. Piper, Cipher Systems, London: Northwood Books, 1982.
R. E. Blahut, Principles and Practice of Information Theory, Reading, MA: Addison-Wesley, 1987.
E. J. Dudewicz and E. C. van der Meulen, Entropy-based tests of uniformity, Journal of the American Statistical Association, vol. 76, no. 376, Dec. 1981, pp. 967–974.
P. Elias, Interval and recency rank source coding: Two on-line adaptive variable-length schemes, IEEE Transactions on Information Theory, vol. 33, Jan. 1987, pp. 3–10.
W. Feller, An Introduction to Probability Theory and Its Applications, 3rd edn., vol. 1, New York: Wiley, 1968.
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Reading, MA: Addison-Wesley, 1979.
D. E. Knuth, The Art of Computer Programming, vol. 2, 2nd edn., Reading, MA: Addison-Wesley, 1981.
A. N. Kolmogorov, Three approaches to the quantitative definition of information, Problemy Peredachi Informatsii, vol. 1, no. 1, 1965, pp. 3–11.
P. Martin-Löf, The definition of random sequences, Information and Control, vol. 9, 1966, pp. 602–619.
J. L. Massey, An introduction to contemporary cryptology, Proceedings of the IEEE, vol. 76, no. 5, 1988, pp. 533–549.
C. E. Shannon, A mathematical theory of communication, Bell System Technical Journal, vol. 27, Oct. 1948, pp. 379–423 and 623–656.
F. M. J. Willems, Universal data compression and repetition times, IEEE Transactions on Information Theory, vol. 35, Jan. 1989, pp. 54–58.
J. M. Wozencraft and B. Reiften, Sequential Decoding, Cambridge, MA: Technical 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), Berlin: Springer-Verlag, 1990, pp. 366–373.
J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol. 23, May 1977, pp. 337–343.
Author information
Authors and Affiliations
Additional information
Communicated by Rainer A. Rueppel
This work was supported by Omnisec AG, Switzerland. A preliminary version of this paper was presented at Crypto '90, Aug. 11–15, 1990, Santa Barbara, CA.
Rights and permissions
About this article
Cite this article
Maurer, U.M. A universal statistical test for random bit generators. J. Cryptology 5, 89–105 (1992). https://doi.org/10.1007/BF00193563
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00193563