FAQ
overflow
Great Answers to
Questions About Everything
Best Way to Reduce Chance of Hash collisions: Multiple Hashes, or Larger Hash?
Is It Fair to Assume That SHA1 Collisions Won't Occur on a Set of < 100k Strings
Can There Be Two Hash Functions without Common Collisions?
Are There Any Known Collisions for the SHA-2 Family of Hash Functions?
Is SHA-1 Still Practical Secure under Specific Scenarios?
Is It Theoretically Possible to Construct a String That Contain Its Own Hash Value?
Is the Number of Creatable Torrents Limited?
Why Would You Expect to Find a Collision in a Hash Function after Approximately $\sqrt{n}$ Hashes?
Tunnels Used in Md5
Can the XOR of Two Non-Collision-Resistant Hashes Be Collision Resistant?