On the security of iterated message authentication codes

DOI10.1109/18.746787zbMath0947.94016OpenAlexW2112006428MaRDI QIDQ4701253

Bart Preneel, Paul C. van Oorschot

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/698855f55cbd645b46dd5b2f205bc08ac27ea49d

zbMATH Keywords

securitycryptanalysiscollisionshash functionsiterated message authentication code

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (14)

Optimal forgeries against polynomial-based MACs and GCM ⋮ Impossible Differential Properties of Reduced Round Streebog ⋮ Open problems in hash function security ⋮ Keyed Streebog is a secure PRF and MAC ⋮ A new keyed hash function based on Latin squares and error-correcting codes to authenticate users in smart home environments ⋮ New proofs for NMAC and HMAC: security without collision resistance ⋮ Security of message authentication codes in the presence of key-dependent messages ⋮ A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier ⋮ Boosting Merkle-Damgård Hashing for Message Authentication ⋮ Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms ⋮ The power of primes: security of authentication based on a universal hash-function family ⋮ Multilane HMAC— Security beyond the Birthday Limit ⋮ An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier

This page was built for publication: On the security of iterated message authentication codes