How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs

DOI10.1007/s00453-016-0239-3zbMath1405.94032OpenAlexW2552220234MaRDI QIDQ1688404

Daniel Wichs, Noah Stephens-Davidowitz, Yevgeniy Dodis, Adi Shamir

Publication date: 5 January 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0239-3

zbMATH Keywords

entropyrandom number generatorRNGstate compromise

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10) Measures of information, entropy (94A17)

Related Items (2)

No time to hash: on super-efficient entropy accumulation ⋮ On Random Number Generation for Kernel Applications

Cites Work

• The insecurity of the digital signature algorithm with partially known nonces
• Public Keys
• A complete problem for statistical zero knowledge
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Cryptanalytic Attacks on Pseudorandom Number Generators
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs