On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes

DOI10.1142/S0129054118500089zbMath1391.94730arXiv1507.02331OpenAlexW3106407125WikidataQ129867863 ScholiaQ129867863MaRDI QIDQ4640336

Venkatesh Srinivasan, László Tóth, Khodakhast Bibak, Bruce M. Kapron

Publication date: 17 May 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

universal hashingrestricted linear congruenceauthentication code with secrecy

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

MMH* with arbitrary modulus is always almost-universal, Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT, Restricted linear congruences, Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes, The Modular Subset-Sum Problem and the size of deletion correcting codes, On the number of solutions of a restricted linear congruence, Order-restricted linear congruences, On a restricted linear congruence, A generalization of Schönemann's theorem via a graph theoretic method, A formula for the number of solutions of a restricted linear congruence

Uses Software

• MMH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• MMH* with arbitrary modulus is always almost-universal
• Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT
• Restricted linear congruences
• On the addition of units and nonunits mod \(m\)
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• Adding generators in cyclic groups
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Enumeration of unrooted maps of a given genus
• On the number of distinguished representations of a group element
• On a restricted linear congruence
• Some Remarks on a Paper of V. A. Liskovets
• The power of primes: security of authentication based on a universal hash-function family
• Combinatorial Designs for Authentication and Secrecy Codes
• On the sumset of atoms in cyclic groups
• A CLASS OF ARITHMETICAL FUNCTIONS
• A Finite Analogue of the Goldbach Problem
• General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel
• A Multivariate Arithmetic Function of Combinatorial and Topological Significance
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• Uniform Hashing in Constant Time and Optimal Space
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Communication Theory of Secrecy Systems*
• A Pseudorandom Generator from any One-way Function
• Codes Which Detect Deception
• MMH: Software message authentication in the Gbit/second rates
• On Universal Classes of Extremely Random Constant-Time Hash Functions
• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Progress in Cryptology - INDOCRYPT 2004
• A VON STERNECK ARITHMETICAL FUNCTION AND RESTRICTED PARTITIONS WITH RESPECT TO A MODULUS