TY - GEN
T1 - New bounds for PMAC, TMAC, and XCBC
AU - Minematsu, Kazuhiko
AU - Matsushima, Toshiyasu
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38149006409&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149006409&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74619-5_27
DO - 10.1007/978-3-540-74619-5_27
M3 - Conference contribution
AN - SCOPUS:38149006409
SN - 354074617X
SN - 9783540746171
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 434
EP - 451
BT - Fast Software Encryption - 14th International Workshop, FSE 2007
PB - Springer Verlag
T2 - 14th International Workshop on Fast Software Encryption, FSE 2007
Y2 - 26 March 2007 through 28 March 2007
ER -