Question

The strength of a hash function against brute-force attacks depends solely on the length of the hash code produced by the algorithm. For a hash code of length n, the collision resistance is
(1) $2^{n}$
(2) $2^{n/2}$
(3) $2^{n/4}$
(4) $n^{2}$

Answer 1

Option 2.

Hope it helps you.

Plz mark me as the brainliest.

Answer 2

The strength of a hash function against brute-force attacks depends solely on the length of the hash code produced by the algorithm. For a hash code of length n, the collision resistance is?

n² is the answer