Application of Huffman data compression algorithm in hashing computation

Abstract

Cryptography is the art of protecting information by encrypting the original message into unreadable format. A cryptographic hash function is a hash function which takes an arbitrary length of text message as input and converts that text into a fixed length of encrypted characters which is infeasible to invert. The values returned by hash function are called as message digest or simply hash values. Because of its versatility, hash functions are used in many applications such as message authentication, digital signatures, and password hashing[2]. The purpose of this study is to apply Huffman data compression algorithm to the SHA1 hash function in cryptography. Huffman data compression algorithm is an optimal compression or prefix algorithm where the frequencies of the letters are used to compress the data [1]. An integrated approach is applied to achieve new compressed hash function by integrating Huffman compressed codes in the core functionality of hashing computation of the original hash function.