About Rainbow Tables Decryption

Rainbow tables are pre-computed, brute-force attacks. In cryptography, a brute-force attack is an attempt to recover a cryptographic key or password by trying every possible combination until the correct one is found. How quickly this can be done depends on the size of the key, and the computing resources applied.

A system set at 40-bit encryption has one trillion keys available. A brute-force attack of 500,000 keys per second would take approximately 25 days to exhaust the key space combinations using a single 3 Ghz Pentium 4 computer. With a Rainbow Table, you can decrypt 40-bit encrypted files in seconds or minutes rather than days or weeks. Click here for additional information about Rainbow Tables.

Windows LAN Hash

AccessData has three types of rainbow tables:

• MS Office
• Adobe PDF
• Windows LAN hash

This version of Rainbow Tables only operates with Windows LAN Hash.

These rainbow tables are a little different than the others. First, they recover passwords, not keys. Second, the number of possible LAN passwords is much more than a trillion (the approximate size of a 40-bit key space), so it is not practical to generate a complete set of LAN rainbow tables. However, if we restrict the set of characters in the passwords to letters, numbers, and about 16 other symbols, then the rainbow tables covering these passwords fit in about the same space as the Office and PDF tables.

DNA and PRTK

DNA 3.2 and PRTK 6.2 seamlessly integrates with Rainbow Tables.

Hard Disk Space

Since rainbow tables store the result from every possible key test, they are typically very large. Each of our three Rainbow Tables is just under three (2.7) terabytes. The first two tables provide a key with which to open an encrypted file. The third provides the actual password.