Sponsorised links
This year
md5.rednoize.com - reverse engineer md5 hashes - powered by rednoize.com
Moteur de recherche qui permet de retrouver des mots de passe hashés en md5 ou sha1.
2007
Tutoriel : Sécuriser un site Internet (MD5, SSL et sessions)
Un tutoriel pour comprendre les enjeux de la sécurisation d'un site Internet, et des conseils pour la mettre en place.
Storing Passwords in MySQL
Securing plain text passwords in MySQL is NEVER a good idea. As a DBA you should take great care in protecting the users' information. Fortunately MySQL provides you with several options to protect passwords.
Sponsorised links
2006
MD5 Crack
MD5 cracking site that uses Rainbow Tables and big dictionary search for md5 hash cracking
2005
Javascript md5 (and md4 and sha1)
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)
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
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.
1
(9 marks)
