Exploiting coding theory for collision attacks on SHA-1

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:
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Year:
2005

Citing 10
Cited 25

A method for finding codewords of small weight

Proceedings of the 3rd International Colloquium on Coding Theory and Applications
Differential Collisions in SHA-0

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of MD4

Proceedings of the Third International Workshop on Fast Software Encryption
Finding good differential patterns for attacks on SHA-1

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
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
Cryptanalysis of the hash functions MD4 and RIPEMD

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
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
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

IEEE Transactions on Information Theory

Provably good codes for hash function design

IEEE Transactions on Information Theory
Linearization Framework for Collision Attacks: Application to CubeHash and MD6

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Distinguisher for the Compression Function of SIMD-512

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Cryptanalysis of the tiger hash function

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Collisions for 70-step SHA-1: on the full cost of collision search

SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
On authentication with HMAC and non-random properties

FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
Attacking reduced round SHA-256

ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Second-preimage analysis of reduced SHA-1

ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Matrix representation of conditions for the collision attack of SHA-1 and its application to the message modification

IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Optimal covering codes for finding near-collisions

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Classification and generation of disturbance vectors for collision attacks against SHA-1

Designs, Codes and Cryptography
On the collision resistance of RIPEMD-160

ISC'06 Proceedings of the 9th international conference on Information Security
Finding SHA-1 characteristics: general results and applications

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Finding good differential patterns for attacks on SHA-1

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Analysis of step-reduced SHA-256

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
The impact of carries on the complexity of collision attacks on SHA-1

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Improved linear differential attacks on cubehash

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Cryptanalysis of reduced variants of the FORK-256 hash function

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Breaking a new hash function design strategy called SMASH

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Impact of rotations in SHA-1 and related hash functions

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Cryptanalysis of round-reduced HAS-160

ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Algebraic cryptanalysis of 58-round SHA-1

FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Differential attacks on reduced RIPEMD-160

ISC'12 Proceedings of the 15th international conference on Information Security
Collision attacks on the reduced dual-stream hash function RIPEMD-128

FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
Memoryless near-collisions, revisited

Information Processing Letters

Quantified Score

Hi-index	0.06

Visualization

Abstract

In this article we show that coding theory can be exploited efficiently for the cryptanalysis of hash functions. We will mainly focus on SHA-1. We present different linear codes that are used to find low-weight differences that lead to a collision. We extend existing approaches and include recent results in the cryptanalysis of hash functions. With our approach we are able to find differences with very low weight. Based on the weight of these differences we conjecture the complexity for a collision attack on the full SHA-1.