Pages that link to "Item:Q744085"
From MaRDI portal
The following pages link to On linear-size pseudorandom generators and hardcore functions (Q744085):
Displaying 7 items.
- The complexity of constructing pseudorandom generators from hard functions (Q1766819) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- (Q2762792) (← links)
- A Remark on One-Wayness versus Pseudorandomness (Q2914351) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)