Pages that link to "Item:Q2891495"
From MaRDI portal
The following pages link to Hardness Preserving Constructions of Pseudorandom Functions (Q2891495):
Displaying 7 items.
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← links)
- A combinatorial approach to quantum random functions (Q2692397) (← links)
- Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions (Q2945374) (← links)
- Efficient Pseudorandom Functions via On-the-Fly Adaptation (Q3457117) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)