A Tight Bound for EMAC

DOI10.1007/11787006_15zbMath1133.94334OpenAlexW1733151745WikidataQ56475234 ScholiaQ56475234MaRDI QIDQ3591444

Krzysztof Pietrzak

Publication date: 11 September 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11787006_15

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Revisiting structure graphs: applications to CBC-MAC and EMAC ⋮ Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC} ⋮ A MAC Mode for Lightweight Block Ciphers ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs

This page was built for publication: A Tight Bound for EMAC