Pages that link to "Item:Q2119086"
From MaRDI portal
The following pages link to Super-linear time-memory trade-offs for symmetric encryption (Q2119086):
Displaying 5 items.
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Hiding in plain sight: memory-tight proofs via randomness programming (Q2170068) (← links)
- Tight time-memory trade-offs for symmetric encryption (Q2292656) (← links)
- (Q4409123) (← links)
- Memory-tight multi-challenge security of public-key encryption (Q6135444) (← links)