New bounds for PMAC, TMAC, and XCBC

Kazuhiko Minematsu*, Toshiyasu Matsushima

*この研究の対応する著者

研究成果: Conference contribution

22 被引用数 (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.

本文言語English
ホスト出版物のタイトルFast Software Encryption - 14th International Workshop, FSE 2007
出版社Springer Verlag
ページ434-451
ページ数18
ISBN(印刷版)354074617X, 9783540746171
DOI
出版ステータスPublished - 2007
イベント14th International Workshop on Fast Software Encryption, FSE 2007 - Luxembourg, Luxembourg
継続期間: 2007 3 262007 3 28

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4593 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference14th International Workshop on Fast Software Encryption, FSE 2007
国/地域Luxembourg
CityLuxembourg
Period07/3/2607/3/28

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「New bounds for PMAC, TMAC, and XCBC」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル