Memoryless near-collisions via coding theory

Authors:
Mario Lamberger;Florian Mendel;Vincent Rijmen;Koen Simoens
Affiliations:
IAIK, Graz University of Technology, Graz, Austria;IAIK, Graz University of Technology, Graz, Austria;IAIK, Graz University of Technology ESAT/COSIC, K. U. Leuven and IBBT, Heverlee, Belgium;IAIK, Graz University of Technology ESAT/COSIC, K. U. Leuven and IBBT, Heverlee, Belgium
Venue:
Designs, Codes and Cryptography
Year:
2012

Citing 14
Cited 1

Collisions for the compression function of MD5

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Handbook of Applied Cryptography

Handbook of Applied Cryptography
A Design Principle for Hash Functions

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
How Easy is Collision Search. New Results and Applications to DES

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Cycle detection using a stack

Information Processing Letters
On Free-Start Collisions and Collisions for TIB3

ISC '09 Proceedings of the 12th International Conference on Information Security
Amplifying collision resistance: a complexity-theoretic treatment

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Optimal hash functions for approximate matches on the n-cube

IEEE Transactions on Information Theory
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Random codes: minimum distances and error exponents

IEEE Transactions on Information Theory

Memoryless near-collisions, revisited

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate generic methods to find near-collisions in cryptographic hash functions. We introduce a new generic approach based on methods to find cycles in the space of codewords of a code with low covering radius. We give an analysis of our approach and demonstrate it on the SHA-3 candidate TIB3.