6 replies to this topic

[TcM]

If md5 was not one way.. would that mean that if we take the md5 of a file and then reverse it.. would that mean that the file will be regenerated?

[WingedPanther]

It would also mean that MD5 hashes would generally be a similar size to the file. That would make it very impractical for quick checks against changes.

[TcM]

So it would mean that the md5 will be a huge string?

[WingedPanther]

Exactly. Think of it this way: if you have 2 million different strings, and the "hash" is to be reversible, then they have to "hash" to 2 million different strings. Now think 2 billion, or 2 trillion. Eventually, your "hash" has to be able to grow.

[Crane]

How does a hash work? I mean, what algorithm is it that prevents it from being decoded? The same password must be entered to create the same hash, correct? So why is it not possible to reverse that using the same code????

[WingedPanther]

What a hash does is crunch all the data down to a fixed length result string. A fairly simple hash would be to take a string, separate it out into 8 character substrings (padding the final substring up to 8 characters if needed), and then doing a bitwise xor on the substrings.
With a hash like that (we'll call it WP8 hash), the following strings would all have the same hash:
"aaaaaaaabbbbbbbb"
"ababababbabababa"
"aabbaabbbbaabbaa"
because in each case, you are doing an xor on "a" and "b"