Question: Given a cryptographic hash function h that outputs a 4 - bit hash value, a brute - force attack to find a second preimage needs

Given a cryptographic hash function h that outputs a 4-bit hash value, a brute-force attack to find a second preimage needs to evaluate the hash function on average about X times. And a brute-force attack to find a collision needs to evaluate the hash function on average about Y times. What are X and Y?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!