Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
From MaRDI portal
Publication:3591440
DOI10.1007/11787006_20zbMath1133.94319OpenAlexW1525673003MaRDI QIDQ3591440
Iftach Haitner, Omer Reingold, Danny Harnik
Publication date: 11 September 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11787006_20
Related Items (8)
A New Pseudorandom Generator from Collision-Resistant Hash Functions ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ The hunting of the SNARK ⋮ Simple constructions from (almost) regular one-way functions ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ On the complexity of constructing pseudorandom functions (especially when they don't exist) ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ Unnamed Item
This page was built for publication: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions