Articles

what is hashing algorithm and explain briefly how it works

by Compare Cheap SSL compare ssl certificate

The word Hashing algorithms explain that they are encryption algorithms. Though, there is a little of which is used more often than others. The most common hashing algorithms might be consisting of MD5, SHA-1, SHA-2, NTLM, and LANMAN.

 

1 MD5: Message Digest set of rules considers this as the fifth version. 128-bit outputs is generally made by MD5. It was until the demerits of the inside of the set of rules started to be explored. And it has to be noted that manydrawbacks were collisions. Due to these issues, the MD5 got out of common use.

 

2 SHA-1: the Secure Hash Algorithm standard considers it as the second one version. The SHA-zero being the first. 160-bit outputs is the featureof SHA-1 hashing algorithm. It is also one of the foremost algorithms which started to update MD5. The updates were done after finding the vulnerabilities. It gained massive use and acceptance by the users. FIPS 140 compliant hashing algorithm was the designation assigned to it.

 

3 SHA-2: it is nothing but a collection of hashing algorithms, which incorporates SHA-256, SHA-384, SHA-224, and SHA-512. When compared with SHA-1 algorithms these SHA-2 algorithms are known to be more stable, but it has not gained any significant use.

 

4 LANMAN: It was utilized by systems to save passwords. To create hash it used DES algorithms. LANMAN’s implementation of the DES set of rules isn’t very secure which creates trouble therefore it is more prone to attacks. The password hashes of LANMAN can be configured in a few hours.

 

5 NTLM:  authentication is granted when the NTLM set of rules is used for password hashing. The hashing algorithm of NTLM follows the algorithm of the LANMAN.

Read more....


Sponsor Ads


About Compare Cheap SSL Advanced   compare ssl certificate

12 connections, 0 recommendations, 114 honor points.
Joined APSense since, May 21st, 2016, From New york, United States.

Created on Jun 10th 2020 10:25. Viewed 260 times.

Comments

No comment, be the first to comment.
Please sign in before you comment.