Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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.
It’s the same general idea – try all the hashes – but several thousand (or million, or even billion) times slower.