Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256

Authors:
Marko Hölbl;Christian Rechberger;Tatjana Welzer
Affiliations:
Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia;Institute of Applied Information Processing and Communications (IAIK), Graz University of Technology, Graz, Austria;Faculty of Electrical Engineering and Computer Science, University of Maribor, Maribor, Slovenia
Venue:
Research in Cryptology
Year:
2008

Citing 7
Cited 0

Differential Collisions in SHA-0

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Analysis of step-reduced SHA-256

FSE'06 Proceedings of the 13th 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
How to break MD5 and other hash functions

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Collisions of SHA-0 and reduced SHA-1

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Analysis of a SHA-256 variant

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography

Quantified Score

Hi-index	0.01

Visualization

Abstract

Recent progress in hash functions analysis has led to collisions on reduced versions of SHA-256. As in other hash functions, differential collision search methods of SHA-256 can be described by means of conditions on and between state and message bits. We describe a tool for efficient automatic searching of message pairs conforming to useful sets of conditions, i. e.stemming from (interleaved) local collisions. We not only considerably improve upon previous work [7], but also show the extendability of our approach to larger sets of conditions.Furthermore, we present the performance results of an actual implementation and pose an open problem in this context.