New bounds for PMAC, TMAC, and XCBC

Kazuhiko Minematsu*, Toshiyasu Matsushima

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Citations (Scopus)


We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were σ2/2n, where n is the block size in bits and σ is the total number of queried message blocks. Our new bounds are lq 2/2n for PMAC and lq2/2n + l 4q2/22n for TMAC and XCBC, where q is the number of queries and l is the maximum message length in n-bit blocks. This improves the previous results under most practical cases, e.g., when no message is exceptionally long compared to other messages.

Original languageEnglish
Title of host publicationFast Software Encryption - 14th International Workshop, FSE 2007
PublisherSpringer Verlag
Number of pages18
ISBN (Print)354074617X, 9783540746171
Publication statusPublished - 2007
Event14th International Workshop on Fast Software Encryption, FSE 2007 - Luxembourg, Luxembourg
Duration: 2007 Mar 262007 Mar 28

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4593 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Workshop on Fast Software Encryption, FSE 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'New bounds for PMAC, TMAC, and XCBC'. Together they form a unique fingerprint.

Cite this