Variationally universal hashing

DOI10.1016/J.IPL.2005.11.026zbMATH Open1185.68842OpenAlexW2116644346MaRDI QIDQ845822FDOQ845822

Authors: Ted Krovetz, Phillip Rogaway 

Publication date: 29 January 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.026

Recommendations

• Publication:4941908
• Tiny families of functions with random properties: A quality-size trade-off for hashing
• On a family of universal hash functions
• New Universal Hash Functions
• scientific article

zbMATH Keywords

randomized algorithmscryptographyuniversal hashinghashing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Randomized algorithms (68W20)

Cites Work

• MMH: Software message authentication in the Gbit/second rates
• Fast Software Encryption
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• Title not available (Why is that?)
• Universal hashing and authentication codes

Cited In (5)

• The universality of iterated hashing over variable-length strings
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• Tight Bounds for Hashing Block Sources
• Title not available (Why is that?)
• Global similarity preserving hashing

Uses Software

• MMH
• Poly1305-AES

This page was built for publication: Variationally universal hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845822)