Abstract

The term hash function has been used in computer science from quite some time and it refers to a function that compresses a string of arbitrary input to a string of fixed length. Cryptographic hash functions are one of the most important tools in the field of cryptography and are used to achieve a number of security goals like authenticity, digital signatures, pseudo number generation, digital steganography, digital time stamping etc. For the past few decades cryptographic hash function become the centre of attention in the cryptographic community. The security of hash function became an important topic as almost every day the world of hash function is facing a new attack. The present paper provides an extensive study on cryptographic hash functions with their applications, properties and detailed classification and also presents a detailed description of cryptographic hash algorithms. It also discusses a general classification of all kinds of possible attacks on hash function analyses some attacks on specific hash functions.

Highlights

  • The term cryptology consists of two concepts – one is cryptography that is the technique of information security and other is cryptanalysis that is the technique of information disclosure

  • The idea is to construct two different messages that has same value in the Cryptographic hash functions have broad applications in the domain of computer security, and programs built on top of cryptographic hash functions have the ability to help a system administrator detect changes of valuable data on his or her network

  • These concepts are relevant in the growing online world, where every message sent across the wire can be worth money, and every file on a server is a valuable resource. Without safeguards such as those afforded by hash functions, data would be extremely vulnerable to attack

Read more

Summary

INTRODUCTION

The term cryptology consists of two concepts – one is cryptography that is the technique of information security and other is cryptanalysis that is the technique of information disclosure. The concept of converting intelligible data into unintelligible format before transmitting is popular from ancient ages This technique of hiding information is called cryptography in other words cryptography is the technique to create secure communication protocol and this is done by Cryptosystems. Pre-image resistance – A hash function “g” is said to be pre-image resistance if from a known output (h) of the function if is quite impossible to find the input (x) i.e. g(x)=h. A hash function can represent a much longer message with a small unique message i.e. maps a variable length message into a fixed length output called a hash value or message digest. There are different uses of hash function in computer science Such as uniform distribution of storage, sorting, searching (as hash table in data structure), in checksum algorithm for error detection and in cryptology. Rituparna Kundu et al, International Journal of Advanced Research in Computer Science, 11 (2), March-April 2020,37-44

Classification based on number of input
Classification based on Hash function construction
CRYPTOGRAPHIC HASH ALGORITHMS
PANAMA
MASH-1
ATTACKS ON HASH FUNCTION
Attacks independent of the algorithm
Evolution of Hash functions and Analysis of Attacks on specific hash functions
CONCLUSIONS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call