Abstract

Rabin's fingerprinting scheme is based on arithmetic modulo an irreducible polynomial with coefficients in Z 2 . This paper presents an implementation and several applications of this scheme that take considerable advantage of its algebraic properties. 1 Introduction Fingerprints are short tags for larger objects. They have the property that if two fingerprints are different then the corresponding objects are certainly different and there is only a small probability that two different objects have the same fingerprint. (The latter event is called a collision.) More precisely, a fingerprinting scheme is a certain collection of functions F = n f :\Omega ! f0; 1g k o , where\Omega is the set of all possible objects of interest and k is the length of the fingerprint, such that, for any choice of a fixed set S ae\Omega of n distinct objects, if f is chosen uniformly at random in F , then with high probability jf(S)j = jSj : In other words, if an adversary chooses a set S ae\Ome...

Citations

590	Universal classes of hash functions - Carter, Wegman - 1979
257	Efficient randomized pattern matching algorithms - Karp, Rabin - 1987
175	Fingerprinting by random polynomials - Rabin - 1981
73	Probabilistic algorithms in finite fields - Rabin - 1980
13	Discovering Repetitions in Strings - Rabin - 1984