Randomness Testing: Result Interpretation and Speed
Authors: 
Marek Sýs, Vashek MatyášAuthors Info & Claims
Pages 389 - 395
Abstract
In cryptography, randomness is typically tested using a battery of tests consisting of many tests of randomness --- each focusing on a different feature. Probability that data produced by a good generator would pass all the tests in a battery can get quite small for a large number of used tests. Therefore, results of many tests should be interpreted with a particular focus on this issue. We argue for the Šidák correction --- this is a statistical method that can be used for evaluating multiple but independent tests. We analyzed the accuracy of the Šidák correction since tests of randomness are usually correlated, and we undertook this analysis for the NIST Statistical Test Suite. Results show that correlation of tests of randomness has got only a marginal influence on the accuracy of the Šidák correction. We also provide a speed-optimized version of NIST STS that achieved test results more than 30-times faster than the original NIST codes.
References
[1]
Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A statistical test suite for the validation of random number generators and pseudo random number generators for cryptographic applications, Version STS-2.1. In: NIST Special Publication 800---22rev1a. http://csrc.nist.gov/publications/nistpubs/800-22-rev1a/SP800-22rev1a.pdf
[2]
Brown, R.G.: Dieharder: A random number test suite, Version 3.31.1 2004
[3]
L'Ecuyer, P., Simard, R.: TestU01: A C library for empirical testing of random number generators. ACM Trans. Math. Softw. 334, Article 22 2007
[4]
Doganaksoy, A., Ege, B., Mus, K.: Extended results for independence and sensitivity of NIST randomness tests. In: 3rd Information Security and Cryptography Conference, Turkey 2008
[5]
Nano-Optics groups at the Department of Physics of Humboldt University and PicoQuant GmbH: QRNG Service. https://qrng.physik.hu-berlin.de
[6]
Sýs, M., íha, Z.: Faster randomness testing with the nist statistical test suite. In: Chakraborty, R.S., Matyas, V., Schaumont, P. eds. SPACE 2014. LNCS, vol. 8804, pp. 272---284. Springer, Heidelberg 2014
[7]
Sýs, M., íha, Z.: Optimised implementation of NIST STS 2014. https://github.com/sysox/NIST-STS-optimised
Recommendations
Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm
The NIST Statistical Test Suite (NIST STS) is one of the most popular tools for the analysis of randomness. This test battery is widely used, but its implementation is quite inefficient. A complete randomness analysis using the NIST STS can take hours ...
Randomness for Randomness Testing
Cyber Security, Cryptology, and Machine LearningAbstractGiven a binary sequence, one may inquire whether it is produced by a true random source. There are several tests designed to answer this question, such as the statistical test suite of the National Institute of Standard and Technology (NIST) and ...
Constructing Empirical Tests of Randomness
ICETE 2014: Proceedings of the 11th International Joint Conference on e-Business and Telecommunications - Volume 4In this paper we introduce a general framework for automatic construction of empirical tests of randomness. Our new framework generalises and improves a previous approach (Å venda et al., 2013) and it also provides a clear statistical interpretation of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
November 2015
523 pages
ISBN:9783662493007
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 November 2015
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Feb 2025