Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
From MaRDI portal
Publication:3644215
DOI10.1007/978-3-642-04159-4_24zbMath1256.94066OpenAlexW1493093608MaRDI QIDQ3644215
Publication date: 3 November 2009
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04159-4_24
Uses Software
Cites Work
- Generating quasi-random sequences from semi-random sources
- Iterating von Neumann's procedure for extracting random bits
- Extracting randomness: A survey and new constructions
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
- Lossless condensers, unbalanced expanders, and extractors
- Extractors from Reed-Muller codes
- Bad and Good Ways of Post-processing Biased Physical Random Numbers
- Post-Processing Functions for a Biased Physical Random Number Generator
- Simple extractors for all min-entropies and a new pseudorandom generator
- Extractors with weak random seeds
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- How to turn loaded dice into fair coins
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Extracting Randomness Using Few Independent Sources
- Simulating independence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators