MMH: Software message authentication in the Gbit/second rates

DOI10.1007/BFb0052345zbMath1385.94039MaRDI QIDQ4639339

Hugo Krawczyk, Shai Halevi

Publication date: 9 May 2018

Published in: Fast Software Encryption (Search for Journal in Brave)

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Related-Key Almost Universal Hash Functions: Definitions, Constructions and Applications, On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes, Об одном семействе универсальных функций хеширования, On Efficient Message Authentication Via Block Cipher Design Techniques, MMH, MMH* with arbitrary modulus is always almost-universal, A new multi-linear universal hash family, Variationally universal hashing, On weak keys and forgery attacks against polynomial-based MAC schemes, Optimal forgeries against polynomial-based MACs and GCM, On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers, Tweakable enciphering schemes using only the encryption function of a block cipher, Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector, Revisiting construction of online cipher in hash-ECB-hash structure, Connecting tweakable and multi-key blockcipher security, A trade-off between collision probability and key size in universal hashing using polynomials, EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC, Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal, Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• Universal hashing and authentication codes
• Keying Hash Functions for Message Authentication
• Universal Hashing and Multiple Authentication
• Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
• Fast Hashing on the Pentium
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Fast message authentication using efficient polynomial evaluation