MMH* with arbitrary modulus is always almost-universal

10/12/2020
by   Khodakhast Bibak, et al.
0

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 -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 1/p-almost--universal, where p is the smallest prime divisor of n. This bound is tight.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/19/2020

The Power of Hashing with Mersenne Primes

The classic way of computing a k-universal hash function is to use a ran...
06/23/2020

A Note on the Cross-Correlation of Costas Permutations

We build on the work of Drakakis et al. (2011) on the maximal cross-corr...
04/30/2020

Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice

Given a CNF formula F on n variables, the problem of model counting or #...
08/20/2018

PPP-Completeness with Connections to Cryptography

Polynomial Pigeonhole Principle (PPP) is an important subclass of TFNP w...
08/31/2021

Upper bounds on the length function for covering codes

The length function ℓ_q(r,R) is the smallest length of a q-ary linear co...
01/29/2001

The Generalized Universal Law of Generalization

It has been argued by Shepard that there is a robust psychological law t...
03/14/2019

Keyed hash function from large girth expander graphs

In this paper we present an algorithm to compute keyed hash function (me...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.