Bloom Filter

• To query for existence of an entry x, compute H1(x), H2(x)…Hk(x) and check if the bits at the corresponding locations are 1

• If not, x is definitely not a member

• Otherwise there may be a false positive (passwords not in the dictionary but that produce a match in the hash table). The probability of a false positive can be reduced by choosing k and N