The Exponential Modulus Theorem
指数模定理(英文)

Computation of exponential modula when using hashing functions such as Karp-Rabin fingerprints can be quite cumbersome especially when the alphabet size is large. In this paper, we show an interesting result which can allow this com-putation to be done in a very simple and efficient manner.