Time-memory trade-offs for near-collisions

DOI10.1007/978-3-662-43933-3_11zbMATH Open1321.94074OpenAlexW1410933093MaRDI QIDQ2946879FDOQ2946879

Authors: 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

Recommendations

• Memoryless near-collisions, revisited
• Memoryless near-collisions via coding theory
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Optimal covering codes for finding near-collisions
• Improved Generic Algorithms for 3-Collisions

zbMATH Keywords

hash functionnear-collisiongeneric attacktime-memory trade-off

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Optimal covering codes for finding near-collisions
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• Memoryless near-collisions, revisited
• Memoryless near-collisions via coding theory

This page was built for publication: Time-memory trade-offs for near-collisions

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