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

DOI10.1007/978-3-319-13039-2_13zbMath1337.94063OpenAlexW2183676494MaRDI QIDQ2945385

Adi Shamir, Inna Polak

Publication date: 10 September 2015

Published in: Progress in Cryptology -- INDOCRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13039-2_13

zbMATH Keywords

hash functionnear-collisiongeneric attacktime-memory trade-offrandom-code

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Memoryless near-collisions via coding theory
• Parallel collision search with cryptanalytic applications
• Memoryless near-collisions, revisited
• Cycle detection using a stack
• Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions
• Time-Memory Trade-Offs for Near-Collisions
• Optimal Covering Codes for Finding Near-Collisions
• Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
• On Free-Start Collisions and Collisions for TIB3
• An improved Monte Carlo factorization algorithm
• The Complexity of Finding Cycles in Periodic Functions
• Optimal Hash Functions for Approximate Matches on the $n$-Cube
• Advances in Cryptology – CRYPTO 2004
• How to Break MD5 and Other Hash Functions
• Cryptography and Coding

This page was built for publication: Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions