New Bounds for PMAC, TMAC, and XCBC

DOI10.1007/978-3-540-74619-5_27zbMath1186.94461OpenAlexW2120482377MaRDI QIDQ3524910

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

Mathematics Subject Classification ID

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

Related Items (8)

PMAC with Parity: Minimizing the Query-Length Influence ⋮ The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC ⋮ Improved security analysis for OMAC as a pseudorandom function ⋮ Revisiting structure graphs: applications to CBC-MAC and EMAC ⋮ Fine-tuning the ISO/IEC standard \textsf{LightMAC} ⋮ Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption ⋮ Improved security analysis of PMAC ⋮ Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication

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