- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | New Bounds for PMAC, TMAC, and XCBC (in Japanese) |
|---|---|
| Authors | Kazuhiko Minematsu 、Toshiyasu Matsushima |
| Released Year | 2007 |
| Format | International Conference |
| Category | Information security |
| Jounal Name | Fast Software Encryption, 14th International Workshop, FSE 2007, Luxembourg, Luxembourg, March 26-28, 2007, Revised Selected Papers. Lecture Notes in Computer Science 4593 Springer 2007 |
| Jounal Page | pp. 434-451, Luxembourg, Luxembourg |
| Published Year | 2007 |
| Published Month | 3 |
| Abstract （English） |
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were $\sigma^2/2^{n}$, where $n$ is the block size in bits and $\sigma$ is the total number of queried message blocks. Our new bounds are $L q^2/2^{n}$ for PMAC and $L q^2/2^{n} + L^{4}q^{2}/2^{2n}$ 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. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
