New bounds for PMAC, TMAC, and XCBC

Kazuhiko Minematsu, Toshiyasu Matsushima

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

    19 Citations (Scopus)

    Abstract

    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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Pages434-451
    Number of pages18
    Volume4593 LNCS
    Publication statusPublished - 2007
    Event14th International Workshop on Fast Software Encryption, FSE 2007 - 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)03029743
    ISSN (Electronic)16113349

    Other

    Other14th International Workshop on Fast Software Encryption, FSE 2007
    CityLuxembourg
    Period07/3/2607/3/28

    Fingerprint

    Message Authentication
    Security Proof
    Authentication
    Query

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    Minematsu, K., & Matsushima, T. (2007). New bounds for PMAC, TMAC, and XCBC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4593 LNCS, pp. 434-451). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4593 LNCS).

    New bounds for PMAC, TMAC, and XCBC. / Minematsu, Kazuhiko; Matsushima, Toshiyasu.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4593 LNCS 2007. p. 434-451 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4593 LNCS).

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

    Minematsu, K & Matsushima, T 2007, New bounds for PMAC, TMAC, and XCBC. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4593 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4593 LNCS, pp. 434-451, 14th International Workshop on Fast Software Encryption, FSE 2007, Luxembourg, 07/3/26.
    Minematsu K, Matsushima T. New bounds for PMAC, TMAC, and XCBC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4593 LNCS. 2007. p. 434-451. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Minematsu, Kazuhiko ; Matsushima, Toshiyasu. / New bounds for PMAC, TMAC, and XCBC. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4593 LNCS 2007. pp. 434-451 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{6605c8f3da8b4b66a68361a98f4e58e0,
    title = "New bounds for PMAC, TMAC, and XCBC",
    abstract = "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.",
    author = "Kazuhiko Minematsu and Toshiyasu Matsushima",
    year = "2007",
    language = "English",
    isbn = "354074617X",
    volume = "4593 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "434--451",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - New bounds for PMAC, TMAC, and XCBC

    AU - Minematsu, Kazuhiko

    AU - Matsushima, Toshiyasu

    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

    M3 - Conference contribution

    AN - SCOPUS:38149006409

    SN - 354074617X

    SN - 9783540746171

    VL - 4593 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 434

    EP - 451

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    ER -