**Using Information Theory Approach to Randomness Testing**

*B. Ya. Ryabko and V.A. Monarev*

**Abstract: **We address the problem of detecting deviations of binary sequence
from randomness,which is very important for random number (RNG)
and pseudorandom number generators (PRNG). Namely, we consider a
null hypothesis $H_0$ that a given bit sequence is generated by
Bernoulli source with equal probabilities of 0 and 1 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
practically used. Those experiments show that the power of the new
tests is greater than of many known algorithms.

**Category / Keywords: **pseudo-randomness

**Date: **received 21 Jun 2003

**Contact author: **ryabko at adm ict nsc ru

**Available format(s): **PDF | BibTeX Citation

**Version: **20030623:201014 (All versions of this report)

**Short URL: **ia.cr/2003/127

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]