A universal statistical test for random bit generators

DOI10.1007/BF00193563zbMath0790.94014WikidataQ92950961 ScholiaQ92950961MaRDI QIDQ1196895

Ueli M. Maurer

Publication date: 16 January 1993

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

entropycryptographic applicationergodic stationary sourceexhaustive key searchstatistical test for random bit generators

Mathematics Subject Classification ID

Cryptography (94A60) Applications of statistics (62P99)

Related Items (max. 100)

A new test for randomness and its application to some cryptographic problems ⋮ Randomness Tests: Theory and Practice ⋮ Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint ⋮ Энтропия как характеристика качества случайных последовательностей ⋮ New statistical randomness tests based on length of runs ⋮ Exploring confusion in product ciphers through regression analysis ⋮ Semiconductor Emitters in Entropy Sources for Quantum Random Number Generation ⋮ Convergence of recurrence of blocks for mixing processes ⋮ Associative steganography. Durability of associative protection of information ⋮ On some connections between statistics and cryptology ⋮ Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure ⋮ An Efficiency Optimization Scheme for the On-the-Fly Statistical Randomness Test ⋮ New statistical randomness tests: 4-bit template matching tests ⋮ Periodic template tests: a family of statistical randomness tests for a collection of binary sequences ⋮ Using information theory approach to randomness testing ⋮ Uniform random number generation ⋮ Testing the NIST Statistical Test Suite on artificial pseudorandom sequences ⋮ Shrinking generators and statistical leakage ⋮ A Central Limit Theorem for Non-Overlapping Return Times ⋮ Randomness measures related to subset occurrence ⋮ Randomness of Möbius coefficients and Brownian motion: growth of the Mertens function and the Riemann hypothesis ⋮ p-adic Chaos and Random Number Generation ⋮ The first return time test of pseudorandom numbers

Cites Work

• A Mathematical Theory of Communication
• Interval and recency rank source coding: Two on-line adaptive variable-length schemes
• Universal data compression and repetition times
• Entropy-Based Tests of Uniformity
• A universal algorithm for sequential data compression
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A universal statistical test for random bit generators