Abstract
In this article a family of statistical randomness tests for binary strings are introduced, based on Golomb’s pseudorandomness postulate R-2 on the number of runs. The basic idea is to construct recursive formulae with computationally tenable probability distribution functions. The technique is illustrated on testing strings of \(2^{7}\), \(2^{8}\), \(2^{10}\) and \(2^{12}\) bits. Furthermore, the expected value of the number of runs with a specific length is obtained. Finally the tests are applied to several collections of strings arising from different pseudorandom number generators.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Golomb, W.S.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1982)
Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol. 2, Addison-Wesley Longman Publishing Co., Inc., Seminumerical Algorithms, Boston (1997)
L’ecuyer, P., Simard, R.: Testu01: A C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4), 22 (2007)
Mood, A.M.: The distribution theory of runs. Ann. Math. Stat. 11.4, 367–392 (1940)
Fu, J.C., Koutras, M.V.: Distribution theory of runs: a Markov chain approach. J. Am. Stat. Assoc. 89.427, 1050–1058 (1994)
Marsaglia, G.: The Marsaglia Random Rumber CDROM Including the Diehard Battery of Tests of Tandomness, http://www.stat.fsu.edu/pub/diehard/ (1995)
Bassham III, L.E., Rukhin, A.L., Soto, J., et al.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. Tech. Rep Sp 800-22 Rev. 1a, NIST, Gaithersburg (2010)
Doğanaksoy, A., Sulak, F., Uğuz, M., Şeker, O., Akcengiz, Z.: New statistical randomness tests based on length of runs. Math. Probl. Eng. 2015(626408), 14 (2015)
van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, New York (1993)
Chinn, P., Heubach, S.: Compositions of n with no occurence of k. Congressus Numerantium 164, 33–51 (2003)
Heubach, S., Mansour, T.: Compositions of n with Parts in a Set. Congressus Numerantium 168, 127–143 (2004)
Richmond, B., Knopfmacher, A.: Compositions with distinct parts. Aequationes Math. 49(1-2), 86–87 (1995)
Malandro, M.E.: Integer Compositions with Part Sizes not Exceeding k, Preprint available at: https://arxiv.org/pdf/1108.0337v2.pdf (2012)
Munagi, A.O., Sellers, J.A.: Some inplace identities for integer compositions. Quaest. Math. 38(4), 535–540 (2015)
Chinn, P., Heubach, S.: (1,K)-compositions. Congressus Numerantium 164, 183–194 (2003)
Jaklic, G., Vitrih, V., Zagar, E.: Closed form formula for the number of restricted compositions. Bull. Aus. Math. Soc. 81, 289–297 (2010)
Sulak, F., Doğanaksoy, A., Ege, B., Koçak, O.: Evaluation of Randomness Test Results for Short Sequences, Sequences and Their Applications, vol. 6338, pp 310–319. SETA 2010, Lecture Notes in Computer Science, Berlin (2010)
Daeman, J., Rijmen, V.: The Design of Rijndael: AES - the Advanced Encryption Standard. Springer, Berlin (2002)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
Rights and permissions
About this article
Cite this article
Uğuz, M., Doğanaksoy, A., Sulak, F. et al. R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences. Cryptogr. Commun. 11, 921–949 (2019). https://doi.org/10.1007/s12095-018-0334-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-018-0334-1