RainbowCrack is a general proposed implementation of Philippe Oechslin’s faster time-memory trade-off technique. It cracks hashes with rainbow tables.
RainbowCrack uses a time-memory tradeoff algorithm to crack hashes. It differs from brute force hash crackers.
A brute force hash cracker generates all possible plaintexts and computes the corresponding hashes on the fly, then compares 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 needs 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 tables. 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.
Download Link:- https://github.com/inAudible-NG/RainbowCrack-NG
