Improved Generic Algorithms for 3-Collisions

DOI10.1007/978-3-642-10366-7_21MaRDI QIDQ3650702zbMATH OpenOpenAlexFDO

Authors 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

cryptanalysismemory-efficientmulticollisionparallel implementationrandom map

Mathematics Subject Classification ID

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

Recommendations

• Improved algorithms for linear complementarity problem arising from collision response
• A class of algorithms for collision resolution with multiplicity estimation
• Generalization of the ball-collision algorithm
• Optimal Randomized Comparison Based Algorithms for Collision
• Three-Dimensional Rigid-Body Collisions With Multiple Contact Points
• scientific article; zbMATH DE number 2088189
• Faster Multicollisions
• Fast algorithms for collision and proximity problems involving moving geometric objects
• A multiple-heaps algorithm for parallel simulation of collision systems

Cited in

(10)

• Parallel collision search with cryptanalytic applications
• 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
• Time-memory trade-offs for near-collisions
• A new algorithm for the unbalanced meet-in-the-middle problem
• New second-preimage attacks on hash functions
• Optimal Randomized Comparison Based Algorithms for Collision
• Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256
• Quantum time-space tradeoff for finding multiple collision pairs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650702)