Time-Memory Trade-Offs for Near-Collisions

DOI10.1007/978-3-662-43933-3_11zbMath1321.94074OpenAlexW1410933093MaRDI QIDQ2946879

Gaëtan Leurent

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_11

zbMATH Keywords

hash functionnear-collisiongeneric attacktime-memory trade-off

Mathematics Subject Classification ID

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

Related Items (1)

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions

Cites Work

• Unnamed Item
• Fast software encryption. 18th international workshop, FSE 2011, Lyngby, Denmark, February 13--16, 2011. Revised selected papers
• Memoryless near-collisions via coding theory
• Parallel collision search with cryptanalytic applications
• Memoryless near-collisions, revisited
• Cycle detection using a stack
• Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
• Practical Near-Collisions on the Compression Function of BMW
• Near-Collisions on the Reduced-Round Compression Functions of Skein and BLAKE
• Optimal Covering Codes for Finding Near-Collisions
• Collisions and Near-Collisions for Reduced-Round Tiger
• An improved Monte Carlo factorization algorithm
• The Complexity of Finding Cycles in Periodic Functions
• A monte carlo method for factorization
• Monte Carlo Methods for Index Computation (mod p)
• Advances in Cryptology – CRYPTO 2004

This page was built for publication: Time-Memory Trade-Offs for Near-Collisions