Pseudorandom generators from regular one-way functions: new constructions with improved parameters
From MaRDI portal
Recommendations
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters
- The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions
- Simple constructions from (almost) regular one-way functions
- Theory of Cryptography
- On the Power of the Randomized Iterate
Cited in
(13)- Pseudorandom generators from regular one-way functions: new constructions with improved parameters
- Simple constructions from (almost) regular one-way functions
- A new pseudorandom generator from collision-resistant hash functions
- On the Complexity of Breaking Pseudoentropy
- (Almost) optimal constructions of UOWHFs from 1-to-1, regular one-way functions and beyond
- 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
- 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 Q2867157)