A combinatorial characterization of certain universal classes of hash functions
From MaRDI portal
Publication:4764653
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
Cited in
(14)- On the relationships between perfect nonlinear functions and universal hash families
- Cryptographic hash functions from sequences of lifted Paley graphs
- 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
- Analysis of families of hash functions defined by automata over a finite ring
- A caution on universal classes of hash functions
- scientific article; zbMATH DE number 1874366 (Why is no real title available?)
- Hash functions and Cayley graphs
- Universal hashing and authentication codes
- Combinatorial techniques for universal hashing
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)
