Rabin Hash Functions - FAST Implementation in Java [closed]

Question

I am looking for an implementation of the Rabin Hash Function in Java, Can anyone recommend a fast library?

---

Update: I've just tested the library here.

It takes ~2200ms to hash 1mm random urls on my 2GHz processor.

This is certainly good enough for my needs, however I will test another library when I get a monent and post the results here.

Answer 1

Here's my Java implementation.

http://code.google.com/p/rabinfingerprint/

It also includes arbitrarily large irreducible polynomials (using BigIntegers).