Pages that link to "Item:Q3591440"
From MaRDI portal
The following pages link to Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (Q3591440):
Displaying 14 items.
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters (Q2513673) (← links)
- On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523) (← links)
- Simple constructions from (almost) regular one-way functions (Q2697872) (← links)
- (Q2762792) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2875171) (← links)
- A New Pseudorandom Generator from Collision-Resistant Hash Functions (Q2890004) (← links)
- A tight lower bound for entropy flattening (Q5121911) (← links)
- Pseudorandom generators with long stretch and low locality from random local one-way functions (Q5415517) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Theory of Cryptography (Q5898368) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Simple constructions from (almost) regular one-way functions (Q6570527) (← links)