How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
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
An Accurate Evaluation of Maurer's Universal Test
SAC '98 Proceedings of the Selected Areas in Cryptography
FC '00 Proceedings of the 4th International Conference on Financial 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
Implementation and testing of high-speed CMOS true random number generators based on chaotic systems
IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special section on 2009 IEEE system-on-chip conference
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 |
Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of a statistical test is to detect specific weaknesses in random sources. Maurer's universal test is a very common randomness test, capable of detecting a wide range of statistical defects. The test is based on the computation of a function which is asymptotically related to the source's entropy, which measures the effective key-size of block ciphers keyed by the source's output. In this work we develop a variant of Maurer's test where the test function is in theory exactly equal to the source's entropy, thereby enabling a better detection of defects in the tested source.