Pseudorandom generators from regular one-way functions: new constructions with improved parameters
From MaRDI portal
Publication:2513673
DOI10.1016/j.tcs.2014.12.013zbMath1338.94088OpenAlexW2189790193MaRDI QIDQ2513673
Jian Weng, Yu Yu, Xiang-Xue Li
Publication date: 28 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.013
Related Items (2)
Paradigms for Unconditional Pseudorandom Generators ⋮ Simple constructions from (almost) regular one-way functions
Cites Work
- Unnamed Item
- One way functions and pseudorandom generators
- Pseudorandom generators for space-bounded computation
- Universal classes of hash functions
- Randomness is linear in space
- A Uniform Min-Max Theorem with Applications in Cryptography
- Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- Three XOR-Lemmas — An Exposition
- On the Power of the Randomized Iterate
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Extracting Randomness from Multiple Independent Sources
- A Pseudorandom Generator from any One-way Function
- On the Existence of Pseudorandom Generators
- Foundations of Cryptography
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Saving Private Randomness in One-Way Functions and Pseudorandom Generators
- On the Power of the Randomized Iterate
- Theory of Cryptography
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Pseudorandom generators from regular one-way functions: new constructions with improved parameters
