Question

Given a message, the expected workload of finding a message that hashes to that value is of the order ____________

(a) 2^(n/2)

(b) 2^(n-1)

(c) 2^(n)

(d) 2^(2n)

I had been asked this question during an online exam.

Asked question is from Whirlpool Algorithm topic in division Message Authentication Codes, Whirlpool Algorithm and Key Management and Distribution of Cryptograph & Network Security

Answer 1

Right answer is (c) 2^(n)

To explain I would say: The expected workload would be 2^n in such a case.