4 ms·
No, because all hashing algorithms suffer from collisions. A perfect hash function for files would require space of at least a number of bits proportional to th
by mfukar 16y ago
No, because all hashing algorithms suffer from collisions. A perfect hash function for files would require space of at least a number of bits proportional to the size of your problem space.
In practice, you can go with SHA-2, for which no collisions have been found yet.