MD5 Hashing Algorithm:
MD5 was developed by Professor Ronald Rivest in 1994. Irrespective of the message length given, MD5 produces an output value of 128 bit/16 byte “message digest” or “fingerprint”, which makes it a faster implementation than SHA-1. It is theorised that it is practically impossible to develop same digest for any of the given two messages and also to develop a message from the given message digest.
It is a block-chained hashing algorithm where the compression is applied on the successive blocks of the message to calculate the hash value. In this hashing algorithm, initially the whole message is divided into message blocks of 512 bits, then the compression function is applied on the 128 bits of chaining value and the first message block of 512 bits, then the resultant 128 bits hash value is taken as the initial value for the next message block.
Then the resultant 128bits hash value is taken as the final hash value for the entire message. This MD5 hashing algorithm is specified for the digital signatures where there is a need for compressing a large file before encrypting with a secret key or private key in a public key cryptography systems, In such a way while we download a file from the internet by using this hashing algorithm we can check the integrity of the file.
This Project Paper is written & submitted by Deepak V.