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
Get step-by-step solutions from verified subject matter experts
