For an m bit hash value, if we pick data blocks at random we can expect to find two data blocks with the same hash value within ____ attempts.
For an m bit hash value, if we pick data blocks at random we can expect to find two data blocks with the same hash value within ____ attempts. Correct Answer 2(m/2)
This is known as the birthday paradox. If we choose random variables from a uniform distribution in the range 0 through N-1, then the probability that a repeated element is encountered exceeds 0.5 after root (N) choices have been made.
মোঃ আরিফুল ইসলাম
Feb 20, 2025