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? Philip Guenther
