Cracking With Rainbow Tables 4h4y1o

CRACKING WITH RAINBOW TABLES, L0PHTCRACK , CAIN AND ABEL

HASH FUNCTION 

Cryptographic hash function is an algorithm that takes an arbitrary block of data and returns a fixedsize bit string. - Most cryptographic hash functions are designed to take a string of any length as input and produce a fixed-length hash value.

Different Types Of Hashes And How To Identify Them

1. MD4 &MD5 : - MD5 - The most common hash you will come across in the wild is an MD5 hash (Message-Digest algorithm). These hashes are easily identified by the following factors: - They are always 32 characters in length (128 Bits) -They are always hexadecimal (Only use characters 0-9 and A-F)

-MD5(Unix) always start with: $1$

-MD5(APR) start with : $ apr1$. 2. MYSQL : 

These hashes are easily identified by the following factors They are always 16 Characters in length (64 bits)



They are always hexadecimal (Only use characters 0-9 and A-F)

3. MySQL v5.x They are always 41 characters in lengthThey are always capitalizedThey always begin with an asterisk 4. SHA-1 : They are always 40 Characters in length (160 bits)They are always hexadecimal (Only use characters 0-9 and A-F)

For a further look : theses are some different hashes for the word : soqor MD2 : 0ec0c9e5237eb7d672310daa6b1b51f2 MD4 : 709a0367826c5cfee0ef668f586742fd

MD5 : 7264724833510a7a76000f05699e7041 MD5(APR) : $apr1$Shpt4gRC$ilH6whzhzx6CN1K.2bYCC1 MD5(Unix) : $1$Q4IX/fph$rZ5aKuoM8NPB8n4AjbBrS1 MD5(phpBB3) : $H$9nSr78kk4i987MlI70tJTNgj8aguDU1 DES(Unix) : Ph8Fr6gaEFrJ MySQL : 15765bce79b89651 MySQL v5.x : 631846d99ef4744c9b58761c22801ef95502749e SHA-1 : d65f29fb867aacb2bd9e74968453db56b61fc3a3 SHA224 : e676bb045cf37de0c50c309ad15ace266dcb978c53fee7590d 6f5b73 SHA256 : 08ecd044015cd7239cdf870843cbb939428292e6d89dbee464 134226d87d8714 SHA384 : d965b0baae69fd937adb2b89de31e9a4a03c72e4311A4d1a486 fbd5ff4a6c4c2d55f76baaab2df29e 6c70559ad5f56c61 SHA512 : 64c6cc633f089d1c487aaf94b6466e64528a04f35404b38c0d

CRACK ONLINE http://www.cmd5.org/  www.md5this.com/index.php 

What are rainbow tables? 



Rainbow tables is an Approach invented by Martin Hellman

Rainbow tables are a tool used to reverse one-way cryptographic hashes such as MD5, NTLM and SHA1. Using complex mathematical formulas, it can cover large key spaces in a short time.

•

•

A rainbow table is a lookup table offering a time-memory tradeoff used in recovering the plaintext from a hash generated by a hash function The concept behind rainbow tables is simple - Make one-way hash functions two way by making a list of outputs for all possible inputs up to a character limit

WHY SHOULD YOU USE RAINBOW TABLES? The common way to try and reverse a cryptographic hash is to either use brute-force or use a dictionary. - Brute force is done by hashing every single possible , or key, in the keyspace and comparing the result to the target hash. This can be computationally infeasible as the s gets more complex. For example a with a length of 7 characters based on uppercase, lowercase, numbers and symbols can take up to 65.5 trillion tries. Even with many computers and a way to distribute the work, it will take a long time to cover the full keyspace.

- Dictionary attacks takes another approach to the problem. It doesn’t try the full keyspace, but restricts it to the words that seems most likely. With the above example of a 7 character , it is not likely the used a like xVdg#12 but instead simple words like ‘Article’ that are easy to . By only testing for s that are most likely, it is possible to quickly test for long s. - Rainbow tables are a middle ground between brute force and dictionary attack. Rainbow tables cover most of the keyspace (usually > 99.9% of the keyspace) and does it in a time that is much faster than brute force attacks. The key to doing this is by using precomputed files, rainbow tables, with complex mathematical formulas to reverse the cryptographic hashes. The reasoning behind rainbow tables is most of the work is done once upfront, so you don’t have to do very much work when you need to reverse a hash.

ADVANTAGES OF RAINBOW TABLES Time savings Rainbow tables usually recovers the hash faster compared to brute force attacks due to the work done upfront.  Space savings To store every single 7 character possible for the given example, it would require a least 417 TB of space - rainbow tables only need around 80 GB of storage space, depending on your generation options. o Rainbow Tables are built once, and used many times o Perfect for cracking weak hashes 



Examples •

Rainbow table cracking online   

http://www.project-rainbowcrack.com/ www.freerainbowtables.com www.OnlineHashCrack.com

WHAT IS L0PHTCRACK 

L0phtCrack is a auditing and recovery application (now called L0phtCrack 6) originally produced by Mudge from L0pht Heavy Industries. It is used to test strength and sometimes to recover lost Microsoft Windows s, by using dictionary, brute-force, hybrid attacks, and rainbow tables.It was one of the crackers' tools of choice, although most use old versions because of its low price and high availability.

WWW.L0PHTCRACK.COM

CAIN AND ABEL SOFTWARE 

Cain and Abel(often abbreviated to Cain) is a recovery tool for Microsoft Windows. It can recover many kinds of s using methods such as network packet sniffing, cracking various hashes by using methods such as dictionary attacks, brute force and cryptanalysis attacks. Cryptanalysis attacks are done via rainbow tables which can be generated with the winrtgen.exe program provided with Cain and Abel. Cain and Abel is maintained by Massimiliano Montoro and Sean Babcock

WWW.NET-SECURITY.ORG/SOFTWARE.PHP?ID=110