A combinatorial characterization of certain universal classes of hash functions

DOI10.1002/JCD.3180020306zbMATH Open0822.68073OpenAlexW2149228338MaRDI QIDQ4764653FDOQ4764653

Authors: Tran van Trung 

Publication date: 9 October 1995

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.3180020306

Recommendations

• On a family of universal hash functions
• Combinatorial techniques for universal hashing
• On Universal Classes of Extremely Random Constant-Time Hash Functions
• A composition theorem for universal one-way hash functions
• The computational complexity of universal hashing
• On the Minimum Number of Multiplications Necessary for Universal Hash Functions
• On the relationships between perfect nonlinear functions and universal hash families
• A caution on universal classes of hash functions
• scientific article; zbMATH DE number 1874366
• On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes

zbMATH Keywords

hash functionsStinson bound

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial aspects of block designs (05B05)

Cited In (14)

• On the relationships between perfect nonlinear functions and universal hash families
• On the Minimum Number of Multiplications Necessary for Universal Hash Functions
• A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\)
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
• Leftover Hash Lemma, Revisited
• The computational complexity of universal hashing
• $\varepsilon$-Almost collision-flat universal hash functions and mosaics of designs
• Title not available (Why is that?)
• Analysis of families of hash functions defined by automata over a finite ring
• A caution on universal classes of hash functions
• Hash functions and Cayley graphs
• Universal hashing and authentication codes
• Combinatorial techniques for universal hashing
• Cryptographic hash functions from sequences of lifted Paley graphs

This page was built for publication: A combinatorial characterization of certain universal classes of hash functions

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