The protection of information authentication is based on cryptographically secure hash function. A function that compresses an arbitrarily large message into a fixed small size message digest' is known as a hash function. The most currently used hash functions are based on block ciphers and the dedicated hash functions e. g. MD5, SHA-0 and SHA-1 etc. A hash function is said to be broken if an attacker is able to show that the design of the hash function violates at least one of its claimed security property. In present paper we are planning to design and develop an efficient and effective hashing scheme for information authentication. We will try to design a hashing method which has certain features like speed and more security.

1. Bamford, J. Body of Secrets : Anatomy of the Ultra-Secret National Security Agency from the Cold War Through the Dawn of a New Century. New York: Doubleday, 2001. The Puzzle Palace: Inside the National Security Agency, America's most secret intelligence organization. New York: Penguin Books, 1983.
2. Barr, T. H. Invitation to Cryptology. Upper Saddle River (NJ): Prentice Hall, 2002.
3. Bauer, F. L. Decrypted Secrets: Methods and Maxims of Cryptology, 2nd ed. New York: Springer Verlag, 2002.
4. Denning, D. E. Cryptography and Data Security. Reading (MA): Addison-Wesley, 1982.
5. Diffie, W. & Landau, S. Privacy on the Line. Boston: MIT Press, 1998.
6. Electronic Frontier Foundation. Cracking DES: Secrets of Encryption Research, Wiretap Politics & Chip Design. Sebastopol (CA): O'Reilly & Associates, 1998.
7. C. Besnard and J. Martin, ?DABO: proposed additional message authentication algorithms for ISO 8731,? preprint, 1992.
8. E. Biham and A. Shamir, ?Differential cryptanalysis of Feal and N-hash,? Advances in Cryptology, Proc. Eurocrypt'91, LNCS 547, D. W. Davies, Ed. , Springer-Verlag, 2005, pp. 1–16

Cryptography