Hashing Algorithms
Hashing is the process of mapping binary data of variable length to a fixed size binary data.
The algorithms without keys are used only to calculate secure hashes for data to ensure integrity, whereas the keyed algorithm are issued together with a key as a MAC for bath integrity.
Hashing is the process of mapping binary data of variable length to a fixed size binary data.
Applying the same hash function to two identical data structures yields the same result.
There are two kind of hashing algorithms : with or without a key.The algorithms without keys are used only to calculate secure hashes for data to ensure integrity, whereas the keyed algorithm are issued together with a key as a MAC for bath integrity.
- ALGORITHM NAME:SHA1 DESCRIPTION :USES SHA ALGO WITH A RESULTING HASH OF 160 BITS
- ALGORITHM NAME: SHA256 DESCRIPTION :USES SHA ALGO WITH A RESULTING HASH OF 256 BITS
- ALGORITHM NAME:SHA 512 DESCRIPTION :USES SHA ALGO WITH A RESULTING HASH OF 512 BITS
- ALGORITHM NAME:SHA 384 DESCRIPTION :USES SHA ALGO WITH A RESULTING HASH OF 384 BITS
- ALGORITHM NAME:MD5 DESCRIPTION :USES MD5 HASH ALGORITHM
- ALGORITHM NAME:RIPEMD160 DESCRIPTION :USES RIPEMD HASH ALGORITHM