Welcome to the resource topic for 2002/180
Title:
OMAC: One-Key CBC MAC
Authors: Tetsu Iwata, Kaoru Kurosawa
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.
ePrint: https://eprint.iacr.org/2002/180
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .