Abstract
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 1p-almost-△-universal, where p is the smallest prime divisor of n. This bound is tight.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
