Using random error correcting codes in near-collision attacks on generic hash-functions

DOI10.1007/978-3-319-13039-2_13MaRDI QIDQ2945385zbMATH OpenOpenAlexFDO

Authors Inna Polak, Adi Shamir

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)

Recommendations

• Memoryless near-collisions via coding theory
• Memoryless near-collisions, revisited
• Optimal covering codes for finding near-collisions
• Time-memory trade-offs for near-collisions
• scientific article; zbMATH DE number 1182507

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1302838 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• An improved Monte Carlo factorization algorithm
• Cryptography and Coding
• Cycle detection using a stack
• How to Break MD5 and Other Hash Functions
• Memoryless near-collisions via coding theory
• Memoryless near-collisions, revisited
• On Free-Start Collisions and Collisions for TIB3
• Optimal Hash Functions for Approximate Matches on the $n$-Cube
• Optimal covering codes for finding near-collisions
• Parallel collision search with cryptanalytic applications
• Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
• The Complexity of Finding Cycles in Periodic Functions
• Time-memory trade-offs for near-collisions
• Using random error correcting codes in near-collision attacks on generic hash-functions

Cited in

(9)

• Cryptography and Coding
• Optimal covering codes for finding near-collisions
• Time-memory trade-offs for near-collisions
• Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
• Construction of secure and fast hash functions using nonbinary error-correcting codes
• Using random error correcting codes in near-collision attacks on generic hash-functions
• Memoryless near-collisions, revisited
• Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
• Memoryless near-collisions via coding theory

This page was built for publication: Using random error correcting codes in near-collision attacks on generic hash-functions

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