What is the birthday paradox's significance in evaluating collision resistance of a hash function with an n-bit output?
-
A
A collision can be found with approximately 2^n operations
-
B
A collision can be found with approximately 2^(n/2) operations due to probabilistic birthday math
-
C
The function is collision-free up to 2^n/4 operations
-
D
Birthday attacks only apply to preimage resistance, not collisions