Question: We say that a hash function must have a digest of at least $ 2 n$ bits to achieve $n$ bits of security. What does
We say that a hash function must have a digest of at least $n$ bits to achieve $n$ bits of security. What does this mean? You could pretend you are explaining to a nontechnical client why SHA only has bits of security. You might refer in your answer to the security properties a hash function is supposed to have.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
