2 ms·
I appreciate your response. I still disagree with your basic premise. The difficulty with making large Rainbow Tables is not the storage space, but the time n
by nkurz 15y ago
I appreciate your response. I still disagree with your basic premise. The difficulty with making large Rainbow Tables is not the storage space, but the time necessary to create the initial table. Faster GPU's make Rainbow Tables more effective for large password spaces, not less. The size of the table can be arbitrarily reduced by using longer chains. The real limiting factor is the time to generate the initial table, which is comparable to making a single brute force search.
The theory is beyond my ability to explain, but as a practical example, this page might be useful: http://ophcrack.sourceforge.net/tables.php http://ophcrack.sourceforge.net/tables.php
It's not an exact match up, but look at "Vista 7" table. For complete coverage of a 95 character set (not sure how you calculated 77 printable ASCII) up to 7 characters, they require 36 GB instead of the 417 TB you propose. Since theirs ships and works, I'm inclined to believe that your theory is in error.
Also, I could be mistaken, but I don't think there is such a thing as a "Dictionary Rainbow Table". You can choose any character set you want, but because of the way the algorithm works I don't think you can restrict to a prechosen word set.