Wikepedia's table Comparison of SHA functions mentions "Security(bits)" for some SHA functions. From the ratio (Output size (bits): Security(bits)), I feel it is something like "collision resistance". So,

Should we only consider collision resistance as the Security of a hash function?

what does the Security in the table mean?

  • $\begingroup$ One of our top contributors uses exactly the same nick name as you. So it might be a good idea to change your name, to avoid confusion. $\endgroup$ – CodesInChaos Mar 6 '16 at 20:35

Security in the table refers to collision resistance. By the birthday problem, there's a generic attack that finds collisions in any compressing function by choosing $\sqrt{2^m}$ random inputs ($m/2$ security bits), where $m$ is the output length.

Depending on the application, weaker requirements might be sufficient, such as second pre-image resistance or even one-wayness. A generic attack against the two weaker notions requires about $2^m$ work ($m$ security bits).

| improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.