R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences

---

Atıf İçin Kopyala

UĞUZ M., DOĞANAKSOY A., SULAK F., Kocak O.

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, cilt.11, sa.5, ss.921-949, 2019 (SCI-Expanded)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 11 Sayı: 5
• Basım Tarihi: 2019
• Doi Numarası: 10.1007/s12095-018-0334-1
• Dergi Adı: CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES
• Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
• Sayfa Sayıları: ss.921-949
• Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.