July 2006
June 2006
April 2006
January 2006
MD5 Crack
by MageDealer
MD5 cracking site that uses Rainbow Tables and big dictionary search for md5 hash cracking
September 2005
General Purpose Hash Function Algorithms
by hausmeister & 1 other (via)
Contains the source code of various hash functions
General Purpose Hash Function Algorithms
by nachilau & 1 other
Contains the source code of various hash functions
August 2005
April 2005
February 2005
Javascript md5 (and md4 and sha1)
by nhoizey & 5 others
The MD4, MD5 and SHA-1 algorithms are secure hash functions. They take a string input, and produce a fixed size number - 128 bits for MD4 and MD5; 160 bits for SHA-1. This number is a hash of the input - a small change in the input results in a substantial change in the output. The functions are thought to be secure, in the sense that it would require an enormous amount of computing power to find a string which hashes to a chosen value. In others words, there's no way to decrypt a secure hash. The uses of secure hashes include digital signatures and challenge hash authentication.
Javascript md5 (and md4 and sha1)
by Krome & 5 others
The MD4, MD5 and SHA-1 algorithms are secure hash functions. They take a string input, and produce a fixed size number - 128 bits for MD4 and MD5; 160 bits for SHA-1. This number is a hash of the input - a small change in the input results in a substantial change in the output. The functions are thought to be secure, in the sense that it would require an enormous amount of computing power to find a string which hashes to a chosen value. In others words, there's no way to decrypt a secure hash. The uses of secure hashes include digital signatures and challenge hash authentication.
Javascript md4, md5 and sha1 algorithms
by benoit & 5 others
The MD4, MD5 and SHA-1 algorithms are secure hash functions. They take a string input, and produce a fixed size number - 128 bits for MD4 and MD5; 160 bits for SHA-1. This number is a hash of the input - a small change in the input results in a substantial change in the output. The functions are thought to be secure, in the sense that it would require an enormous amount of computing power to find a string which hashes to a chosen value. In others words, there's no way to decrypt a secure hash. The uses of secure hashes include digital signatures and challenge hash authentication.
