Question: Let P be prime and let b be an integer which is not divisible by p. Let h(x) = b^2*x(mod p). Explain why h(x) is

Let P be prime and let b be an integer which is not divisible by p. Let h(x) = b^2*x(mod p). Explain why h(x) is not a good cryptographic hash function? (Hint: This can be accomplished by using Fermat's Little Theorem.)

someone answered this but Im still not really understanding how Fermat's theorem applies to the the hash function above.

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!