1.

Given a message and its n-bit hash result, the expected workload of finding a message that hashes to the same value is of the order _______________

A. 2<sup>(n/2)</sup>
B. 2<sup>(n-1)</sup>
C. 2<sup>(n)</sup>
D. 2<sup>(2n)</sup>
Answer» D. 2<sup>(2n)</sup>


Discussion

No Comment Found