Breaking a new hash function design strategy called SMASH

Authors:
Norbert Pramstaller;Christian Rechberger;Vincent Rijmen
Affiliations:
Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Austria;Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Austria;Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Austria
Venue:
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Year:
2005

Citing 9
Cited 5

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Differential Collisions in SHA-0

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Construction of a Cioher From a Single Pseudorandom Permutation

ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Cryptanalysis of MD4

Proceedings of the Third International Workshop on Fast Software Encryption
Serpent: A New Block Cipher Proposal

FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
SMASH – a cryptographic hash function

FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Update on SHA-1

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Exploiting coding theory for collision attacks on SHA-1

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding

The Hash Function Family LAKE

Fast Software Encryption
Twister --- A Framework for Secure and Fast Hash Functions

ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
TWISTERπ – a framework for secure and fast hash functions

International Journal of Applied Cryptography
Cryptanalysis of t-function-based hash functions

ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Second preimages for SMASH

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a collision attack on SMASH. SMASH was proposed as a new hash function design strategy that does not rely on the structure of the MD4 family. The presented attack method allows us to produce almost any desired difference in the chaining variables of the iterated hash function. Due to the absence of a secret key, we are able to construct differences with probability 1. Furthermore, we get only few constraints on the colliding messages, which allows us to construct meaningful collisions. The presented collision attack uses negligible resources and we conjecture that it works for all hash functions built following the design strategy of SMASH.