3 ms·
I'm indifferent about name, but size has been shown to provide additional security. Generating two files where their hashes collide is extremely difficult. Gen
by Someone1234 11y ago
I'm indifferent about name, but size has been shown to provide additional security.
Generating two files where their hashes collide is extremely difficult. Generating two files where their hashes collide at the same size is near impossible, even after you break the hash function itself (e.g. with MD5 it requires much more compute power to generate two files with matching hashes and sizes than just hashes alone, since you're effectively looking for a subset of all collisions).
- sbierwagen 11y agoI feel like you're just effectively adding more bits to the hash length by appending the resource size; bits that might be better used by just adding more length to the hash.
- AgentME 11y agoAll MD5 hash collisions I've seen have been the same length: http://stackoverflow.com/questions/1224113/examples-of-hash-collisions http://stackoverflow.com/questions/1224113/examples-of-hash-.... I assume the common algorithm for making MD5 collisions requires you to start with a single value and mutate it in specific ways, while keeping the same length.