论文标题
MMH*具有任意模量总是几乎是宇宙
MMH* with arbitrary modulus is always almost-universal
论文作者
论文摘要
Carter和Wegman于1979年发现的通用哈希功能在具有许多应用的计算机科学中非常重要。 MMH $^*$是众所周知的$ \ triangle $ -Universal Hash函数家族，基于对DOT产品模型的评估。在本文中，我们介绍了MMH $^*$的概括，我们称之为Gmmh $^*$，使用与Mmh $^*$相同的结构，但使用任意的Integer Modulus $ n> 1 $，并表明Gmmh $^*$ is $ \ frac {1}} {1}} {p} $ - 几乎 - $ - $ - $ \ trian $ $ nmy $ n $ n $ n $ n $ n $ n $ n，这个界限很紧。
Universal hash functions, discovered by Carter and Wegman in 1979, are of great importance in computer science with many applications. MMH$^*$ is a well-known $\triangle$-universal hash function family, based on the evaluation of a dot product modulo a prime. In this paper, we introduce a generalization of MMH$^*$, that we call GMMH$^*$, using the same construction as MMH$^*$ but with an arbitrary integer modulus $n>1$, and show that GMMH$^*$ is $\frac{1}{p}$-almost-$\triangle$-universal, where $p$ is the smallest prime divisor of $n$. This bound is tight.
