Recent developments in cryptographic hash functions: Security implications and future directions

Authors:
Carlos Cid
Affiliations:
Information Security Group, Royal Holloway, University of London, Egham TW20 0EX, UK
Venue:
Information Security Tech. Report
Year:
2006

Citing 9
Cited 2

Handbook of Applied Cryptography

Handbook of Applied Cryptography
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
The MD4 Message Digest Algorithm

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
RIPEMD-160: A Strengthened Version of RIPEMD

Proceedings of the Third International Workshop on Fast Software Encryption
Cryptanalysis of MD4

Proceedings of the Third International Workshop on Fast Software Encryption
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
Collisions of SHA-0 and reduced SHA-1

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
New directions in cryptography

IEEE Transactions on Information Theory

Color image encryption based on one-time keys and robust chaotic maps

Computers & Mathematics with Applications
Design and development of a mobile EPC-RFID-based self-validation system (MESS) for product authentication

Computers in Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most important classes of cryptographic algorithms in current use is the class of cryptographic hash functions. Hash functions are ubiquitous in today's IT systems and have a wide range of applications in security protocols and schemes, such as providing software integrity, digital signatures, message authentication and password protection. Among their many security requirements, cryptographic hash function algorithms need to feature a property known as collision resistance, that is, it must be infeasible to construct two distinct inputs with the same hash output. This article provides an overview of cryptographic hash functions and some of the recent developments affecting their security, namely the discovery of efficient methods for constructing collisions for algorithms such as MD5 and SHA-1. We also discuss the many implications of these recent attacks, and the possible directions for the development of the theory of hash functions.