Rainbow cracking attacks and Brute-force attack

Hi 开发者_如何转开发a small question about Rainbow cracking attacks and Brute-force attack

does rainbow attack considerer as a variant of a Brute-force attack ?

also in Brute-force attack it search for all possible key values and what does rainbow search ?

A brute force attack naively tries every possible value.

A Rainbow table is a method for compressing hashes as to reduce the amount of disk space needed to store series of hash-results. Very useful if you want to store lots-of-hashes to safe computation time. (A rainbow table attack is a specialisation of a precomputation attack.)

You could build a rainbow table based on the results of a brute force attack, but you could also build one on the results of (for example) a dictionary attack. I learned that this statement is false.

The nature of rainbow tables dictates that it is a brute-force attack. For a more complete explanation read: Crunge's answer to What are rainbow tables and how are they used?

Jeff wrote a nice blog post on Rainbow cracking : http://www.codinghorror.com/blog/2007/09/rainbow-hash-cracking.html . You may find it useful.

The rainbow search builds a table of all possible values and THEN attacks. Brute force build-attacks, build-attacks, build-attack (you get the idea)