Enhancing Hash Function Selection Techniques Based on Message Contents

Abstract

In Hash based Security systems two major factors that are mostly relied upon are Strong Hash function and the selection procedure of the hash function from a given pool. This paper aims at exploiting maximum available resources a message possesses, intrinsically, that can accommodate greater number of hash functions references. It provides a simple, low cost- easy to implement technique that will be able to make systems available with random hash functions' selection ability. With the given technique the security level will be enhanced along with greater availability of hash functions. The truly variable nature of contents of messages can be exploited in order to secure messages beyond measure. In case of a single communication stint, if one hash function is compromised the next hash function for next block will be selected truly randomly and cannot be predicted. A summary of already in use techniques is also discussed in order to prove the proposition distinct and practicable. In proposed technique it is proven that it has ability to accommodate greater number of hash functions. Further, the hash function selection methodology has been provisioned with a technique to be message-dependent; the security cannot be compromised owing to truly randomness of the selection procedure. I-Introduction The prime necessity in the world of computers and data communication is the provision of ways to check message integrity. The authentication and integrity aspect of a communication process has developed rapidly in recent years. The methods employed have matured for the fulfillment of requirements for given scenarios. A mechanism that involves use of secret key is generally known as preservation of message integrity and authentication check through MAC (message authentication codes). In layman terminologies, the MAC is basically a short piece of information used to authenticate a message.