OMAC: One-key CBC MAC

234Citations
Citations of this article
74Readers
Mendeley users who have this article in their library.

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. © International Association for Cryptologic Research 2003.

Author supplied keywords

Cite

CITATION STYLE

APA

Iwata, T., & Kurosawa, K. (2003). OMAC: One-key CBC MAC. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2887, 129–153. https://doi.org/10.1007/978-3-540-39887-5_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free