Improved Generic Algorithms for 3-Collisions

DOI10.1007/978-3-642-10366-7_21zbMath1267.94070OpenAlexW1879093391MaRDI QIDQ3650702

Antoine Joux, Stefan Lucks

Publication date: 15 December 2009

Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_21

zbMATH Keywords

parallel implementationcryptanalysisrandom mapmulticollisionmemory-efficient

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

New second-preimage attacks on hash functions ⋮ A New Algorithm for the Unbalanced Meet-in-the-Middle Problem ⋮ Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256 ⋮ Quantum algorithm for the multicollision problem ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ Memory-Efficient Algorithms for Finding Needles in Haystacks

This page was built for publication: Improved Generic Algorithms for 3-Collisions