So I am working on a piece of code that computes the hashes of 2^4
sets of 3 random prime numbers (less than 2^8). Then keep selecting sets of 3 composite numbers (less than 2^8) until there is a set of {c1, c2, c3}
with a hash value that matches one of the previous hashes (the prime ones), that set would be known as {p1,p2,p3}
.
From my understanding the birthday attack is basically finding two functions that provide the same result. So I would create 2 functions? One for the prime numbers and then another for composite? What would the best way of doing this be? I am thinking PHP as the language.
Any help would be greatly appreciated.