help please![5. (10 points) Universal Hashing. Recall that a distribution over functionsh U (0, , M-1) is universal if for every two different x, y E U, we have Prhe-llh (z) = h(y)] 1/M. Suppose the distribution of H is defined by the following hash function: ha(x) (a mod p) mod M where p is a (fixed) prime, M is a (fixed) integer such that p2 M, and a is drawn at random from { 1, ,p-1). Show that ha is not universal by counterexample.](../../../media.cheggcdn.com/media/b5b/b5b6e68d-a251-4e97-be09-672e148ceb10/image.png)
5. (10 points) Universal Hashing. Recall that a distribution over functionsh U (0,
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured
(Solved) : 5 10 Points Universal Hashing Recall Distribution Functionsh U 0 M 1 Universal Every Two D Q32903132 . . . .
Categories: