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

page 1

page 2

page 3

page 4

research
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...
research
06/07/2023

ε-Almost collision-flat universal hash functions and mosaics of designs

We introduce, motivate and study ε-almost collision-flat (ACFU) universa...
research
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...
research
08/20/2018

PPP-Completeness with Connections to Cryptography

Polynomial Pigeonhole Principle (PPP) is an important subclass of TFNP w...
research
01/27/2021

A Note on the Representation Power of GHHs

In this note we prove a sharp lower bound on the necessary number of nes...
research
08/02/2023

Skolem Meets Bateman-Horn

The Skolem Problem asks to determine whether a given integer linear recu...
research
06/26/2019

Universal Litmus Patterns: Revealing Backdoor Attacks in CNNs

The unprecedented success of deep neural networks in various application...

Please sign up or login with your details

Forgot password? Click here to reset