On asymptotically optimal tests for random number generators
Information Theory
2019-12-16 v1 Cryptography and Security
math.IT
Statistics Theory
Statistics Theory
Abstract
The problem of constructing effective statistical tests for random number generators (RNG) is considered. Currently, statistical tests for RNGs are a mandatory part of cryptographic information protection systems, but their effectiveness is mainly estimated based on experiments with various RNGs. We find an asymptotic estimate for the p-value of an optimal test in the case where the alternative hypothesis is a known stationary ergodic source, and then describe a family of tests each of which has the same asymptotic estimate of the p-value for any (unknown) stationary ergodic source.
Cite
@article{arxiv.1912.06542,
title = {On asymptotically optimal tests for random number generators},
author = {Boris Ryabko},
journal= {arXiv preprint arXiv:1912.06542},
year = {2019}
}