Pages that link to "Item:Q1629393"
From MaRDI portal
The following pages link to Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393):
Displayed 7 items.
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- The memory-tightness of authenticated encryption (Q2096479) (← links)
- On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
- Hiding in plain sight: memory-tight proofs via randomness programming (Q2170068) (← links)
- Quantum key-length extension (Q2695632) (← links)
- (Q6062142) (← links)
- Memory-tight multi-challenge security of public-key encryption (Q6135444) (← links)