Hacker News new | ask | show | jobs
by jakobson14 1021 days ago
That's called a dictionary attack and it's not a function of computing power.
2 comments
_lvbh 1021 days ago
If you obtain a hash and want to brute force it with a dictionary attack, the amount of time it takes is still a function of computing power since you have to hash the strings & compare. The success rate is of course not
link
jakobson14 1017 days ago
You don't understand how dictionary attacks work.

1) Dictionaries are TINY compared to the number of possible hashes. Something you could reasonably fit on a single hard drive in many cases. Humans really aren't that creative when it comes to choosing passwords.

2) You don't hash every entry in the dictionary on-the-fly. That's stupid. You store the hashes in a large lookup tree and compare hash-to-hash. There's basically no processing power required, especially compared to actual hashing work.

link
CyberRage 1021 days ago
what is your point exactly?

really bizarre response, if you don't have something good to say, don't.

link