Pages that link to "Item:Q2055617"
From MaRDI portal
The following pages link to Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617):
Displayed 5 items.
- Hiding in plain sight: memory-tight proofs via randomness programming (Q2170068) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- Finding many collisions via reusable quantum walks. Application to lattice sieving (Q6083662) (← links)
- Memory-tight multi-challenge security of public-key encryption (Q6135444) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6163946) (← links)