New Bounds for PMAC, TMAC, and XCBC

DOI10.1007/978-3-540-74619-5_27zbMATH Open1186.94461OpenAlexW2120482377MaRDI QIDQ3524910FDOQ3524910

Authors: Kazuhiko Minematsu, Toshiyasu Matsushima 

Publication date: 16 September 2008

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74619-5_27

Recommendations

• Progress in Cryptology - INDOCRYPT 2003
• Towards tight security bounds for \textsf{OMAC, XCBC} and \textsf{TMAC}
• PMAC with parity: minimizing the query-length influence
• Improved security analysis of PMAC
• A new variant of PMAC: beyond the birthday bound

Mathematics Subject Classification ID

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

Cited In (12)

• The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
• Fine-tuning the ISO/IEC standard \textsf{LightMAC}
• PMAC with parity: minimizing the query-length influence
• Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
• Improved security analysis for OMAC as a pseudorandom function
• Improved security analysis of PMAC
• A Tight Bound for EMAC
• Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication
• Progress in Cryptology - INDOCRYPT 2003
• The security of the IAPM and IACBC modes
• On the influence of message length in PMAC's security bounds
• Revisiting structure graphs: applications to CBC-MAC and EMAC

This page was built for publication: New Bounds for PMAC, TMAC, and XCBC

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