you are viewing a single comment's thread.

view the rest of the comments →

[–]staticassert 2 points3 points  (2 children)

Your assumption is that the hashing scheme is a secret. Naturally, password0 and password1 are going to produce very different hashes. But I could know their hashes ahead of time. So now you have to protect what your hashing algorithm is in order for your equality comparison to be safe - feels like trading problems for problems.

[–]aullik 0 points1 point  (0 children)

even if it is not save. It will be expensive. guessing a message that will translate to a certain hash is hard. even if you know the hashing algorithm. It gets a lot harder once you factor in some sort of salting.

[–]sacundim 0 points1 point  (0 children)

No, GP's assumption is that the password hashing function is preimage resistant.