Akcengiz, ZiyaAsian, MelisKarabayir, OzgurDoganaksoy, AliUguz, MuhiddinSulak, FatihMathematics2024-07-052024-07-0520200978073812506010.1109/iscturkey51113.2020.9308005https://doi.org/10.1109/iscturkey51113.2020.9308005https://hdl.handle.net/20.500.14411/3443Random numbers have a wide usage in the area of cryptography. In practice, pseudo random number generators are used in place of true random number generators, as regeneration of them may be required. Therefore because of generation methods of pseudo random number sequences, statistical randomness tests have a vital importance. In this paper, a randomness test suite is specified for long binary sequences. In literature, there are many randomness tests and test suites. However, in most of them, to apply randomness test, long sequences are partitioned into a certain fixed length and the collection of short sequences obtained is evaluated instead. In this paper, instead of partitioning a long sequence into lixed length subsequences, a concept of dynamic partitioning is introduced in accordance with the random variable in consideration. Then statistical methods are applied. The suggested suite, containing four statistical tests: Collision Tests, Weight Test, Linear Complexity Test and Index Coincidence Test, all of them work with the idea of dynamic partitioning. Besides the adaptation of this approach to randomness tests, the index coincidence test is another contribution of this work. The distribution function and the application of all tests are given in the paper.eninfo:eu-repo/semantics/closedAccessRandomnessRandom NumberTest SuitesNIST SP 800-22Conference Object6874WOS:000676395800010