Question

SHA-1 gives 160-bit secure hash. Let's assume that a successful brute force attack is possible by trying 2^(160/3) combinations. If we do a double hash (as is done in Encase tool for forensics), the input is the secure hash of the message and the output is also another secure hash. Comparing this with SHA-2 using 256 bits, we can say:
A) SHA-256 is stronger because it requires 2^(256/3) brute force combinations, while SHA-1 still needs 2^(160/3) combinations.
B) double SHA-1 is stronger because it requires twice the 2^(160/3) combinations.
C) double SHA-1 is stronger because it requires about 2^(160/3) X 2^(160/3) maximum combinations because for each broken first stage, there are 2^(160/3) brute force attempts may be needed.
D) they are roughly equal and there was no need for the 256 version.

Answer 1

Answer:

C) double SHA-1 is stronger because it requires about 2^(160/3) X 2^(160/3) maximum combinations because for each broken first stage, there are 2^(160/3) brute force attempts may be needed.

Explanation:

Double SHA will require about 2^(160/3) X 2^(160/3). for each statage we need to check the 2^(160/3) combinations means it will take lot of time.