11-25-2015, 05:56 PM
Hello DF,
Hashing Definition - Hashing is the transformation of a string of characters into a shorter fixed length value/key that represents the original string.
Hashing is used to index and retrieve items in a database. It is faster to find the item using the shorter hashed key than to find the original value. It is also used in encryption algorithms
The mostly used Hash types are MD5, SHA-1, and SHA-2
MD5 has a Word Size of 32, and has Collision
SHA-1 has a Word Size of 32, and has Collision
SHA-2 has a Word Size of 64, and has no Collision
Decryption Sites
Suggested Brute Forcing Program
http://hashcat.net/hashcat/
You will need a word list, i suggest getting a very large word list for any brute forcing program.
I'm sorry if the tutorial doesn't help you. The first link under Decryption Sites, is most likely one of the best free hash crackers.
Also, I'm sorry if this was the incorrect section. I couldn't find a "Tutorial" Section. But this was the closest I could find.
Hashing Definition - Hashing is the transformation of a string of characters into a shorter fixed length value/key that represents the original string.
Hashing is used to index and retrieve items in a database. It is faster to find the item using the shorter hashed key than to find the original value. It is also used in encryption algorithms
The mostly used Hash types are MD5, SHA-1, and SHA-2
MD5 has a Word Size of 32, and has Collision
SHA-1 has a Word Size of 32, and has Collision
SHA-2 has a Word Size of 64, and has no Collision
Decryption Sites
Suggested Brute Forcing Program
http://hashcat.net/hashcat/
You will need a word list, i suggest getting a very large word list for any brute forcing program.
I'm sorry if the tutorial doesn't help you. The first link under Decryption Sites, is most likely one of the best free hash crackers.
Also, I'm sorry if this was the incorrect section. I couldn't find a "Tutorial" Section. But this was the closest I could find.