Skip to main content

On the Security of Random Sources

  • Conference paper
  • First Online:
Public Key Cryptography (PKC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1560))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Ash, Information theory, Dover publications, New-York, 1965.

    MATH  Google Scholar 

  2. M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput., vol. 13, no. 4, pp. 850–864, 1984

    Article  MATH  MathSciNet  Google Scholar 

  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 http://www.eleves.ens.fr:8080/home/coron/index.html

    Google Scholar 

  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. D. Knuth, The art of computer programming, Seminumerical algorithms, vol. 2, Addison-Wesley publishing company, Reading, pp. 2–160, 1969.

    Google Scholar 

  6. U. Maurer, A universal statistical test for random bit generators, Journal of cryptology, vol. 5, no. 2, pp. 89–105, 1992.

    MATH  MathSciNet  Google Scholar 

  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. J. Ziv, Compression tests for randomness and estimating the statistical model of an individual sequence, Sequences, pp. 366–373, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coron, J.S. (1999). On the Security of Random Sources. In: Public Key Cryptography. PKC 1999. Lecture Notes in Computer Science, vol 1560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49162-7_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-49162-7_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65644-9

  • Online ISBN: 978-3-540-49162-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics