What are the types of Hashing in Information Security?

There are various types of hashing are as follows −

 RIPEMD − RIPEMD was produced in Europe as an element of RIPE project in 96 by researcher included in attacks on MD4/5. It is same as MD5/SHA and uses two parallel lines of 5 round of 16 steps. It makes a 160-bit hash value. It is slower but possibly more secure than SHA.

 MD5 − An MD5 hash function encodes a string of data and encodes it into a 128-bit fingerprint. MD5 is generally used as a checksum to check data integrity. MD5 is also called as suffer from expanded hash collision vulnerabilities, but it is the most broadly utilized algorithms in the world.

 CRC32 − A cyclic redundancy check (CRC) is an error-detecting code generally used for discovery of accidental changes to data. Encoding the similar data string using CRC32 will continually result in the same hash output, therefore CRC32 is consistently used as a hash algorithm for file integrity checks. Those days, CRC32 is exceptionally used external of Zip files.

Cyclic Redundancy Check is a number mathematically computed for a packet by its source device, and thus recomputed by the destination computer. If the original and recomputed versions at the destination computer differ, the packet is corrupt and required to be resent or removed.

The mathematical process for implementing a CRC is defined by the International Telecommunication Union (ITU) and includes using a 16-bit polynomial to the information being transmitted by the packet for packets of 4 KB of information or less, or a 32-bit polynomial for packets higher than 4 KB.

 Tiger Algorithm − Tiger cipher algorithm is a faster and adequate algorithm in comparison to the MD5 and SHA families. It has a 192-bit hashing system and is generally used in computers of the new era. Tiger2 is an advanced form of this algorithm that is more dynamic than the Tiger algorithm.

Tiger is designed utilizing the nearly worldwide Merkle-Damgård paradigm. The oneway compression function works on 64-bit words, supporting 3 words of state and processing 8 words of information.

There are 24 rounds, using a set of operation mixing with XOR and addition/subtraction, rotates, and S-box lookups, and a fairly intricate key scheduling algorithm for changing 24 round keys from the 8 input words.

 Message Digest Algorithm (MD4) − Message Digest Algorithm (MD4) is a cryptographic hash function producing a 128-bit digest. MD4 had a security flaw because of the first collision attack discovered in 1995. After that, some newer attacks also influenced this hash function. Ronald Rivest produced MD4 in 1990 and has affected designs of MD5, SHA-1, and RIPEMD algorithms.