Modifications of SHA-0 to prevent attacks

Authors:
Roshni Chatterjee;Moiz A. Saifee;Dipanwita RoyChowdhury
Affiliations:
Dept. of Computer Science & Engineering, Indian Institute of Technology, Kharagpur, India;Dept. of Computer Science & Engineering, Indian Institute of Technology, Kharagpur, India;Dept. of Computer Science & Engineering, Indian Institute of Technology, Kharagpur, India
Venue:
ICISS'05 Proceedings of the First international conference on Information Systems Security
Year:
2005

Citing 11
Cited 0

Collisions for the compression function of MD5

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Cryptography and Network Security: Principles and Practice

Cryptography and Network Security: Principles and Practice
The MD4 Message Digest Algorithm

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Differential Collisions in SHA-0

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
RIPEMD-160: A Strengthened Version of RIPEMD

Proceedings of the Third International Workshop on Fast Software Encryption
TIGER: A Fast New Hash Function

Proceedings of the Third International Workshop on Fast Software Encryption
An Attack on the Last Two Rounds of MD4

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The FSR-255 family of hash functions with a variable length of hash result

Artificial intelligence and security in computing systems
Differential cryptanalysis mod 232 with applications to MD5

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Update on SHA-1

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most popular hash algorithms is the SHA-0, proposed by NIST. However, researchers have already found security flaws in SHA-0, thereby also posing a threat against other algorithms of the SHA family. In this paper we present two simple modifications which can be easily incorporated into the original SHA-0 algorithm to make it secure against one of its most basic attack methodologies. We further show that the modified algorithm performs equally well as the original one when compared against standard metrics that are used to evaluate hash functions. We have developed a prototype tool to compare and evaluate the modified and the original SHA-0 algorithm.