UMAC: Fast and secure message authentication

Recommendations

MMH: Software message authentication in the Gbit/second rates
Message Authentication on 64-Bit Architectures
SQUARE HASH: Fast message authentication via optimized universal hash functions
scientific article; zbMATH DE number 2086719
XOR MACs: New methods for message authentication using finite pseudorandom functions

Cited in

(61)

Encryption modes with almost free message integrity
Authenticated encryption: relations among notions and analysis of the generic composition paradigm
Optimal forgeries against polynomial-based MACs and GCM
Message authentication based on cryptographically secure CRC without polynomial irreducibility test
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
Incremental cryptography revisited: PRFs, nonces and modular design
Rotational cryptanalysis on MAC algorithm chaskey
A trade-off between collision probability and key size in universal hashing using polynomials
Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
One-key compression function based MAC with security beyond birthday bound
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
\(\Gamma\)-MAC\([H,P]\) -- a new universal MAC scheme
On weak keys and forgery attacks against polynomial-based MAC schemes
Integrity Analysis of Authenticated Encryption Based on Stream Ciphers
Concealment and its applications to authenticated encryption
The software performance of authenticated-encryption modes
Bug attacks
A new authenticated encryption mode for arbitrary block cipher based on universal hash function
CBCR: CBC MAC with rotating transformations
A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
Badger – A Fast and Provably Secure MAC
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
Bug Attacks
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
Good Variants of HB + Are Hard to Find
A new multi-linear universal hash family
A fast cryptographic checksum algorithm based on stream ciphers
scientific article; zbMATH DE number 1951622 (Why is no real title available?)
scientific article; zbMATH DE number 1962142 (Why is no real title available?)
Tweakable block ciphers
MMH: Software message authentication in the Gbit/second rates
Fast message authentication using efficient polynomial evaluation
RIV for robust authenticated encryption
Related-key almost universal hash functions: definitions, constructions and applications
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
Artificial Intelligence and Soft Computing - ICAISC 2004
scientific article; zbMATH DE number 2085215 (Why is no real title available?)
Incremental authentication of tree-structured documents
On a family of universal hash functions
On Efficient Message Authentication Via Block Cipher Design Techniques
Parallelizable Authentication Trees
Advances in Cryptology - CRYPTO 2003
Message Authentication on 64-Bit Architectures
Fast Software Encryption
The security of the cipher block chaining message authentication code
On the security aspects of protocol CRISP
Multimixer-156: universal keyed hashing based on integer multiplication and cyclic shift
Mystrium: wide block encryption efficient on entry-level processors
Committing security of AEAD based on stream cipher
Almost pairwise independence and resilience to deep learning attacks
Committing security analysis of SMAC
\textsf{MSX}: lightweight block ciphers for microcontrollers with high-assurance against differential and linear attacks
Variants of Wegman-Carter message authentication code supporting variable tag lengths
HalftimeHash: modern hashing without 64-bit multipliers or finite fields
Variationally universal hashing
On weak keys and forgery attacks against polynomial-based MAC schemes
New proofs for NMAC and HMAC: security without collision resistance
Refined quorum systems

This page was built for publication: UMAC: Fast and secure message authentication

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