|
||||||
| Programming Theory Discuss programming theory, algorithm efficiency, logic, and other any other category where math and computer science overlap. |
![]() |
|
|
LinkBack | Thread Tools | Search this Thread | Display Modes |
|
|||||
|
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?
__________________
CodeCall Blog | CodeCall Wiki | Shareware | Linux Forum Chat with other CodeCall members on IRC; connect to irc.codecall.net and join #codecall ![]() Business Directory | Technology Blog | Windows Help |
| Sponsored Links |
|
|
|
|||||
|
Yes. It would mean you could determine the code/password from the hash value.
__________________
CodeCall Blog | CodeCall Wiki | Shareware Site | Linux Forum | Write a Blog Don't hesitate to ask any questions that you have! Check out our ASCII Calculator! |
|
|||||
|
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.
__________________
CodeCall Blog | CodeCall Wiki | Shareware | Linux Forum Chat with other CodeCall members on IRC; connect to irc.codecall.net and join #codecall |
|
|||||
|
So it would mean that the md5 will be a huge string?
__________________
CodeCall Blog | CodeCall Wiki | Shareware | Linux Forum Chat with other CodeCall members on IRC; connect to irc.codecall.net and join #codecall ![]() Business Directory | Technology Blog | Windows Help |
|
|||||
|
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.
__________________
CodeCall Blog | CodeCall Wiki | Shareware | Linux Forum Chat with other CodeCall members on IRC; connect to irc.codecall.net and join #codecall |
| Sponsored Links |
|
|
|
|||||
|
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"
__________________
CodeCall Blog | CodeCall Wiki | Shareware | Linux Forum Chat with other CodeCall members on IRC; connect to irc.codecall.net and join #codecall |
![]() |
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
| Thread Tools | Search this Thread |
| Display Modes | |
|
|