Recent developments in cryptographic hash functions: Security implications and future directions [An article from: Information Security Technical Report]

This digital document is a journal article from Information Security Technical Report, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
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.