A Universal Hash Function

Let's assume 20 bit keys, so , about a million.

Further, assume m = 97 (a prime), and chaining for collision resolution.

Break the key x into 5 blocks of 4 bits each ( is the number represented by the bits in the ith block of x).

Before beginning, pick (randomly uniformly) a multiplier for each block .