MD5

[Quik]

No, because you need to be able to control both things.

So just with that, you couldn't put that in an existing program, give it a dictionary, and have it hash every one of those entries to find a match? ;)

[iago]

You would need to look up more on the vulnerability, but I'm pretty sure that if you hash the dictionary every one of them will be unique.  The problem comes with longer documents, not short words.

But you'd have to look up more details to be sure.  I don't know exactly how it works.

[Blaze]

That was the magic word iago. :)

[Quik]

Yes, but if the hash that you're trying to match is part of your "dictionary", then you would theoretically be able to find the word. That's all I'm saying. Usually, brute force attacks don't require collisions.

[Sidoh]

Yeah. If the password's good, though, you'd have to have a password list of more than just the dictionary.

[Lenny]

is used to thwart dictionary attacks.

[Warrior]

Salt...smooth.