Pages that link to "Item:Q2292656"

The following pages link to Tight time-memory trade-offs for symmetric encryption (Q2292656):

Displaying 12 items.

• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
• The Missing Difference problem, and its applications to counter mode encryption (Q1648860) (← links)
• 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)
• Super-linear time-memory trade-offs for symmetric encryption (Q2119086) (← links)
• Hiding in plain sight: memory-tight proofs via randomness programming (Q2170068) (← links)
• Resource-Restricted Indifferentiability (Q4924438) (← links)
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms (Q5041159) (← links)
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs (Q5756640) (← links)
• (Q6062142) (← links)
• Memory-tight multi-challenge security of public-key encryption (Q6135444) (← links)