CBC MACs for arbitrary-length messages: The three-key constructions
We suggest some simple variants of the CBC MAC that enable the efficient authentication of arbitrary-length messages. Our constructions use three keys, K1, K2, K3, to avoid unnecessary padding and MAC any message M {0,1}*using max{1, Γ |M|/nΓ} applications of the underlying n-bit block cipher. Our f...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=17444383008&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62165 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | We suggest some simple variants of the CBC MAC that enable the efficient authentication of arbitrary-length messages. Our constructions use three keys, K1, K2, K3, to avoid unnecessary padding and MAC any message M {0,1}*using max{1, Γ |M|/nΓ} applications of the underlying n-bit block cipher. Our favorite construction, XCBC, works like this: if |M| is a positive multiple of n then XOR the n-bit key K2 with the last block of M and compute the CBC MAC keyed with K1; otherwise, extend M's length to the next multiple of n by appending minimal 10ℓpadding (ℓ ≥ 0), XOR the n-bit key K3 with the last block of the padded message, and compute the CBC MAC keyed with K1. We prove the security of this and other constructions, giving concrete bounds on an adversary's inability to forge in terms of his inability to distinguish the block cipher from a random permutation. Our analysis exploits new ideas which simplify proofs compared with prior work. © 2004 International Association for Cryptologic Research. |
|---|