A universal class of hash functions Assumptions: |U| = p (p prime) and |U| = {0, …, p-1} Let a  {1, …, p-1}, b  {0, …, p-1} and h a,b : U  {0,…,m-1} be defined as follows h a,b = ((ax+b) mod p) mod m Then: The set H = {h a,b | 1 ≤ a ≤ p, 0 ≤ b ≤ p} is a universal class of hash functions.
{}