On Efficient Message Authentication Via Block Cipher Design Techniques
From MaRDI portal
Recommendations
Cites work
- A block-cipher mode of operation for parallelizable message authentication
- Authenticated encryption: Relations among notions and analysis of the generic composition paradigm
- Authentication Theory/Coding Theory
- Bucket hashing and its application to fast message authentication
- CBC MAC for real-time data sources
- CBC MACs for arbitrary-length messages: The three-key constructions
- Codes Which Detect Deception
- Decorrelation over infinite domains: The encrypted CBC-MAC case
- Differential cryptanalysis of DES-like cryptosystems
- Fast message authentication using efficient polynomial evaluation
- Fast Software Encryption
- Fast Software Encryption
- Fast universal hashing with small keys and no preprocessing: The PolyR construction.
- scientific article; zbMATH DE number 5991351 (Why is no real title available?)
- Improving the upper bound on the maximum average linear hull probability for Rijndael
- Improving the upper bound on the maximum differential and the maximum linear hull probability for SPN structures and AES.
- Keying hash functions for message authentication
- LFSR-based hashing and authentication
- MDx-MAC and building fast MACs from hash functions
- MMH: Software message authentication in the Gbit/second rates
- New hash functions and their use in authentication and set equality
- New method for upper bounding the maximum average linear hull probability for SPNs
- New proofs for NMAC and HMAC: security without collision resistance
- New structure of block ciphers with provable security against differential and linear cryptanalysis
- OMAC: one-key CBC MAC.
- On families of hash functions via geometric codes and concatenation
- On the security of randomized CBC-MAC beyond the birthday paradox limit: A new construction
- On the security of Rijndael-like structures against differential and linear cryptanalysis
- On the security of two MAC algorithms
- Provable security against differential and linear cryptanalysis for the SPN structure
- Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
- Related-key cryptoanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA
- SQUARE HASH: Fast message authentication via optimized universal hash functions
- Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
- TMAC: Two-key CBC MAC
- Topics in Cryptology – CT-RSA 2006
- UMAC: Fast and secure message authentication
- Universal hashing and authentication codes
Cited in
(3)
This page was built for publication: On Efficient Message Authentication Via Block Cipher Design Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387102)