Cryptographic Hashing Function (SHA-1 and MD5): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
== | ==What is a Cryptographic Hash Function?== | ||
A crytographic hashing function is a deterministic procedure that takes a block of code and returns a fixed bit string. | A crytographic hashing function is a deterministic procedure that takes a block of code and returns a fixed bit string. | ||
| Line 16: | Line 16: | ||
MD5 was developed by Ron Rivest in 1991 | MD5 was developed by Ron Rivest in 1991 | ||
MD5 | MD5 was published in 1992. | ||
Its used in many security applications, and is great for checking file integrity. | Its used in many security applications, and is great for checking file integrity. | ||
==Differences== | |||
Revision as of 21:42, 8 December 2010
What is a Cryptographic Hash Function?
A crytographic hashing function is a deterministic procedure that takes a block of code and returns a fixed bit string.
Two widely used hasing functions used today are MD5 and SHA-1
SHA-1
SHA-1 was designed by the Nation Security Agency (NSA) in 1995.
Published by The National Institute of Standards and Technology as a Federal Information Processing Standard for the US.
SHA-1 is an upgraded version of SHA-0, correcting an error is the hash specification.
SHA-1 is the most used version of SHA today. It is currently used in many applications and security protocols.
MD5
MD5 was developed by Ron Rivest in 1991
MD5 was published in 1992.
Its used in many security applications, and is great for checking file integrity.