A universal statistical test for random bit generators
Journal of Cryptology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On the Security of Random Sources
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Efficient Online Tests for True Random Number Generators
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Evaluation Criteria for True (Physical) Random Number Generators Used in Cryptographic Applications
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
The strict avalanche criterion randomness test
Mathematics and Computers in Simulation
Random number generators in secure disk drives
EURASIP Journal on Embedded Systems
On statistical testing of random numbers generators
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
Maurer's universal test is a very common randomness test, capable of detecting a wide gamut of statistical defects. The algorithm is simple (a few Java code lines), flexible (a variety of parameter combinations can be chosen by the tester) and fast. Although the test is based on sound probabilistic grounds, one of its crucial parts uses the heuristic approximation: c(L,K) ≅ 0.7 - 0.8/L+(1.6 + 12.8/L)K-4/L In this work we compute the precise value of c(L,K) and show that the inaccuracy due to the heuristic estimate can make the test 2.67 times more permissive than what is theoretically admitted. Moreover, we establish a new asymptotic relation between the test parameter and the source's entropy.