Kizspy | Question: 44
(Choose 1 answer)
On average, against a 128-bit-long key, how many more hash computations would an attacker need to perform to break weak collision resistance compared to breaking strong collision resistance? In other words,if it requires x number of hash computations to break strong collision resistance, how many computations would it require to break the weak collision resistance
A. 2^127 x
B. 2^128 x
C. 2^64 x
D. 1x
E. 2^63 x
F. 2^256 x
