How to swindle Rabin. Cryptologia (3), 1979, 187-190. A Proof of Theorem 4.3 We will establish a somewhat stronger result, namely: Lemma A.1 Let h: D ! R be a hash function. Let d = jDj and r = jRj and assume d > r 2. Let Q denote the expected number of (0)

by G Yuval