Question

This problem will test your skills of universal hash family. suppose that m = {0, 1} k and n = {0, 1} ` . let m = {0, 1} k×` denote the space of boolean matrices with k rows and ` columns. for any x ∈ m and a ∈ m, define ha(x) = x · a mod 2 note that x · a ∈ n, and x · a mod 2 means we perform arithmetic modulo 2 at each of its entry.

a. if x 6= y, what is pa∈rm (ha(x) = ha(y)) ?

b. using (a), design a universal hash family.

c. how many bits are required to store a hash function from the hash family described in (b)? compare it with the no. of bits required by the hash function from the universal hash family based on prime numbers discussed in the class.

Answer 1

ur question is big dude it is a complex answer................................................ i dont have time for such a big answer