Hi all,
I'm specially interested on finding a way to uniquely identify rather
small data chunks (less than or equal to 128*1024 bytes in size) without
using a byte per byte compare.
Is there any theoretical proof for a "good" selection of 2 HASH
(computing the results of two different algorithms on the same data)
that would annihilate the collision risk ?
Unfortunately, I'd guess that the answer could be "no", but among the
experts on this list, I hope to catch a solid proof, not only a guess.
NB: I've mentioned MD5 and SHA-1 in the subject, as they are the most
used nowadays, but if this association doesn't fit the need whereas
another does, that would be interesting anyway ;-)
--
Luc Perthuis, Team Leader, Backup and Restore Technologies
luc.perth...@atempo.com
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List openssl-users@openssl.org
Automated List Manager majord...@openssl.org
