Tweet
Marco, the probability for collisions with MD5 is one in 2^64. Highly unlikely. We can, for the most part, assume that each hash identifies an unique object.
dreamer81, you cannot decrypt MD5. Why? Let me explain this to you with a simple analogy. Pretend I give you a number, like... 540341239. Let's say that's your hash. Now, can you tell me what parameters I put into a function to make that number? No. But, if I tell you the function, you can plug in any parameter in the world and arrive at your own number.
This is an example of a one-way hash function.
What you are doing is brute-forcing the hashes. You go through each and every combination of letters/numbers/etc. and compare the hashes until you arrive at one that matches. However, this is very impractical for you, since almost all applications of MD5 that involves protecting data (such as a password) uses salt values to randomize the MD5 each time. Salt values are not used when you're using MD5 to verify data. But in those cases, the length of the data is almost always longer than 5 or 7 or even 100 digits.
Now, if you had proclaimed that you could decrypt RSA, AES, or some other equivalent encryption algorithm (as opposed to a hashing algorithm) in a quick and low-resource way on an everyday desktop, then you might be on to something.
dreamer81, you cannot decrypt MD5. Why? Let me explain this to you with a simple analogy. Pretend I give you a number, like... 540341239. Let's say that's your hash. Now, can you tell me what parameters I put into a function to make that number? No. But, if I tell you the function, you can plug in any parameter in the world and arrive at your own number.
This is an example of a one-way hash function.
What you are doing is brute-forcing the hashes. You go through each and every combination of letters/numbers/etc. and compare the hashes until you arrive at one that matches. However, this is very impractical for you, since almost all applications of MD5 that involves protecting data (such as a password) uses salt values to randomize the MD5 each time. Salt values are not used when you're using MD5 to verify data. But in those cases, the length of the data is almost always longer than 5 or 7 or even 100 digits.
Now, if you had proclaimed that you could decrypt RSA, AES, or some other equivalent encryption algorithm (as opposed to a hashing algorithm) in a quick and low-resource way on an everyday desktop, then you might be on to something.
Comment