Time-space tradeoffs and short collisions in Merkle-Damgård hash functions

DOI10.1007/978-3-030-56784-2_6zbMath1503.94021OpenAlexW3037871682MaRDI QIDQ2096481

Akshima, Hoeteck Wee, David Cash, Andrew Drucker

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_6

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Single-server private information retrieval with sublinear amortized time ⋮ Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ The query-complexity of preprocessing attacks ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård hash functions ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions ⋮ Unifying presampling via concentration bounds

Cites Work

• Unnamed Item
• Random oracles and non-uniformity
• The Discrete Logarithm problem with preprocessing
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• Constructive Proofs of Concentration Bounds
• Random Oracles and Auxiliary Input
• A cryptanalytic time-memory trade-off
• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
• Bounds on the Efficiency of Generic Cryptographic Constructions

This page was built for publication: Time-space tradeoffs and short collisions in Merkle-Damgård hash functions