Add to ORKGStatistical Tests are suitable means for analyzing properties of pseudorandom sequences, specifically in cryptography systems. Accordingly, various statistical tests have been proposed in literature. One of these tests is Runs Test. In this paper, we first state the common test for runs. Then by investigating the statistical behavior of runs in an Ideal Random Sequence (IRS), not only the runs test for total number of runs is improved but also two new tests are offered based on the distribution of runs of different lengths. The simulation results are also presented. Key words
Pseudorandom generators belong to the primary focus of cryptology. The key to every cipher has to be...
Randomness provided by pseudo-random number generators is the one of the most vital parts of cryptog...
Pseudo-random numbers are useful for wide-ranging ap-plications [1][2]. However, it is not easy to g...
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic ...
Random values are considered as an indispensable part of cryptography, since they are necessary for ...
The article systematizes the basic scientific principles about statistical testing of random and pse...
The application of the theory of runs to the testing of statistical data is a fairly new method of t...
This paper proposes several extensions of the concept of runs to the multi-variate setup, and studie...
This paper proposes several extensions of the concept of runs to the multivariate setup, and studies...
As one of the non-parametric tests, there is a test of randomness by means of runs, which is an appl...
Runs test is a statistical procedure which determines whether a sequence of data within a given dist...
This paper proposes several extensions of the concept of runs to the multi-variate setup, and studie...
Given a sequence of two or more types of symbols, a run is defined as a succession of--one or more--...
Block ciphers form one of the main classes of cryptographic algorithms. One of the challenges in dev...
According to Kerchoffs (1883), the security system should only rely on cryptographic keys which is u...
Pseudorandom generators belong to the primary focus of cryptology. The key to every cipher has to be...
Randomness provided by pseudo-random number generators is the one of the most vital parts of cryptog...
Pseudo-random numbers are useful for wide-ranging ap-plications [1][2]. However, it is not easy to g...
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic ...
Random values are considered as an indispensable part of cryptography, since they are necessary for ...
The article systematizes the basic scientific principles about statistical testing of random and pse...
The application of the theory of runs to the testing of statistical data is a fairly new method of t...
This paper proposes several extensions of the concept of runs to the multi-variate setup, and studie...
This paper proposes several extensions of the concept of runs to the multivariate setup, and studies...
As one of the non-parametric tests, there is a test of randomness by means of runs, which is an appl...
Runs test is a statistical procedure which determines whether a sequence of data within a given dist...
This paper proposes several extensions of the concept of runs to the multi-variate setup, and studie...
Given a sequence of two or more types of symbols, a run is defined as a succession of--one or more--...
Block ciphers form one of the main classes of cryptographic algorithms. One of the challenges in dev...
According to Kerchoffs (1883), the security system should only rely on cryptographic keys which is u...
Pseudorandom generators belong to the primary focus of cryptology. The key to every cipher has to be...
Randomness provided by pseudo-random number generators is the one of the most vital parts of cryptog...
Pseudo-random numbers are useful for wide-ranging ap-plications [1][2]. However, it is not easy to g...