Variants of Wegman-Carter message authentication code supporting variable tag lengths
From MaRDI portal
Publication:831162
DOI10.1007/s10623-020-00840-wzbMath1462.94036OpenAlexW3126777117MaRDI QIDQ831162
Publication date: 10 May 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-020-00840-w
Uses Software
Cites Work
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Optimal forgeries against polynomial-based MACs and GCM
- Bernstein bound on WCS is tight -- repairing Luykx-Preneel optimal forgeries
- Faster Binary-Field Multiplication and Faster Binary-Field MACs
- SipHash: A Fast Short-Input PRF
- Authenticated Encryption with Variable Stretch
- The Software Performance of Authenticated-Encryption Modes
- On Fast and Provably Secure Message Authentication Based on Universal Hashing
- On the Security of IV Dependent Stream Ciphers
- Codes Which Detect Deception
- Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
- Fast Software Encryption
- A New Algorithm for Inner Product
- Progress in Cryptology - INDOCRYPT 2004
- Economically Optimal Variable Tag Length Message Authentication
- Information Security and Cryptology