Browsing by Author "Sulak, Fatih"

Now showing 1 - 19 of 19

Blockchaın tabanlı e-oylama sistemlerinin katılım mahremiyeti analizi
(2022) Özdemir, Buse Yeşim; Sulak, Fatih; Mathematics
Teknoloji neredeyse her gün ilerlemektedir ve bu ilerleme, hayatımızdaki dengeyi değiştirmektedir. Bu değişikliklerden biri de oylama sistemlerinin artık uzaktan yapmanın elverişli olmasıdır. Uzaktan oylama sistemleri, genel olarak, seçtikleri adaya oy vermek için kimsenin fiziksel olarak belirli bir yerde bulunması gerekmediği anlamına gelen sistemlere verilen addır. Uzaktan oylama sistemlerine eklenen yeni teknolojilerden biri de blokzincir teknolojisidir. Bir e-oylama sistemi oluşturmak çok önemli bir konudur ve blokzincir teknolojisinin e-oylama sistemlerine entegrasyonu ile merkezi olmayan, değiştirilemez ve şeffaf hale gelebilirler. Bu geliştirmeler sayesinde e-oylama sistemi üyeleri (seçmenler, yetkililer vb.) birbirlerine daha çok güvenmekte ve böylece sistemin başarısı artmaktadır. Ek olarak, blok zinciri tabanlı e-oylama sistemleri diğer uzaktan oylama sistemlerinin sağlaması beklenen bütünlük, sağlamlık, anonimlik, yeniden oy kullanılamamazlık, adillik, uygunluk ve doğrulanabilirlik gibi temel isterleri sağlamasının yanı sıra katılım mahremiyeti isterini de sağlaması ö-nemlidir. Bu tezde; Zhang, Gajek, Lewandowsky, Zhou ve Krillov tarafından yayınla-nan blok zinciri tabanlı oylama sistemleri derinlemesine açıklanmış ve önerilen sistemlerde katılım gizliliği ilkesinin sağlanmadığı gösterilmiştir.
Caesar yarışmasına katılan ikinci tur aday algoritmaların istatistiksel rastgelelik testleri
(2016) Özdemir, Betül Aşkın; Sulak, Fatih; Mathematics
Simetrik anahtarlı şifreleme çalışmalarını geliştirmek için NIST ve IACR tarafından birçok yarışma düzenlenmiştir. Son zamanlarda kimlik denetimini sağlayan şifrelemenin önemi hızlı bir şekilde artmaktadır çünkü bütünlüğün, gizliliğin ve kimlik denetiminin aynı anda sağlanmasına ihtiyaç vardır. Bu tür güvenliğe ihtiyaç duyulmasından dolayı, Ocak 2013'te Erken Simetrik Kripto Çalıştayında CAESAR Yarışması duyurulmuştur. Bu yarışma IACR tarafından yürütülmektedir ve final algoritmalarını bu araştırma grubu seçecektir. Yarışma boyunca her turun sonunda birtakım algoritmalar elenecektir. Sonuç olarak, algoritmaların analizi CAESAR Yarışması için çok önemlidir. Bu amaçla, biz yarışma devam ettiği sürece AEGIS, Ascon, Joltik, MORUS, Pi-Cipher and Tiaoxin adlı algoritmalara istatistiksel rastgelelik testlerini uyguluyoruz. Bu tezde, biz istatistiksel rastgelelik testlerini kullanarak CAESAR Yarışması algoritmalarının analizine odaklandık ve algoritmaların istatistiksel rastgelelik testlerine göre hangi tur sayısına kadar rastgele davrandıklarını gözlemledik.
Citation Count: 0
Improvement on Bit Diffusion Analysis of π-Cipher
(De Gruyter Open Ltd, 2017) Sulak,F.; Bozdemir,B.; Özdemir,B.A.; Koçak,N.; Koçak,O.; Mathematics
π-Cipher, designed by Gligoroski et al., is a second round candidate of the CAESAR competition. The designers analyzed the bit diffusion of the cipher by examining the ∗ operation and 1 round π-function. We improve this analysis by applying Strict Avalanche Criterion (SAC) test to ∗ operation and reduced round versions of π-function for π 16-Cipher. We found out that ∗ operation fails SAC test whereas all versions of π-function for π 16-Cipher pass the test. © 2017 Mathematical Institute, Slovak Academy of Sciences.
KRİPTOLOJİ
(Bilim ve Teknoloji, 2015) Sulak, Fatih; Turan, Mehmet; Mathematics
Kriptografi, Yunancada “kriptos (gizli)” ve “graphi (yazı)” kelimelerinin birleşmesinden oluşur. Kriptoloji ise şifre bilimi olarak bilinir. Daha detaylı bir tanım yapmak istersek; kriptoloji belirli bir sisteme göre bir metnin şifrelenmesi, alıcıya güvenli bir şekilde iletilmesi ve alıcı tarafından şifreli metnin şifresinin çözülmesidir. İletişimin ve teknolojinin günümüzdeki kadar gelişmiş ve hızlı olmadığı zamanlarda, en çok kullanılan iletişim yöntemi mektuplaşmaydı. Mektup yazan kişi, mektubu yazdıktan sonra bir zarfa koyar, daha sonra alıcıya gönderirdi. Bunun amacı ise, yazılan mektubun başkaları tarafından okunmasını engellemekti. Bu örneği bir şifreleme sistemi gibi düşünürsek, şifrelemenin güvenli olması yani yabancı bir kişinin şifreli metni çözememesi önemli bir yere sahiptir.
Citation Count: 0
LS-14 test suite for long sequences
(Hacettepe Univ, Fac Sci, 2024) Akcengiz, Ziya; Aslan, Melis; Doganaksoy, Ali; Sulak, Fatih; Uguz, Muhiddin; Mathematics
Random number sequences are used in many branches of science. Because of many technical reasons and their practicality, pseudo random sequences are usually employed in place of true number sequences. Whether a sequence generated through a deterministic process is a pseudo random, in other words, random-looking sequence or it contains certain patterns, can be determined with the help of statistics and mathematics. Although, in the literature there are many statistical randomness tests for this purpose, there is no much work on test suites specialized for long sequences, that is sequences of length 1,000,000 bits or more. Most of the randomness tests for long sequences use some mathematical approximations to compute expected values of the random variables and hence their results contain some errors. Another approach to evaluate randomness criteria of long sequences is to partition the long sequence into a collection short sequences and evaluate the collection for the ran- domness using statistical goodness of fit tests. The main advantage of this approach is, as the individual sequences are short, there is no need to use mathematical approximations. On the other hand when the second approach is preferred, partition the long sequence into a collection of fixed length subsequences and this approach causes a loss of information in some cases. Hence the idea of dynamic partition should be included to perform a more reliable test suite. In this paper, we propose three new tests, namely the entire R2 run, dynamic saturation point, and dynamic run tests. Moreover, we intro duce a new test suite, called LS-14, consisting of 14 tests to evaluate randomness of long sequences. As LS-14 employs all three approaches: testing the entire long sequence, testing the collection of fixed length partitions of it, and finally, testing the collection obtained by the dynamic partitions of it, the proposed LS-14 test suit differs from all existing suites. Mutual comparisons of all 14 tests in the LS-14 suite, with each other are computed. Moreover, results obtained from the proposed test suite and NIST SP800-22 suite are compared. Examples of sequences with certain patterns which are not observed by NIST SP800-22 suite but detected by the proposed test suite are given.
Citation Count: 0
MODIFICATIONS OF KNUTH RANDOMNESS TESTS FOR INTEGER AND BINARY SEQUENCES
(2018) Koçak, Onur; Sulak, Fatih; Doğanaksoy, Ali; Uğuz, Muhiddin; Mathematics
Generating random numbers and random sequences that are in-distinguishable from truly random sequences is an important task for cryptog-raphy. To measure the randomness, statistical randomness tests are applied tothe generated numbers and sequences. Knuth test suite is the one of the .rststatistical randomness suites. This suite, however, is mostly for real numbersequences and the parameters of the tests are not given explicitly.In this work, we review the tests in Knuth Test Suite. We give test para-meters in order for the tests to be applicable to integer and binary sequencesand make suggestions on the choice of these parameters. We clarify how theprobabilities used in the tests are calculated according to the parameters andprovide formulas to calculate the probabilities. Also, some tests, like Per-mutation Test and Max-of-t-test, are modi.ed so that the test can be usedto test integer sequences. Finally, we apply the suite on some widely usedcryptographic random number sources and present the results.
Citation Count: 1
MODIFICATIONS OF KNUTH RANDOMNESS TESTS FOR INTEGER AND BINARY SEQUENCES
(Ankara Univ, Fac Sci, 2018) Kocak, Onur; Sulak, Fatih; Doganaksoy, Ali; Uguz, Muhiddin; Mathematics
Generating random numbers and random sequences that are indistinguishable from truly random sequences is an important task for cryptography. To measure the randomness, statistical randomness tests are applied to the generated numbers and sequences. Knuth test suite is the one of the first statistical randomness suites. This suite, however, is mostly for real number sequences and the parameters of the tests are not given explicitly. In this work, we review the tests in Knuth Test Suite. We give test parameters in order for the tests to be applicable to integer and binary sequences and make suggestions on the choice of these parameters. We clarify how the probabilities used in the tests are calculated according to the parameters and provide formulas to calculate the probabilities. Also, some tests, like Permutation Test and Max-of-t-test, are modified so that the test can be used to test integer sequences. Finally, we apply the suite on some widely used cryptographic random number sources and present the results.
Citation Count: 12
Mutual correlation of NIST statistical randomness tests and comparison of their sensitivities on transformed sequences
(Tubitak Scientific & Technological Research Council Turkey, 2017) Doganaksoy, Ali; Sulak, Fatih; Uguz, Muhiddin; Seker, Okan; Akcengiz, Ziya; Mathematics
Random sequences are widely used in many cryptographic applications and hence their generation is one of the main research areas in cryptography. Statistical randomness tests are introduced to detect the weaknesses or nonrandom characteristics that a sequence under consideration may have. In the literature, there exist various statistical randomness tests and test suites, defined as a collection of tests. An efficient test suite should consist of a number of uncorrelated statistical tests each of which measures randomness from another point of view. `Being uncorrelated' is not a well-defined or well-understood concept in the literature. In this work, we apply Pearson's correlation test to measure the correlation between the tests. In addition, we define five new methods for transforming a sequence. Our motivation is to detect those tests whose results are invariant under a certain transformation. To observe the correlation, we use two methods. One is the direct correlation between the tests and the other is the correlation between the results of a test on the sequence and its 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 test functions by employing transformations together with a reasonable number of statistical test functions.
Citation Count: 0
Mutual correlation of NIST statistical randomness tests and comparison of theirsensitivities on transformed sequences
(2017) Doğanaksoy, Ali; Sulak, Fatih; Uğuz, Muhiddin; Şeker, Okan; Akcengiz, Ziya; Mathematics
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.
Citation Count: 13
New Statistical Randomness Tests Based on Length of Runs
(Hindawi Ltd, 2015) Doganaksoy, Ali; Sulak, Fatih; Uguz, Muhiddin; Seker, Okan; Akcengiz, Ziya; Mathematics
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic protocols depend on random values. Randomness is measured by statistical tests and hence security evaluation of a cryptographic algorithm deeply depends on statistical randomness tests. In this work we focus on statistical distributions of runs of lengths one, two, and three. Using these distributions we state three new statistical randomness tests. New tests use chi(2) distribution and, therefore, exact values of probabilities are needed. Probabilities associated runs of lengths one, two, and three are stated. Corresponding probabilities are divided into five subintervals of equal probabilities. Accordingly, three new statistical tests are defined and pseudocodes for these new statistical tests are given. New statistical tests are designed to detect the deviations in the number of runs of various lengths from a random sequence. Together with some other statistical tests, we analyse our tests' results on outputs of well-known encryption algorithms and on binary expansions of e, pi, and root 2. Experimental results show the performance and sensitivity of our tests.
Citation Count: 26
On the independence of statistical randomness tests included in the NIST test suite
(Tubitak Scientific & Technological Research Council Turkey, 2017) Sulak, Fatih; Uguz, Muhiddin; Kocak, Onur; Doganaksoy, Ali; Mathematics
Random numbers and random sequences are used to produce vital parts of cryptographic algorithms such as encryption keys and therefore the generation and evaluation of random sequences in terms of randomness are vital. Test suites consisting of a number of statistical randomness tests are used to detect the nonrandom characteristics of the sequences. Construction of a test suite is not an easy task. On one hand, the coverage of a suite should be wide; that is, it should compare the sequence under consideration from many different points of view with true random sequences. On the other hand, an overpopulated suite is expensive in terms of running time and computing power. Unfortunately, this trade-off is not addressed in detail in most of the suites in use. An efficient suite should avoid use of similar tests, while still containing sufficiently many. A single statistical test gives a measure for the randomness of the data. A collection of tests in a suite give a collection of measures. Obtaining a single value from this collection of measures is a difficult task and so far there is no conventional or strongly recommended method for this purpose. This work focuses on the evaluation of the randomness of data to give a unified result that considers all statistical information obtained from different tests in the suite. A natural starting point of research in this direction is to investigate correlations between test results and to study the independences of each from others. It is started with the concept of independence. As it is complicated enough to work even with one test function, theoretical investigation of dependence between many of them in terms of conditional probabilities is a much more difficult task. With this motivation, in this work it is tried to get some experimental results that may lead to theoretical results in future works. As experimental results may reflect properties of the data set under consideration, work is done on various types of large data sets hoping to get results that give clues about the theoretical results. For a collection of statistical randomness tests, the tests in the NIST test suite are considered. Tests in the NIST suite that can be applied to sequences shorter than 38,912 bits are analyzed. Based on the correlation of the tests at extreme values, the dependencies of the tests are found. Depending on the coverage of a test suite, a new concept, the coverage efficiency of a test suite, is defined, and using this concept, the most efficient, the least efficient, and the optimal subsuites of the NIST suite are determined. Moreover, the marginal benefit of each test, which also helps one to understand the contribution of each individual test to the coverage efficiency of the NIST suite, is found. Furthermore, an efficient subsuite that contains five statistical randomness tests is proposed.
Citation Count: 1
On the independence of statistical randomness tests included in the NIST test suite
(2017) Sulak, Fatih; Uğuz, Muhiddin; Koçak, Onur; Doğanaksoy, Ali; Mathematics
Random numbers and random sequences are used to produce vital parts of cryptographic algorithms such as encryption keys and therefore the generation and evaluation of random sequences in terms of randomness are vital. Test suites consisting of a number of statistical randomness tests are used to detect the nonrandom characteristics of the sequences. Construction of a test suite is not an easy task. On one hand, the coverage of a suite should be wide; that is, it should compare the sequence under consideration from many different points of view with true random sequences. On the other hand, an overpopulated suite is expensive in terms of running time and computing power. Unfortunately, this trade-off is not addressed in detail in most of the suites in use. An efficient suite should avoid use of similar tests, while still containing sufficiently many. A single statistical test gives a measure for the randomness of the data. A collection of tests in a suite give a collection of measures. Obtaining a single value from this collection of measures is a difficult task and so far there is no conventional or strongly recommended method for this purpose. This work focuses on the evaluation of the randomness of data to give a uni ed result that considers all statistical information obtained from different tests in the suite. A natural starting point of research in this direction is to investigate correlations between test results and to study the independences of each from others. It is started with the concept of independence. As it is complicated enough to work even with one test function, theoretical investigation of dependence between many of them in terms of conditional probabilities is a much more difficult task. With this motivation, in this work it is tried to get some experimental results that may lead to theoretical results in future works. As experimental results may re ect properties of the data set under consideration, work is done on various types of large data sets hoping to get results that give clues about the theoretical results. For a collection of statistical randomness tests, the tests in the NIST test suite are considered. Tests in the NIST suite that can be applied to sequences shorter than 38,912 bits are analyzed. Based on the correlation of the tests at extreme values, the dependencies of the tests are found. Depending on the coverage of a test suite, a new concept, the coverage efficiency of a test suite, is de ned, and using this concept, the most efficient, the least efficient, and the optimal subsuites of the NIST suite are determined. Moreover, the marginal bene t of each test, which also helps one to understand the contribution of each individual test to the coverage efficiency of the NIST suite, is found. Furthermore, an efficient subsuite that contains ve statistical randomness tests is proposed.
Citation Count: 0
ON THE SUCCESS PROBABILITIES OF DIFFERENTIAL ATTACKS ON PRESENT
(2016) Sulak, Fatih; Şeker, Okan; Mathematics
Advanced growth in ubiquitous devices leads to increasing popularity of lightweight cryptography and as a result, various block ciphers are designed. The analysis of these algorithms has become popular and as a result, underlying theory of analysis tools including success probabilities has widely been studied recently. In this work, we focus on Present, a lightweight block cipher introduced by Bogdanov et al. and the analysis of this algorithm. We give a detailed information of differential cryptanalysis and multiple differential cryptanalysis on Present. Also, the underlying theory of statistical cryptanalysis are presented. As an important part of cryptanalysis, success probability is examined and expressed by the formulas given by Selçuk and Blondeau et al. The main aim of this work is to contribute to the theory of statistical cryptanalysis. Therefore, we give a general framework of statistical cryptanalysis and success probabilities. The details of success probabilities are given with experimental results. Also, we apply the sieving phase to decrease the cost of the attacks
Citation Count: 8
Periodic template tests: A family of statistical randomness tests for a collection of binary sequences
(Elsevier, 2019) Sulak, Fatih; Doganaksoy, Ali; Uguz, Muhiddin; Kocak, Onur; Mathematics
In this work, we classify all templates according to their periods and for each template we evaluate the exact probabilities using generating functions. Afterwards, we propose a new family of statistical randomness tests, that is periodic template tests, for a collection of binary sequences. We apply these tests to the outputs of AES, SHA-3, SHA-2 family, SHA-1 and MD5 and the binary expansion of pi and root 2 and biased non-random data to test the power of new tests. Moreover, we give the probabilities for all templates for the overlapping template matching test in the NIST test suite. Afterwards, we analyse the power of templates and compare the periodic template tests with NIST overlapping template test. (C) 2019 Elsevier B.V. All rights reserved.
Citation Count: 2
R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences
(Springer, 2019) Uguz, Muhiddin; Doganaksoy, Ali; Sulak, Fatih; Kocak, Onur; Mathematics
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.
Citation Count: 0
A SECOND PRE-IMAGE ATTACK AND A COLLISION ATTACK TO CRYPTOGRAPHIC HASH FUNCTION LUX
(2017) Sulak, Fatih; Koçak, Onur; Saygı, Elif; Öğünç, Merve Ö.; Bozdemır, Beyza; Mathematics
Cryptography is a science that provides the security of informationin communication. One of the most important sub-branches of cryptographyis the hash functions. Hash functions are known as the digital ...ngerprints.Following the recent attacks on the widely used hash functions MD5 and SHA1 and the increase in computational power, the need for a new hash functionstandard has arisen. For this purpose, US National Institute of Standards andTechnology (NIST) had announced a competition to select a standard hashfunction algorithm which would eventually become the Third Secure HashAlgorithm, SHA-3. Initially 64 algorithms were submitted to NIST and 51 ofthem were announced as the First Round Candidates. After an analysis period,14 of these algorithms were announced as the Second Round Candidates, and5 algorithms were announced as Finalists. The winner of the competition,Keccak, was announced in 2012.LUX is one of the 64 algorithms submitted to the SHA-3 competition byNikolic et al.function. For LUX-256, Schmidt-Nielsen gave a distinguisher and later Wu etal. presented collision attacks, both of which for reduced rounds of LUX. As aresult of these attacks, LUX is eliminated in the ...rst round. In this work, we...rst give a procedure for the second preimage attack. Then we extend this tothe collision and second preimage attacks for the reduced rounds of LUX hashfamily. Moreover, we implement the attacks and give the speci...c examples bytaking the padding into consideration.
Citation Count: 1
A SECOND PRE-IMAGE ATTACK AND A COLLISION ATTACK TO CRYPTOGRAPHIC HASH FUNCTION LUX
(Ankara Univ, Fac Sci, 2017) Sulak, Fatih; Kocak, Onur; Saygi, Elif; Ogunc, Merve; Bozdemir, Beyza; Mathematics
Cryptography is a science that provides the security of information in communication. One of the most important sub-branches of cryptography is the hash functions. Hash functions are known as the digital fingerprints. Following the recent attacks on the widely used hash functions MD5 and SHA-1 and the increase in computational power, the need for a new hash function standard has arisen. For this purpose, US National Institute of Standards and Technology (NIST) had announced a competition to select a standard hash function algorithm which would eventually become the Third Secure Hash Algorithm, SHA-3. Initially 64 algorithms were submitted to NIST and 51 of them were announced as the First Round Candidates. After an analysis period, 14 of these algorithms were announced as the Second Round Candidates, and 5 algorithms were announced as Finalists. The winner of the competition, Keccak, was announced in 2012. LUX is one of the 64 algorithms submitted to the SHA-3 competition by Nikolic et al. It is designed as a byte oriented stream cipher based hash function. For LUX-256, Schmidt-Nielsen gave a distinguisher and later Wu et al. presented collision attacks, both of which for reduced rounds of LUX. As a result of these attacks, LUX is eliminated in the first round. In this work, we first give a procedure for the second preimage attack. Then we extend this to the collision and second preimage attacks for the reduced rounds of LUX hash family. Moreover, we implement the attacks and give the specific examples by taking the padding into consideration.
Citation Count: 2
Statistical Randomness Tests of Long Sequences by Dynamic Partitioning
(Institute of Electrical and Electronics Engineers Inc., 2020) Akcengiz,Z.; Aslan,M.; Karabayir,O.; Doganaksoy,A.; Uguz,M.; Sulak,F.; Mathematics
Random 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 fixed 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. © 2020 IEEE.
Citation Count: 0
Statistical Randomness Tests of Long Sequences by Dynamic Partitioning
(Ieee, 2020) Akcengiz, Ziya; Asian, Melis; Karabayir, Ozgur; Doganaksoy, Ali; Uguz, Muhiddin; Sulak, Fatih; Mathematics
Random 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.