Computer Science – Information Theory
Scientific paper
2005-04-03
Computer Science
Information Theory
Journal of Statistical Planning and Inference,2005, (accepted)
Scientific paper
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. Those experiments show that the power of the new tests is greater than of many known algorithms.
Monarev V. A.
Ryabko Boris Y.
No associations
LandOfFree
Using Information Theory Approach to Randomness Testing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Using Information Theory Approach to Randomness Testing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Information Theory Approach to Randomness Testing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-302020