3 ms·
Yeah, you're wrong. You'd be right if password cracking was limited to checking 'a' through 'z', then 'aa' through 'zz', then 'aaa' through 'zzz', but that's n
by tomku 13y ago
Yeah, you're wrong. You'd be right if password cracking was limited to checking 'a' through 'z', then 'aa' through 'zz', then 'aaa' through 'zzz', but that's not how it usually works in practice.
In practice, a cracking program is generally going to have a dictionary and an algorithm for generating passwords based on modifying and/or combining the words in that dictionary according to certain rules. The dictionary isn't just English words, but also common non-English words, words formed by keys that are close on the keyboard, etc.
If that dictionary contains "asd" and "1234" (which is a pretty safe bet), it will probably end up trying "asdasdasdasdasdasdasdasdasd1234" much sooner than you would predict based on an exhaustive search. I can't say for sure that 13 seconds is the right answer, but I think it's the right order of magnitude. We're talking seconds/minutes, not years.
Edit: changed "sequential search" to "exhaustive search" to reflect the fact that it doesn't have to be strictly ordered.
- qu4z-2 13y agoThanks for taking the time to explain my comment. I would've gotten to it eventually, but you've done a better job than I would've anyway, so it all works out. :) EDIT: And just so we're on the same page... This is for recovering the plain-text password from a known hash. If you have to test each candidate against a web-service or something it'll take a significantly longer time.
- katbyte 13y agoYes, I was thinking more along the lines of hacking into something rather then decrypting a password hash.