Time-space lower bounds for finding collisions in Merkle-Damgård hash functions

DOI10.1007/978-3-031-15982-4_7OpenAlexW4313125963MaRDI QIDQ6163947

Qipeng Liu, Akshima, Siyao Guo

Publication date: 30 June 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15982-4_7

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (5)

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

Cites Work

• 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 and short collisions in Merkle-Damgård hash functions
• Lower bounds on the time/memory tradeoff of function inversion
• The function-inversion problem: barriers and opportunities
• Unifying presampling via concentration bounds
• 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
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
• Unnamed Item

This page was built for publication: Time-space lower bounds for finding collisions in Merkle-Damgård hash functions