Evaluation of Randomness Test Results for Short Sequences
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.
KeywordsHash Function Random Sequence Test Suite Short Sequence Block Cipher
Unable to display preview. Download preview PDF.
- 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/