Variations on the birthday problem come up frequently (for example, in seeding random number generators). Importantly for this post, the birthday problem comes up in attacking hash functions. When Nis large, it is likely that hashing √Nvalues will lead to a collision. We prove this below. Proof The proof below is a little informal.

For More Information Please Refer:

You May Also Like to Read: