On Thu, 6 Jul 2006, Philip Guenther wrote:
On 7/4/06, Chet Uber <[EMAIL PROTECTED]> wrote:
...
The reason I had said anything is
that when I do forensic work I used to just do MD5's of files, but it
has gotten called to task in court so we now use both MD5 and SHA1
hashes as it is NP-complete to find a collision in both of them for
the same file.
Finding collisions for both MD5 and SHA-1 together is actually
NP-complete and not just NP? That's an significant result that would
affect the design of protocols using hashes. Do you have a citation
for that?
I would be interested in a proof for that as well, esp if this was true
for _all_ collisions.
++mbk
