Crack hashes with rainbow tables

RainbowCrack is a general propose implementation of Philippe Oechslin’s faster time-memory trade-off technique. It crack hashes with rainbow tables.

RainbowCrack uses time-memory tradeoff algorithm to crack hashes. It differs from brute force hash crackers.

A brute force hash cracker generate all possible plaintexts and compute the corresponding hashes on the fly, then compare the hashes with the hash to be cracked. Once a match is found, the plaintext is found. If all possible plaintexts are tested and no match is found, the plaintext is not found. With this type of hash cracking, all intermediate computation results are discarded.

A time-memory tradeoff hash cracker need a pre-computation stage, at the time all plaintext/hash pairs within the selected hash algorithm, charset, plaintext length are computed and results are stored in files called rainbow table. It is time consuming to do this kind of computation. But once the one time pre-computation is finished, hashes stored in the table can be cracked with much better performance than a brute force cracker.

* Full time-memory tradeoff tool suites, including rainbow table generation, sort, conversion and lookup
* Support rainbow table of any hash algorithm
* Support rainbow table of any charset
* Support rainbow table in raw file format (.rt) and compact file format (.rtc)
* Computation on multi-core processor support
* GPU acceleration with NVIDIA GPUs (CUDA technology)
* GPU acceleration with AMD GPUs (OpenCL technology)
* GPU acceleration with multiple GPUs
* Runs on Windows operating systems
* Runs on Linux operating systems
* Unified rainbow table file format on all supported operating systems
* Command line user interface
* Graphics user interface

Download RainbowCrack for Windows amd64.

Download RainbowCrack for Linux amd64.

For more details please visit RainbowCrack web page.