Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

MMH* with arbitrary modulus is always almost-universal

From MaRDI portal
Publication:269733
Jump to:navigation, search

DOI10.1016/J.IPL.2016.03.009zbMath1353.94037arXiv2010.05420OpenAlexW2305266879MaRDI QIDQ269733

Venkatesh Srinivasan, Bruce M. Kapron, Khodakhast Bibak

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.05420


zbMATH Keywords

cryptographyGMMH*linear congruenceMMH*universal hashing


Mathematics Subject Classification ID

Cryptography (94A60) Congruences; primitive roots; residue systems (11A07)


Related Items (2)

Restricted linear congruences ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes


Uses Software

  • MMH



Cites Work

  • Restricted linear congruences
  • Universal classes of hash functions
  • Codes Which Detect Deception
  • MMH: Software message authentication in the Gbit/second rates
  • On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes




This page was built for publication: MMH* with arbitrary modulus is always almost-universal

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:269733&oldid=12154163"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki