Skip to main content

Evaluation of Randomness Test Results for Short Sequences

  • Conference paper
Sequences and Their Applications – SETA 2010 (SETA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6338))

Included in the following conference series:

Abstract

Randomness testing of cryptographic algorithms are of crucial importance to both designer and the attacker. When block ciphers and hash functions are considered, the sequences subject to randomness testing are of at most 512-bit length, “short sequences”. As it is widely known, NIST has a statistical test suite to analyze the randomness properties of sequences and generators. However, some tests in this suite can not be applied to short sequences and most of the remaining ones do not produce reliable test values for the sequences in question. Consequently, the analysis method which is proposed in this suite is not suitable for evaluation of generators which produce relatively short sequences. In this work, we propose an alternative approach to analyze short sequences without tweaking the tests.

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. Soto, J.: Randomness Testing of the AES Candidate Algorithms (1999), http://csrc.nist.gov/aes/

  2. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications (2001), http://www.nist.gov

  3. Doğanaksoy, A., Çalık, Ç., Sulak, F., Turan, M.S.: New Randomness Tests Using Random Walk. In: National Cryptology Symposium II, Ankara (2006)

    Google Scholar 

  4. Marsaglia, G.: The Marsaglia Random Number CDROM Including The DIEHARD Battery of Tests of Randomness (1996), http://stat.fsu.edu/pub/diehard

  5. Haahr, M.: Pregenerated Random Numbers, http://www.random.org/files/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sulak, F., Doğanaksoy, A., Ege, B., Koçak, O. (2010). Evaluation of Randomness Test Results for Short Sequences. In: Carlet, C., Pott, A. (eds) Sequences and Their Applications – SETA 2010. SETA 2010. Lecture Notes in Computer Science, vol 6338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15874-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15874-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15873-5

  • Online ISBN: 978-3-642-15874-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics