Randomness Tests: Theory and Practice

DOI10.1007/978-3-030-48006-6_18OpenAlexW3026081313MaRDI QIDQ5049055

Alexander Shen

Publication date: 9 November 2022

Published in: Fields of Logic and Computation III (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48006-6_18

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Uses Software

• dieharder
• Diehard
• NIST Statistical Test Suite
• tuftests

Cites Work

• Unnamed Item
• Unnamed Item
• Impugning randomness, convincingly
• Insuring against loss of evidence in game-theoretic probability
• Generating quasi-random sequences from semi-random sources
• A universal statistical test for random bit generators
• Monkey tests for random number generators
• Randomness deficiencies
• Algorithmic tests and randomness with respect to a class of measures
• Around Kolmogorov Complexity: Basic Notions and Results
• Algorithmic Statistics Revisited
• Algorithmic Statistics: Forty Years Later
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Pseudorandom Generator from any One-way Function
• Kolmogorov Complexity and Algorithmic Randomness
• The ASA Statement on p-Values: Context, Process, and Purpose