CMAC

This article is about the cryptographic construction. For other uses, see CMAC (disambiguation).

In cryptography, CMAC (Cipher-based Message Authentication Code) is a block cipher-based message authentication code algorithm. It may be used to provide assurance of the authenticity and, hence, the integrity of binary data. This mode of operation fixes security deficiencies of CBC-MAC (CBC-MAC is secure only for fixed-length messages).

The core of the CMAC algorithm is a variation of CBC-MAC that Black and Rogaway proposed and analyzed under the name XCBC and submitted to NIST. The XCBC algorithm efficiently addresses the security deficiencies of CBC-MAC, but requires three keys. Iwata and Kurosawa proposed an improvement of XCBC and named the resulting algorithm One-Key CBC-MAC (OMAC) in their papers. They later submitted OMAC1, a refinement of OMAC, and additional security analysis. The OMAC algorithm reduces the amount of key material required for XCBC. CMAC is equivalent to OMAC1.

File:CMAC - Cipher-based Message Authentication Code.pdf

To generate an ℓ-bit CMAC tag (t) of a message (m) using a b-bit block cipher (E) and a secret key (k), one first generates two b-bit sub-keys (k₁ and k₂) using the following algorithm (this is equivalent to multiplication by x and x² in a finite field GF(2^b)). Let ≪ denote the standard left-shift operator and ⊕ denote exclusive or:

1. Calculate a temporary value k₀ = E_k(0).
2. If msb(k₀) = 0, then k₁ = k₀ ≪ 1, else k₁ = (k₀ ≪ 1) ⊕ C; where C is a certain constant that depends only on b. (Specifically, C is the non-leading coefficients of the lexicographically first irreducible degree-b binary polynomial with the minimal number of ones.)
3. If msb(k₁) = 0, then k₂ = k₁ ≪ 1, else k₂ = (k₁ ≪ 1) ⊕ C.
4. Return keys (k₁, k₂) for the MAC generation process.

As a small example, suppose b = 4, C = 0011₂, and k₀ = E_k(0) = 0101₂. Then k₁ = 1010₂ and k₂ = 0100 ⊕ 0011 = 0111₂.

The CMAC tag generation process is as follows:

1. Divide message into b-bit blocks m = m₁ ∥ ... ∥ m_n−1 ∥ m_n where m₁, ..., m_n−1 are complete blocks. (The empty message is treated as 1 incomplete block.)
2. If m_n is a complete block then m_n′ = k₁ ⊕ m_n else m_n′ = k₂ ⊕ (m_n∥ 10...0₂).
3. Let c₀ = 00…0₂.
4. For i = 1, ..., n-1, calculate c_i = E_k(c_i−1 ⊕ m_i).
5. c_n = E_k(c_n−1 ⊕ m_n′)
6. Output t = msb_ℓ(c_n).

The verification process is as follows:

1. Use the above algorithm to generate the tag.
2. Check that the generated tag is equal to the received tag.

Implementations

• Python implementation [8]
• Ruby implementation cmac-rb

References

• ^ NIST, Recommendation for Block Cipher Modes of Operation: The CMAC Mode for Authentication, Special Publication 800-38B.
• ^ J. Black, P. Rogaway, A Suggestion for Handling Arbitrary-Length Messages with the CBC MAC, available from NIST.
• ^ J. Black, P. Rogaway, CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions, Advances in Cryptology—Crypto 2000.
• ^ T. Iwata, K. Kurosawa, OMAC: One-Key CBC MAC, available from NIST.
• ^ T. Iwata, K. Kurosawa, OMAC: One-Key CBC MAC, Fast Software Encryption 2003.
• ^ T. Iwata, K. Kurosawa, OMAC: One-Key CBC MAC—Addendum, available from NIST.
• ^ T. Iwata, K. Kurosawa, Stronger Security Bounds for OMAC, TMAC, and XCBC, available from NIST.

External links

• RFC 4493 The AES-CMAC Algorithm
• RFC 4494 The AES-CMAC-96 Algorithm and Its Use with IPsec
• RFC 4615 The Advanced Encryption Standard-Cipher-based Message Authentication Code-Pseudo-Random Function-128 (AES-CMAC-PRF-128)
• OMAC Online Test