a program to delete duplicate files
pu.news.001 at gmail.com
Mon Mar 14 20:20:45 CET 2005
David Eppstein wrote:
> When I've been talking about hashes, I've been assuming very strong
> cryptographic hashes, good enough that you can trust equal results to
> really be equal without having to verify by a comparison.
I am not an expert in this field. All I know is that MD5 and SHA1 can
create collisions. Are there stronger algorithms that do not? And, more
importantly, has it been *proved* that they do not?
More information about the Python-list