No time to hash: on super-efficient entropy accumulation

DOI10.1007/978-3-030-84259-8_19zbMath1489.94096OpenAlexW3165716333MaRDI QIDQ2139648

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

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• A robust and sponge-like PRNG with improved efficiency
• Randomness is linear in space
• Seedless fruit is the sweetest: random number generation, revisited
• On recycling the randomness of states in space bounded computation
• Provably Robust Sponge-Based PRNGs and KDFs
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• A Pseudorandom Generator from any One-way Function
• Bit Reversal on Uniprocessors
• Explicit two-source extractors and resilient functions
• Extracting Randomness via Repeated Condensing
• Extracting Randomness Using Few Independent Sources
• Deterministic extractors for small-space sources

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