Hashing

Hashing is the process where data is converted into a hash using a hash function. The hashing is mostly used for file integrity verification processes. The hash value can be either a string or a number or a combination of both. Hashing is a one way process, which means it is irreversible. A hash function can be any hash function that is used to map data of arbitrary size to data of a fixed size. A storage collection of hashed values are called Hash Tables.

Hash Algorithms

Hash algorithms are used to create hash values. These hash algorithms are also called Hash Function. The generated output can be either called Hash Value or Hash Digest.

Characteristics of Hashing Algorithms :-

• Irreversibility.
• Collision resistance.
• Speed.
• Avalanche effect.
• Determinism

Examples of Hashing Algorithms :-

1. MD5
2. SHA-1
3. SHA-2