3 ms·
The punchline: > The list contained 16,449 passwords converted into hashes using the MD5 cryptographic hash function. Edit: I'm removing all my snarky nitpick
by jacques_chester 13y ago
The punchline:
> The list contained 16,449 passwords converted into hashes using the MD5 cryptographic hash function.
Edit: I'm removing all my snarky nitpicking. This is a good article. Yes, the MD5 case they present is a poor case, but it's really about demonstrating the tactics of attack selection, rather than teaching someone how to make crack-resistant password schemes.
- grecy 13y ago> the MD5 case they present is a poor case If guys using vanilla hardware get that kind of success in 1 hour with MD5, you only need to increase hardware and the time required to see it's still completely doable for other hash functions.
- eksith 13y agoThe issue is practicality. Which is why pbkdf2 (and increasing the rounds each year) + bcrypt or scrypt is still a better option.
- MichaelAza 13y agoNoob question, but why would you use both pbkdf2 and bcrypt/scrypt? Aren't they all basically doing the same thing?
- JonnieCache 13y agoBcrypt is an algorithm which bundles up something which pbkdf2 achieves by iterating other algorithms. They're basically the same, but you should use bcrypt. You shouldn't use both of them, I'm guessing the poster above meant / rather than +. If you want more security, increase your (b|s)crypt work factor. If for some reason you can't bring the bcrypt code into your project, you can implement pbkdf2 using basically a loop and your stdlib's hash functions. Scrypt takes the whole concept of placing extra demands on the computer and applies it to the RAM rather than the CPU (perhaps as well as?,) the idea being that RAM is harder to accumulate in obscene quantities than CPU power.
- nknighthb 13y agoWhich is why passwords just shouldn't be stored with simple hash functions. Even a naïve salt+iteration method would have drastically slowed the attack.
- jacques_chester 13y agoRight. Using MD5 hashes was done as a relaxing constraint -- at the other end, the attackers had tightened constraints by getting limited time and computing power. The goal was to show how attackers work and think.
- jevin 13y agoThat's why the Blowfish algorithm is the best choice for password hashing. The algorithm uses CPU cycles to generate the hash. So there is no way to speed it up, just by using a faster computer.
- _ikke_ 13y agoA faster computer does speed it up. It can go through all the cycles faster. An even better option is scrypt, which is memory based, which is much harder to scale.
- mturmon 13y agoRight. The dialog with the crackers, showing how they use Markov chains, recombination of already-found passwords, and other adaptive techniques was new to me. They were able to turn up lots of seemingly obscure passwords very fast. Basically, the strength of passwords can look really good on paper (96^12 possibilities or whatever), but in practice the entropy is much less: individual characters are not as independent as we'd like to think, and your clever word or phrase may be in a dictionary already (or may be a short Levenstein distance from something in a dictionary).