Pseudorandom generators belong to the primary focus of cryptology. The key to every cipher has to be generated at random, otherwise the security of the whole cipher is threatened. Another point of importance is the pseudorandom generators' close relationship to the stream ciphers. In this work, we first introduce statistical theory related to randomness testing. Then, we describe 8 classical statistical tests. We introduce a concept of next bit testing and derive variants of previous tests. Moreover, with this new battery of tests we examine the randomness of SHA-3 second round candidates and present the results. Also a sensitivity of tests is investigated and several useful transformations are shown. Powered by TCPDF (www.tcpdf.org
Pseudo-random numbers play an important role for the security of a message in a cryptographic system...
Randomness provided by pseudo-random number generators is the one of the most vital parts of cryptog...
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic ...
Randomness is crucial to enabling secure and robust communications. Ideally one should harness high ...
The article systematizes the basic scientific principles about statistical testing of random and pse...
Random values are considered as an indispensable part of cryptography, since they are necessary for ...
Block ciphers form one of the main classes of cryptographic algorithms. One of the challenges in dev...
One of the most basic properties expected from block ciphers and hash functions is passing statistic...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
Random key bit generators are used in statistically secured stream ciphers. In stream ciphers pseudo...
Security of a cryptographic application is highly related to the quality of randomness of the mechan...
This thesis is related to varies statistical test of pseudorandom number generator. In thisthesis I ...
The generation of pseudo-random numbers (bits) plays a critical role in a large number of applicatio...
Abstract: During last one and half decade an interesting relationship between chaos and cryptography...
Pseudo-random numbers play an important role for the security of a message in a cryptographic system...
Randomness provided by pseudo-random number generators is the one of the most vital parts of cryptog...
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic ...
Randomness is crucial to enabling secure and robust communications. Ideally one should harness high ...
The article systematizes the basic scientific principles about statistical testing of random and pse...
Random values are considered as an indispensable part of cryptography, since they are necessary for ...
Block ciphers form one of the main classes of cryptographic algorithms. One of the challenges in dev...
One of the most basic properties expected from block ciphers and hash functions is passing statistic...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
In the classical approach to pseudo-random number generators, a generator is considered to perform w...
Random key bit generators are used in statistically secured stream ciphers. In stream ciphers pseudo...
Security of a cryptographic application is highly related to the quality of randomness of the mechan...
This thesis is related to varies statistical test of pseudorandom number generator. In thisthesis I ...
The generation of pseudo-random numbers (bits) plays a critical role in a large number of applicatio...
Abstract: During last one and half decade an interesting relationship between chaos and cryptography...
Pseudo-random numbers play an important role for the security of a message in a cryptographic system...
Randomness provided by pseudo-random number generators is the one of the most vital parts of cryptog...
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic ...