Pseudorandom generators from regular one-way functions: new constructions with improved parameters

DOI10.1016/J.TCS.2014.12.013MaRDI QIDQ2513673zbMATH OpenOpenAlexFDO

Authors Yu Yu, Jian Weng, Xiangxue 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

zbMATH Keywords

foundationsone-way functionspseudorandom generatorsrandomized iterate

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Theory of Cryptography
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• One way functions and pseudorandom generators
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
• A Pseudorandom Generator from any One-way Function
• scientific article; zbMATH DE number 177608
• Pseudorandom generators with long stretch and low locality from random local one-way functions

Cites work

• A Pseudorandom Generator from any One-way Function
• A uniform min-max theorem with applications in cryptography
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Computational analogues of entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• Extracting Randomness from Multiple Independent Sources
• Foundations of Cryptography
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 1874366 (Why is no real title available?)
• On the Existence of Pseudorandom Generators
• On the Power of the Randomized Iterate
• On the Power of the Randomized Iterate
• One way functions and pseudorandom generators
• Pseudorandom generators for space-bounded computation
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Randomness is linear in space
• Saving Private Randomness in One-Way Functions and Pseudorandom Generators
• Theory of Cryptography
• Three XOR-lemmas -- an exposition
• Universal classes of hash functions

Cited in

(12)

• Simple constructions from (almost) regular one-way functions
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• A new pseudorandom generator from collision-resistant hash functions
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
• Enhanced Boolean functions suitable for the filter model of pseudo-random generator
• The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions
• Pseudorandom generators with long stretch and low locality from random local one-way functions
• Saving Private Randomness in One-Way Functions and Pseudorandom Generators
• On the Power of the Randomized Iterate
• Theory of Cryptography
• Paradigms for Unconditional Pseudorandom Generators
• Simple constructions from (almost) regular one-way functions

This page was built for publication: Pseudorandom generators from regular one-way functions: new constructions with improved parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513673)