A Tight Bound for EMAC

DOI10.1007/11787006_15MaRDI QIDQ3591444zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• New Bounds for PMAC, TMAC, and XCBC
• scientific article; zbMATH DE number 1950616
• A Macsyma implementation of Zeilberger's fast algorithm
• A tighter bound for FFd algorithm
• Tight bound for matching
• Tight bounds for capacities
• Badger – A Fast and Provably Secure MAC
• A MAC SCHEME IN BOUNDARY-FITTED CURVILINEAR COORDINATES

Cited in

(9)

• Optimal forgeries against polynomial-based MACs and GCM
• Improved security analysis for OMAC as a pseudorandom function
• The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
• Revisiting structure graphs: applications to CBC-MAC and EMAC
• A MAC mode for lightweight block ciphers
• Improved Security Analyses for CBC MACs
• A New Mode of Operation for Block Ciphers and Length-Preserving MACs
• Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC}
• Toward full n-bit security and nonce misuse resistance of block cipher-based MACs

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

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