Birthday Paradox


The Birthday Paradox program allows users to find Java hashCode() collisions using a brute force algorithm. This program demonstrates the efficiency of finding hash function collisions using brute force. Although brute force works for finding Java hashCode() collisions, brute force is too slow to find collisions for hash functions with larger outputs. For example, SHA-256 has a 256 bit output. Java's hashCode() method has a 32 bit output.