Paper 2019/1426 Original: eprint.iacr.org/2019/1426 ↗
On asymptotically optimal tests for random number generators
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2019-12-10: last updated
- 2019-12-10: published
- Short URL
- https://ia.cr/2019/1426
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/1426,
author = {Boris Ryabko},
title = {On asymptotically optimal tests for random number generators},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/1426},
year = {2019},
url = {https://eprint.iacr.org/2019/1426}
}