Optimal Covering Codes for Finding Near-Collisions

DOI10.1007/978-3-642-19574-7_13zbMath1293.94084OpenAlexW1582372186MaRDI QIDQ3084254

Vincent Rijmen, Mario Lamberger

Publication date: 15 March 2011

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

covering codeshash functionsdigital expansionsmemoryless near-collisionsdirect sum construction

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Time-Memory Trade-Offs for Near-Collisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Memoryless near-collisions via coding theory
• Cryptanalysis of MD4
• Parallel collision search with cryptanalytic applications
• Cycle detection using a stack
• On Free-Start Collisions and Collisions for TIB3
• On the covering radius of codes
• Improved sphere bounds on the covering radius of codes
• An improved Monte Carlo factorization algorithm
• An improvement of the Van Wee bound for binary linear covering codes
• Optimal Hash Functions for Approximate Matches on the $n$-Cube
• Advances in Cryptology – CRYPTO 2004
• How to Break MD5 and Other Hash Functions
• Finding Collisions in the Full SHA-1
• Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
• Finding SHA-1 Characteristics: General Results and Applications
• Cryptography and Coding

This page was built for publication: Optimal Covering Codes for Finding Near-Collisions