Simple extractors via constructions of cryptographic pseudo-random generators
From MaRDI portal
Publication:2268098
DOI10.1016/j.tcs.2009.10.020zbMath1187.68216OpenAlexW2569753621MaRDI QIDQ2268098
Publication date: 10 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.020
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness vs randomness
- Optimal randomizer efficiency in the bounded-storage model
- Encryption against storage-bounded adversaries from on-line strong extractors
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Extractors from Reed-Muller codes
- Construction of extractors using pseudo-random generators (extended abstract)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Simple extractors for all min-entropies and a new pseudorandom generator
- A Pseudorandom Generator from any One-way Function
- On the distribution of the number of roots of polynomials and explicit weak designs
- Combinatorial bounds for list decoding
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Extractor codes
- Extractors and pseudorandom generators
- Some Applications of Coding Theory in Computational Complexity
- Extracting all the randomness and reducing the error in Trevisan's extractors
This page was built for publication: Simple extractors via constructions of cryptographic pseudo-random generators
