Recently, I’ve been doing quite a bit of research and usage in the field of Rainbow Tables. “Rainbow Tables” refers to an pre-generated series of hashes arranged in chains, ultimately exploring an entire phase space of hashing algorithms, enabling users to crack a password using the improved time-memory trade-off technique as proposed by Philippe Oechslin.
The practical upshot of which is that with a fully generated set of Rainbow Tables, it’s possible to crack any un-salted one-way hashed password in a reasonable amount of time (we’re talking minutes). Their usage includes, but is not limited to WPA-PSK, Poisoned NTLM/LM Challenge/Response, MD4, MD5, SHA-1, LM, MS-CACHE and NTLM cracking.
Free Rainbow Tables is a newly rejuvenated project which uses distributed computing technology in order to compute diverse Rainbow Tables for all to use on-line, and download for offline usage.
Recent Comments