Universal hashing

• Don’t use a fixed hash function; for every run choose a function from a small family.

• Example:

h(K) = (a*K + b) mod M

a and b chosen u.a.r. in [1..M] and M prime

• Main property

Pr(h(K1)=h(K2)) = 1/M

Previous slide

Next slide

Back to first slide

View graphic version