On the Security of Random Sources

  • Jean -Sebastien Coron
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1560)


Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of a statistical test is to detect specific weaknesses in random sources.

Maurer’s universal test is a very common randomness test, capable of detecting a wide range of statistical defects. The test is based on the computation of a function which is asymptotically related to the source’s entropy, which measures the effective key-size of block ciphers keyed by the source’s output.

In this work we develop a variant of Maurer’s test where the test function is in theory exactly equal to the source’s entropy, thereby enabling a better detection of defects in the tested source.


Block Cipher Memory Source Random Source Nite Memory Keystream Generation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Ash, Information theory, Dover publications, New-York, 1965.zbMATHGoogle Scholar
  2. 2.
    M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput., vol. 13, no. 4, pp. 850–864, 1984zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    J.-S. Coron, D. Naccache, An accurate evalutation of Maurer’s universal test. Proceedings of SAC’98, Lecture notes in computer science, springer-verlag, 1998. To appear. Available at Google Scholar
  4. 4.
    FIPS 140-1, Security requirements for cryptographic modules, Federal Information Processing Standards Publication 140-1, U.S. Department of Commerce / N.I.S.T., National Technical Information Service, Springfield, Virginia, 1994.Google Scholar
  5. 5.
    D. Knuth, The art of computer programming, Seminumerical algorithms, vol. 2, Addison-Wesley publishing company, Reading, pp. 2–160, 1969.Google Scholar
  6. 6.
    U. Maurer, A universal statistical test for random bit generators, Journal of cryptology, vol. 5, no. 2, pp. 89–105, 1992.zbMATHMathSciNetGoogle Scholar
  7. 7.
    C. Shannon, A mathematical theory of communication, The Bell system technical journal, vol. 27, pp. 379–423, 623–656, July–October, 1948.Google Scholar
  8. 8.
    J. Ziv, Compression tests for randomness and estimating the statistical model of an individual sequence, Sequences, pp. 366–373, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Jean -Sebastien Coron
    • 1
    • 2
  1. 1.Ecole Normale SupérieureParisFrance
  2. 2.Gemplus Card InternationalIssy-les-MoulineauxFrance

Personalised recommendations