Testing random number generators
WSC '92 Proceedings of the 24th conference on Winter simulation
A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Empirical evidence concerning AES
ACM Transactions on Modeling and Computer Simulation (TOMACS)
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
On lempel-ziv complexity of sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Testing Stream Ciphers by Finding the Longest Substring of a Given Density
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
| Hi-index | 0.00 |
Statistical randomness testing has significant importance in analyzing the quality of random number generators. In this study, we focus on the independence of randomness tests and its effect on the coverage of test suites. We experimentally observe that frequency, overlapping template, longest run of ones, random walk height and maximum order complexity tests are correlated for short sequences. We also proposed the concept of sensitivity, where we analyze the effect of simple transformations on output p-values. We claim that whenever the effect is significant, the composition of the transformation and the test may be included to the suite as a new test.