A New Pseudorandom Generator from Collision-Resistant Hash Functions
From MaRDI portal
Publication:2890004
DOI10.1007/978-3-642-27954-6_12zbMath1292.94033OpenAlexW36058868MaRDI QIDQ2890004
Alexandra Boldyreva, Virendra Kumar
Publication date: 8 June 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27954-6_12
Related Items (2)
A New Pseudorandom Generator from Collision-Resistant Hash Functions ⋮ A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- One way functions and pseudorandom generators
- Pseudorandom generators for space-bounded computation
- Pseudorandomness for network algorithms
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- A New Pseudorandom Generator from Collision-Resistant Hash Functions
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- On the Power of the Randomized Iterate
- Theory of Cryptography
This page was built for publication: A New Pseudorandom Generator from Collision-Resistant Hash Functions
