Question: 10. Consider an algorithm SHA which takes any length input and produces a fixed 160 bit output (called hash) Find all possible operations required to

10. Consider an algorithm SHA which takes any length input and produces a fixed 160 bit output (called hash) Find all possible operations required to find a collision (2 same value output for different input). Also find out what is minimum number of operation 5 pts required to get a 50% probability that a collision will happen. 10. Consider an algorithm SHA which takes any length input and produces a fixed 160 bit output (called hash) Find all possible operations required to find a collision (2 same value output for different input). Also find out what is minimum number of operation 5 pts required to get a 50% probability that a collision will happen
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
