Variationally universal hashing

DOI10.1016/J.IPL.2005.11.026MaRDI QIDQ845822zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

randomized algorithmscryptographyuniversal hashinghashing

Mathematics Subject Classification ID

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

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 DE number 176541

Cites work

• scientific article; zbMATH DE number 1418297 (Why is no real title available?)
• Fast Software Encryption
• MMH: Software message authentication in the Gbit/second rates
• New hash functions and their use in authentication and set equality
• On fast and provably secure message authentication based on universal hashing
• Universal classes of hash functions
• Universal hashing and authentication codes

Cited in

(6)

• The universality of iterated hashing over variable-length strings
• $\varepsilon$-Almost collision-flat universal hash functions and mosaics of designs
• Tight Bounds for Hashing Block Sources
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• scientific article; zbMATH DE number 1676656 (Why is no real title available?)
• Global similarity preserving hashing

Describes a project that uses

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)