Abstract
We address the problem of detecting deviations of a binary sequence from randomness, which is very important for ra ndom number (RNA) and pseudorandom number generators (PRNG) and their applications to cryptography. Namely, we consider a hypothesis H 0 that a given bit sequence is generated by the Bernoulli source with equal probabilities of 0’s and 1’s and the alternative hypothesis H 1 that the sequence is generated by a stationary and ergodic source which differs from the source under H 0. We show that data compression methods can be used as a basis for such testing and describe two new tests for randomness, which are based on ideas of universal coding. Known statistical tests and suggested ones are applied for testing PRNGs which are used in practice. The experiments show that the power of the new tests is greater than of many known algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Maurer U (1992) J Cryptol 5 (2):89–105
Rukhin A et al. (2001) A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication 800–22 http://csrc.nist.gov/rng/SP800-22b.pdf
Kendall MG, Stuart A (1961) The advanced theory of statistics. Vol. 2: Inference and relationship. London
Aho AV, Hopcroft JE, Ulman JD (1976) The desighn and analysis of computer algorithms. Addison-Wesley, Reading MA
Ryabko Bya (1980) Prob Inf Transm 16(4):16–21
Bently JL, Sleator DD, Tarjan RE, Wei VK (1986) Commun ACM 29:320–330
Ryabko BYa, Stognienko VS, Shokin YuI (2004) J Stat Plan Infer 123(2):365–376
Dudewicz EJ, Ralley TG (1981) The handbook of random number generation and testing with TESTRAND computer code. In: American Series in Mathematical and Management Sciences, Vol. 4. American Sciences Press, Columbus Ohio
Ryabko B, Rissanen J (2003) IEEE Commun Lett 7(1):33–35
Moeschlin O, Grycko E, Pohl C, Steinert F (1998) Experimental stochastics. Springer, Berlin Heidelberg
Matsumoto M, Nishimura T (1998) ACM Trans Model Comp Simul 8:3–30
Shneier B (1996) Applied Cryptography. Wiley, New York
Rogaway P, Coppersmith D (1998) A software-optimized encryption algorithm. In: Anderson R (ed) Fast software encryption. Lecture Notes in Computer Science 809. Springer Verlag
The Marsaglia Random Number CDROM http://stat.fsu.edu/diehard/cdrom/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Ryabko, B., Fionov, A., Monarev, V., Shokin, Y. (2006). Using information theory approach to randomness testing. In: Krause, E., Shokin, Y., Resch, M., Shokina, N. (eds) Computational Science and High Performance Computing II. Notes on Numerical Fluid Mechanics and Multidisciplinary Design, vol 91. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31768-6_22
Download citation
DOI: https://doi.org/10.1007/3-540-31768-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31767-8
Online ISBN: 978-3-540-31768-5
eBook Packages: EngineeringEngineering (R0)