Uguz, MuhiddinDoganaksoy, AliSulak, FatihKocak, OnurMathematics2024-07-052024-07-05201921936-24471936-245510.1007/s12095-018-0334-12-s2.0-85070474541https://doi.org/10.1007/s12095-018-0334-1https://hdl.handle.net/20.500.14411/3319In 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.eninfo:eu-repo/semantics/closedAccessCryptographyStatistical randomness testingGolomb's randomness postulatesCompositionsRun testArticleQ2Q3115921949WOS:000480489100006