Memoryless near-collisions via coding theory
From MaRDI portal
Publication:663464
DOI10.1007/s10623-011-9484-2zbMath1303.94088WikidataQ22036712 ScholiaQ22036712MaRDI QIDQ663464
Koen Simoens, Vincent Rijmen, Mario Lamberger, Florian Mendel
Publication date: 15 February 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9484-2
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Solving LPN using covering codes, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel collision search with cryptanalytic applications
- Cycle detection using a stack
- On Free-Start Collisions and Collisions for TIB3
- Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- On the covering radius of codes
- Improved sphere bounds on the covering radius of codes
- An improved Monte Carlo factorization algorithm
- Monte Carlo Methods for Index Computation (mod p)
- An improvement of the Van Wee bound for binary linear covering codes
- Random codes: minimum distances and error exponents
- Optimal Hash Functions for Approximate Matches on the $n$-Cube
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- How to Break MD5 and Other Hash Functions
- Finding Collisions in the Full SHA-1
- Probability Distributions Related to Random Mappings
