International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: OMAC: One-Key CBC MAC

Authors:
Tetsu Iwata
Kaoru Kurosawa
Download:
URL: http://eprint.iacr.org/2002/180
Search ePrint
Search Google
Abstract: In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, $K$ ($k$ bits) of a block cipher $E$. Previously, XCBC requires three keys, $(k+2n)$ bits in total, and TMAC requires two keys, $(k+n)$ bits in total, where $n$ denotes the block length of $E$. The saving of the key length makes the security proof of OMAC substantially harder than those of XCBC and TMAC.
BibTeX
@misc{eprint-2002-11703,
  title={OMAC: One-Key CBC MAC},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / CBC MAC, block cipher, provable security},
  url={http://eprint.iacr.org/2002/180},
  note={Pre-proceedings of FSE 2003 iwata@cis.ibaraki.ac.jp 12121 received 25 Nov 2002, last revised 9 Mar 2003},
  author={Tetsu Iwata and Kaoru Kurosawa},
  year=2002
}