Stats | |
Active machines |
1260 |
Online machines |
398 |
Current CPU power |
1592 GHZ |
Last 24 hours |
3708 million chains |
Current speed |
41528 chains per second |
Data growth |
55.25 GB |
Cracked hashes |
36612 |
MD5 |
30696 |
NTLM |
4732 |
LM |
1184 |
Uncracked hashes |
42316 |
MD5 |
35242 |
NTLM |
5944 |
LM |
1130 |
Success rate |
46.39% |
MD5 |
46.55% |
NTLM |
44.32% |
LM |
51.17% |
Last password cracked |
bellido01 |
Most popular password |
test (153 times) |
Cracking queue size |
104 |
Free Rainbow Tables offers high quality rainbow tables for free and can be downloaded using BitTorrent or HTTP.
All tables are generated using a distributed approach with many of our users helping to generate more rainbow tables
Many steps are taken to increase the cracking speed of the tables, and we are proud to offer some of the fastest rainbow tables found on the Internet!
For detailed information about how it works, see the download page
If you don't wan't to download all the tables, we can also offer to scan your password hashes through all of the rainbow tables.
Thanks to our distributed approach, we can scan thousands of hashes through all of our rainbow tables in little time. Just register and let us start cracking your hashes
The cracking service is limited to 10 hashes per 24 hours. To be able to crack more than that, you have to contribute to our distributed rainbow table generation project by downloading and running the DistrRTgen client.
One - Register an Account.
You can register by clicking the link in the login box at the top of the page.
Two - Download the Client.
The newest version is available here. Install it and enter your username and password. This client is responsible for table generation (which should begin automatically), and rainbow cracking. The more clients you are running the faster your hashes will be cracked - more on that in a minute.
Three - Submit some hashes!
Here's how it works. Running hashes through a rainbow table requires two main tasks: generation of indices based on the hash and the tables in which it will be searched, and then searching the actual table. It's not much work compared to brute forcing, but for any one server to handle the worlds submissions is almost infeasible.
Most of the work involved is in generating indices of the hashes for the table, and searching the table (using those indices) is a relatively quick job. What we do differently is distribute the work of generating the indices (which does not require you to have the rainbow tables) through the client, which returns the results to the server automatically. Your hash is then searched in the tables using those indices. Your hashes can be submitted through the client, or through the website. They are then delegated evenly among clients running under your user account; so the more clients you are running, the faster the job will be done. Distributing this part of the job drastically eases the load on the server.
The result is a cracking service which can handle far more hashes, far more quickly, searching far more tables, and because you are doing much of the work, we can do it all for free!
To ensure that everybody gets fair use, we use a credit system. Generating tables (just by allowing the DistrRTgen client to run in the background) earns you credits. These credits can then be used for hash cracking any time.
You also get ten free credits every 24 hours, which can be used within that 24-hour period, so running the client for long periods to generate tables (though helpful) is not mandatory.
We do have costs to cover, so if you would like to buy extra credits, please email us.
Otherwise, donations are always appreciated.
Links:
Project Rainbow Crack
Faster Cryptanalytic Time-Memory Trade-Off - Philippe Oechslin
Rainbow Tables Wikipedia Entry
Contact:
Email: admin@freerainbowtables.com
IRC: #freerainbowtables on irc.freenode.net