ABSTRACT
Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH* (Multilinear Modular Hashing) is a well-known universal hash function family. In Chapter 4, we connect restricted linear congruences to universal hash functions which is a novel idea and could be also of independent interest. We introduce generalizations/variants of MMH* and, using the restricted congruences studied in Chapter 3, investigate their universality. Finally, as an application of our results, we propose an authentication code with secrecy scheme.
