Question

am sorry for this question, but i was asking: when using MD5, we get a hash, so to get the password we hash all the words untill we find the same hash.

but in a key derivation algorithme such pbkdf2 or bcrypt or scrypt, what a hacker need to seek? or he will make the same algorithme to all words to get the same key derivation?

am sorry for this dumb question.

Was it helpful?

Solution

It’s the same general idea - try all the hashes - but several thousand (or million, or even billion) times slower.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top