Asymptotically most powerful tests for random number generators

Research output: Contribution to journalArticlepeer-review

Abstract

The problem of constructing the most powerful test for random number generators (RNGs) is considered, where the generators are modelled by stationary ergodic processes. At present, RNGs are widely used in data protection, modelling and simulation systems, computer games, and in many other areas where the generated random numbers should look like binary numbers of a Bernoulli equiprobable sequence. Another problem considered is that of constructing effective statistical tests for random number generators (RNG). Currently, effectiveness of statistical tests for RNGs 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. This model appears to be acceptable for binary sequences generated by physical devices that are used in cryptographic data protection systems.

Original languageEnglish
Pages (from-to)1-7
Number of pages7
JournalJournal of Statistical Planning and Inference
Volume217
DOIs
Publication statusPublished - Mar 2022

Keywords

  • p-value
  • Random number generators
  • Randomness testing
  • Shannon entropy
  • Statistical test

OECD FOS+WOS

  • 1.01.XY STATISTICS & PROBABILITY

Fingerprint

Dive into the research topics of 'Asymptotically most powerful tests for random number generators'. Together they form a unique fingerprint.

Cite this