On the randomness test and its incompleteness
Gao Jinping
Abstract
Gao Jinping
Abstract
Randomness test specifications do not demonstrate the relationship between statistical tests and the nature of randomness,thus providing little guidance for practical security evaluations.The indistinguishability definition of randomness states that randomness tests ideally have to investigate all probabilistic polynomial algorithms,hence testing randomness with completeness is theoretically impossible.Pseudorandomness can be tested by verifying the probabilistic distribution of the seed and the correctness of the claimed indistinguishability proofs for short random seeds.Further,pseudorandom generators with long seeds and non-deterministic random generators require statistical tests,while the quantitative relationship between sample size and significant level in statistical tests is also proved by applying Chebyshev's multivariate inequality and statistical techniques.An example is given to demonstrate that the statistical tests in specification NIST SP800-22 may not detect the obvious non-randomness of some contrived sequences.These results show that practical testing approaches can only detect non-randomness to some degree,but cannot be used to certify randomness.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Randomness test specifications do not demonstrate the relationship between statistical tests and the nature of randomness,thus providing little guidance for practical security evaluations.The indistinguishability definition of randomness states that randomness tests ideally have to investigate all probabilistic polynomial algorithms,hence testing randomness with completeness is theoretically impossible.Pseudorandomness can be tested by verifying the probabilistic distribution of the seed and the correctness of the claimed indistinguishability proofs for short random seeds.Further,pseudorandom generators with long seeds and non-deterministic random generators require statistical tests,while the quantitative relationship between sample size and significant level in statistical tests is also proved by applying Chebyshev's multivariate inequality and statistical techniques.An example is given to demonstrate that the statistical tests in specification NIST SP800-22 may not detect the obvious non-randomness of some contrived sequences.These results show that practical testing approaches can only detect non-randomness to some degree,but cannot be used to certify randomness.
Key concepts: Randomness, Randomness tests, Pseudorandomness, Statistical hypothesis testing, Correctness, Pseudorandom number generator, Mathematics, Computer science