Stats | |
Active machines |
642 |
Online machines |
327 |
Current CPU power |
1241 GHZ |
Last 24 hours |
4819 million chains |
Current speed |
56181 chains per second |
Data growth |
71.81 GB |
Cracked hashes |
16431 |
Uncracked hashes |
23218 |
Success rate |
41.44% |
Last password cracked |
1855742347 |
Most popular password |
test (121 times) |
Cracking queue size |
4957 |
Free Rainbow Tables is dedicated to the generation and distribution of rainbow tables and a distributed method of cracking. For detailed information about how it works, see the download page
A powerful cracking tool, because it's capacity is not limited to the power of one server for all submissions, and because the Distributed Rainbow Table generation client (DistrRTgen) is the quickest way to build comprehensive table sets, which are immediately able to be used for cracking.
Furthermore, it's free!
Generation of the perfect tables is well under way, and now that we know it's all working we need to put some money into the server. We need more HDDs, as well as controllers for them, RAM, and other expenses. Our goal is US$3000. Please throw in whatever you can. Thanks!
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