No time to hash: on super-efficient entropy accumulation

DOI10.1007/978-3-030-84259-8_19MaRDI QIDQ2139648zbMATH OpenOpenAlexFDO

Authors Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, Zhiye Xie

Publication date 18 May 2022

Full work available at URL https://doi.org/10.1007/978-3-030-84259-8_19

zbMATH Keywords

randomness extractorsRNGsentropy accumulation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• How to eat your entropy and have it too -- optimal recovery strategies for compromised RNGs
• Random number generators. Principles and practices. A guide for engineers and programmers
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• The entropy of a distributed computation random number generation from memory interleaving
• Seedless fruit is the sweetest: random number generation, revisited

Cites work

• scientific article; zbMATH DE number 1440878 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A robust and sponge-like PRNG with improved efficiency
• Bit Reversal on Uniprocessors
• Deterministic extractors for small-space sources
• Explicit two-source extractors and resilient functions
• Extracting Randomness Using Few Independent Sources
• Extracting Randomness via Repeated Condensing
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• On recycling the randomness of states in space bounded computation
• Practical cryptography
• Provably robust sponge-based PRNGs and KDFs
• Randomness is linear in space
• Seedless fruit is the sweetest: random number generation, revisited
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

Cited in

(5)

• The entropy of a distributed computation random number generation from memory interleaving
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• Almost Chor-Goldreich sources and adversarial random walks
• How to eat your entropy and have it too -- optimal recovery strategies for compromised RNGs
• scientific article; zbMATH DE number 6351507 (Why is no real title available?)

This page was built for publication: No time to hash: on super-efficient entropy accumulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139648)