No time to hash: on super-efficient entropy accumulation
From MaRDI portal
Publication:2139648
DOI10.1007/978-3-030-84259-8_19zbMATH Open1489.94096OpenAlexW3165716333MaRDI QIDQ2139648FDOQ2139648
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
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
- A Pseudorandom Generator from any One-way Function
- Deterministic extractors for small-space sources
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Randomness is linear in space
- On recycling the randomness of states in space bounded computation
- Title not available (Why is that?)
- Extracting Randomness Using Few Independent Sources
- Extracting Randomness via Repeated Condensing
- Bit Reversal on Uniprocessors
- How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
- Title not available (Why is that?)
- A robust and sponge-like PRNG with improved efficiency
- Provably Robust Sponge-Based PRNGs and KDFs
- Seedless fruit is the sweetest: random number generation, revisited
- Explicit two-source extractors and resilient functions
Cited In (2)
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)
