Performance Analysis of Cryptographic Hash Functions

This paper presents the design and analysis of cryptographic hash functions. A hash function is a map from variable-length input bit strings to fixed-length output bit strings. Despite their simple definition, hash functions play an essential role in a wide area of applications such as digital signature algorithms, message authentication codes, password verification, and key derivation. The main contribution of this paper is to obtain some important parameters for a cryptographic hash function for comparative study. In this paper, we approach the problem of the design and analysis of cryptographic hash functions. We cover the design aspects of some hash functions in this paper and then we are analyzing the result of cryptographic hash functions.