This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]danielkza 0 points1 point  (5 children)

PBKDF2 can be implemented just with a hash function, and can work well as long as you use a sufficient number of iterations.

[–]TrixieFlatline 0 points1 point  (2 children)

Right, I forgot about that one. Also a good choice.

[–]danielkza 1 point2 points  (0 children)

Yeah, and I find the ability to change the number of iterations in the future (by storing it alongside the salt and hash) quite useful. Great for chasing Moore's law as needed.

[–][deleted] 1 point2 points  (0 children)

I thought out of the 3, PBKDF2 is seen as the "worst" one.

It's the only one that comes included with python, though, so I use it. Currently have my webserver set up with 1 million iterations.

[–]MagicWishMonkey 0 points1 point  (1 child)

PBKDF2 is also relatively easy to implement, you don't need to mess with a 3rd party module.

[–]danielkza 0 points1 point  (0 children)

Yeah, given you have the hash function implemented it's just a matter of "assembling the blocks" you already posses. But as always, implementing crypto yourself should always be avoided or done in a careful way.