Optimal covering codes for finding near-collisions

DOI10.1007/978-3-642-19574-7_13MaRDI QIDQ3084254zbMATH OpenOpenAlexFDO

Authors Mario Lamberger, Vincent Rijmen

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 codesdigital expansionsdirect sum constructionhash functionsmemoryless near-collisions

Mathematics Subject Classification ID

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

Recommendations

• Memoryless near-collisions via coding theory
• Memoryless near-collisions, revisited
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Time-memory trade-offs for near-collisions
• Cryptography and Coding

Cites work

• Advances in Cryptology – CRYPTO 2004
• An improved Monte Carlo factorization algorithm
• An improvement of the Van Wee bound for binary linear covering codes
• Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
• Cryptanalysis of MD4
• Cryptography and Coding
• Cycle detection using a stack
• Finding Collisions in the Full SHA-1
• Finding SHA-1 Characteristics: General Results and Applications
• How to Break MD5 and Other Hash Functions
• scientific article; zbMATH DE number 1302838 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Improved sphere bounds on the covering radius of codes
• Memoryless near-collisions via coding theory
• On Free-Start Collisions and Collisions for TIB3
• On the covering radius of codes
• Optimal Hash Functions for Approximate Matches on the $n$-Cube
• Parallel collision search with cryptanalytic applications

Cited in

(4)

• Memoryless near-collisions, revisited
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Time-memory trade-offs for near-collisions
• Memoryless near-collisions via coding theory

This page was built for publication: Optimal covering codes for finding near-collisions

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