Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure

DOI10.1007/978-3-319-54705-3_32zbMath1404.94114OpenAlexW2592627670MaRDI QIDQ2980880

Maciej Skórski

Publication date: 5 May 2017

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-54705-3_32

zbMATH Keywords

online entropy estimatorstestable random number generatorstrue random number generators in changing environments

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• A universal statistical test for random bit generators
• An Introduction to Randomness Extractors
• A Pseudorandom Generator from any One-way Function
• True Random Number Generators Secure in a Changing Environment
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Theory of Cryptography

This page was built for publication: Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure