Pages that link to "Item:Q2828220"
From MaRDI portal
The following pages link to On the One-Way Function Candidate Proposed by Goldreich (Q2828220):
Displayed 9 items.
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms (Q1678752) (← links)
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator (Q6095188) (← links)
- Oblivious transfer with constant computational overhead (Q6138086) (← links)