Rainbow Tables

Overview

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. DNA and PRTK seamlessly integrate with Rainbow Tables.

Key Features

MS Office
 
MS Office 97 and 2000 derive a 40-bit encryption key from a user-supplied password. Our rainbow tables recover that 40-bit key in typically less than one minute. Once the key has been recovered, the document can be decrypted.
 
Adobe PDF
 
Older PDF versions derive a 40-bit key from the user supplied password. Our rainbow tables recover that key, usually in less than a minute. Once the key has been recovered, the document can be decrypted. Again, the key, not the password, is recovered. Newer PDF versions use 128-bit keys and cannot be attacked with rainbow tables.
 
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.

Ratings and Reviews

Rating	Please select12345 - best	Name		Email
Comments
	Please note: Name and Email are for internal purposes only.

Other Products By AccessData Corp