(12-28-2014, 11:48 PM)epixoip Wrote: First, GPU is irrelevant for what you are talking about doing. CPU is faster than GPU for the algorithms you would be able to generate tables for, since it's impossible to gain any acceleration performing straight wordlist attacks against fast hashes.
Second, rainbow tables have NEVER been a viable substitute for straight dictionary attack, only brute force. And even then rainbow tables have been considered deprecated for many years now thanks to GPUs. We stopped using rainbow tables 5+ years ago because they are a waste of disk space, they're absurdly inflexible, they don't scale for shit, and smarter attacks (rule-based, combinator, targeted mask attacks) will win out every time.
Overlooking the idea that arbitrarily-large wordlists are completely braindead, let's say your 100 GB wordlist has about 9 billion words. And let's say you really do have a shitty CPU, and you can only pull 15 MH/s on md5. At 15 MH/s, it would only take you 10 minutes to run through your 100 GB of words. That's nowhere near the 2hrs you estimate. This wordlist can also be re-used for other algorithms and can be used to seed other attacks (rule-based, combinator, hybrid, etc), whereas your massive lookup table can't be used for any of those things.
It's just a terrible idea no matter how you slice it. Crack smarter.
My CPU and GPU both pass hashes at around 5 MH/s on a file containing 65K hashes. The CPU passes at 20 MH/s and GPU at 5 MH/s with dealing with 1 hash.
If I were to buy an external hard drive, space would not be an issue. So therefore, is there not a way to pre-hash the words in the wordlist, for example, instead of this
098f6bcd4621d373cade4e832627b4f6
It would be saved in the list as this
098f6bcd4621d373cade4e832627b4f6:test
Therefore, when I do a run through a list of hashes, it would be saving a lot of time as my hardware won't need to hash the words over and over again for every hash list I pass?
I really appreciate your replies.