Pages that link to "Item:Q3179351"
From MaRDI portal
The following pages link to Fast Pseudorandom Functions Based on Expander Graphs (Q3179351):
Displaying 9 items.
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Fast scramblers, horizons and expander graphs (Q1795837) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Fast Time-Recursive Block Correlators for Pseudorandom Sequences (Q4956806) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
- Structural lower bounds on black-box constructions of pseudorandom functions (Q6652977) (← links)