| | |
Md5 Question
Thread Solved |
•
•
Join Date: May 2008
Posts: 113
Reputation:
Solved Threads: 4
A friend of mine an i were wondering the following
If there is really a one in 20 million chance of and two files having the same MD5 hash
in theory, would it not be possible to recreate a file from the MD5 hash itself?
I understand the time involved in doing this through the "rainbow tables" method, not to mention the processing power.
but with new processors coming out with 8 cores or so....
you see where this is going...
If there is really a one in 20 million chance of and two files having the same MD5 hash
in theory, would it not be possible to recreate a file from the MD5 hash itself?
I understand the time involved in doing this through the "rainbow tables" method, not to mention the processing power.
but with new processors coming out with 8 cores or so....
you see where this is going...
Do you geek alone?
<<TimmCo>> Custom Computers
~Executive
<<TimmCo>> Custom Computers
~Executive
its not possible though
thats not what a hash is. A hash is a totally arbitrary thing, its meaningless without a context with which to apply it to.
if we are going to be really technical, an MD5Sum isnt a type of hash at all, its a checksum, but the same thinking applies
thats not what a hash is. A hash is a totally arbitrary thing, its meaningless without a context with which to apply it to.
if we are going to be really technical, an MD5Sum isnt a type of hash at all, its a checksum, but the same thinking applies
Last edited by jbennet; Mar 30th, 2009 at 11:41 pm.
If i am helpful, please give me reputation points.
no hashes have a completely different meaning when used in the context of databases
http://en.wikipedia.org/wiki/Hash_function
The first few paragraphs of this explain it
http://en.wikipedia.org/wiki/Hash_function
The first few paragraphs of this explain it
If i am helpful, please give me reputation points.
•
•
Join Date: Mar 2009
Posts: 139
Reputation:
Solved Threads: 12
The differences explained there are a pedantic wikipedian classification system. Hashes, checksums, and cryptographic hashes are all the same thing and are all designed for the same general purpose. The only difference between a "good hash function" and a "good checksum function" and such is that different traits are valued more intensely.
![]() |
Similar Threads
- Hacking Question? (IT Professionals' Lounge)
- another question about securing and passing variables (PHP)
- Login question php?? (PHP)
- Question about crypt function (PHP)
- newbie question (PHP)
- question about connecting odbc to sql through php script (PHP)
Other Threads in the IT Professionals' Lounge Forum
- Previous Thread: Tips/ideas
- Next Thread: REQ: Beta Tester for "Live Cricket" Desktop Gadget
| Thread Tools | Search this Thread |
1gbit advertising advice amazon answers archive british broadband business businessprocesses career carrier censorship cern china cio collectiveintelligence connectivity consumer consumers corporateearnings datatransfer debtcollectors dictionary digg digital ebay ecommerce email employment environment facebook food government grid high-definition hottub infodelivery infotech intel internet interview ipod isp japan kindle lhc library malware marketing mit moonfruit news onlineshopping piracy piratebay pope porn program questions r&d religion remoteworking research retail security sex shopping simple skype smallbusiness smb sms socialmedia socialnetworking software softwareengineer spam speed spending startrek statistics stocks study stumbleupon survey tabletpc technology touch-screen touchscreen twitter uk videoinprint voips web webdeveloper windows words






