The SAC Test: A New Randomness Test, with Some Applications to PRNG Analysis

  • Julio C. Hernandez
  • José María Sierra
  • Andre Seznec
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3043)

Abstract

A new statistical test for randomness, the SAC test, is presented, together with its results over some well-known generators in the literature. These results are analyzed and some possible applications of the test, as for measuring the strength of cryptographic primitives including block ciphers, stream ciphers and pseudorandom number generators, especially during the design and analysis phase, are detailed. Finally, the source code for the SAC test is provided, which proves some of its other advantages: it is easy to implement, and very fast so well-suited for practical applications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rukhin, A.L.: Testing Randomness: A suite of statistical procedures. SIAM Journal on Theory of Probability and its applications 45 (2000)Google Scholar
  2. 2.
    Maurer, U.M.: A universal statistical test for random bit generators. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 409–420. Springer, Heidelberg (1991)Google Scholar
  3. 3.
    Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol. 2. Prentice Hall PTR, Englewood Cliffs (1997)Google Scholar
  4. 4.
    Marsaglia, G.D.: A battery of tests for randomness (1996), http://stat.fsu.edu/geo/diehard.html
  5. 5.
    Soto, J.: Statistical Testing of Random Number Generators. In: Proceedings of the 22nd National Information Systems Security Conference (1999)Google Scholar
  6. 6.
    Marsaglia, G., Tsang, W.W.: Some Difficult-to-pass Tests of Randomness. Journal of Statistical Software 7(3) (2002)Google Scholar
  7. 7.
    Center for Information Security and Cryptography (CISC) Library of Tests for Random Number Generators at, http://www.csis.hku.hk/cisc/download/idetect/
  8. 8.
    Coron, J.S., Naccache, D.: An Accurate Evaluation of Maurer’s Universal Test. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, p. 57. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  9. 9.
    Forre, R.: The strict avalanche criterion: spectral properties of booleans functions and an extended definition. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 450–468. Springer, Heidelberg (1990)Google Scholar
  10. 10.
    Webster, A., Tavares, S.: On the design of S-boxes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 523–534. Springer, Heidelberg (1986)Google Scholar
  11. 11.
    Feistel, H.: Cryptography and Computer Privacy. Scientific American 228(5), 15–23 (1973)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Julio C. Hernandez
    • 1
  • José María Sierra
    • 2
  • Andre Seznec
    • 1
  1. 1.INRIA-IRISACAPS TEAMRennesFrance
  2. 2.Carlos III UniversityLeganés, MadridSpain

Personalised recommendations