Fatih SULAK, Ali DOĞANAKSOY, Muhiddin UĞUZ, Okan ŞEKER, Ziya AKCENGİZ

Mutual correlation of NIST statistical randomness tests and comparison of theirsensitivities on transformed sequences

Random sequences are widely used in many cryptographic applications and hence their generation is oneof the main research areas in cryptography. Statistical randomness tests are introduced to detect the weaknesses ornonrandom characteristics that a sequence under consideration may have. In the literature, there exist various statisticalrandomness tests and test suites, de ned as a collection of tests. An efficient test suite should consist of a number ofuncorrelated statistical tests each of which measures randomness from another point of view. `Being uncorrelated' is nota well-de ned or well-understood concept in the literature. In this work, we apply Pearson's correlation test to measurethe correlation between the tests.In addition, we de ne ve new methods for transforming a sequence. Our motivation is to detect those testswhose results are invariant under a certain transformation. To observe the correlation, we use two methods. One is thedirect correlation between the tests and the other is the correlation between the results of a test on the sequence andits transformed form. In light of the observations, we conclude that some of the tests are correlated with each other.Furthermore, we conclude that in designing a reliable and efficient suite we can avoid overpopulating the list of testfunctions by employing transformations together with a reasonable number of statistical test functions.

PDF

___

[1]Turan MS. On statistical analysis of synchronous stream ciphers. PhD, Middle East Technical University, Ankara,Turkey, 2008.
[2]Golomb SW. Shift Register Sequences. Laguna Hills, CA, USA: Aegean Park Press, 1982.
[3]Knuth DE. The Art of Computer Programming, Volume 2 (3rd ed.): Seminumerical Algorithms. Boston, MA, USA:Addison-Wesley Longman Publishing Co, Inc., 1997.
[4]Caelli W. Crypt-X package documentation, technical report, Information Security Research, 1992.
[5]Marsaglia G. The Marsaglia random number CDROM including the DIEHARD battery of tests of randomness,http://www.stat.fsu.edu/pub/diehard/, 1995.
[6]Eddelbuettel D, Brown RG. DIEHARDER: an r interface to the dieharder suite of random number generator tests,2007.
[7]L'Ecuyer P, Simard R. Testu01: a c library for empirical testing of random number generators. ACM T Math Softw2007; 33.
[8]Bassham LE, Rukhin AL, Soto J, Nechvatal JR, Smid ME, Barker EB, Leigh SD, Levenson M, Vangel M, Banks DLet al. Sp 800-22 rev. 1a. a statistical test suite for random and pseudorandom number generators for cryptographicapplications, technical report, NIST, Gaithersburg, MD, United States, 2010.
[9]Soto J, Bassham L. Randomness testing of the advanced encryption standard nalist candidates, in NIST IR 6483,National Institute of Standards and Technology, 1999.
[10]Turan MS, Doganaksoy A, Boztas S. On independence and sensitivity of statistical randomness tests. In InternationalConference on Sequences and Their Applications (SETA), Lecture Notes in Computer Science. Springer, 2008.
[11]Doganaksoy A, Ege B, Mus K. Extended results for independence and sensitivity of NIST randomness tests, inInformation Security and Cryptography Conference, ISC Turkey, 2008.
[12]Fan L, Chen H, Gao S. A general method to evaluate the correlation of randomness tests. In: Kim Y, Lee H,Perrig A, editors. Information Security Applications, Lecture Notes in Computer Science, Springer InternationalPublishing, 2014. pp. 52-62.
[13]Hellekalek P, Wegenkittl S. Empirical evidence concerning AES. ACM T Model Comput Simul 2003; 13: 322-333.
[14]Moore DS. The Basic Practice of Statistics with Cdrom. 2nd edition, New York, NY, USA: W. H. Freeman & Co.,1999.
[15]Daemen J, Rijmen V. The Design of Rijndael: AES { The Advanced Encryption Standard. Berlin, Germany:Springer, 2002.