World Library  
Flag as Inappropriate
Email this Article


In cryptography, a cipher block chaining message authentication code (CBC-MAC) is a technique for constructing a message authentication code from a block cipher. The message is encrypted with some block cipher algorithm in CBC mode to create a chain of blocks such that each block depends on the proper encryption of the previous block. This interdependence ensures that a change to any of the plaintext bits will cause the final encrypted block to change in a way that cannot be predicted or counteracted without knowing the key to the block cipher.

To calculate the CBC-MAC of message m one encrypts m in CBC mode with zero initialization vector. The following figure sketches the computation of the CBC-MAC of a message comprising blocks m_1\|m_2\|\cdots\|m_x using a secret key k and a block cipher E:


  • Security with fixed and variable-length messages 1
    • Length prepending 1.1
    • Encrypt-last-block 1.2
  • Attack methods 2
    • Using the same key for encryption and authentication 2.1
    • Allowing the initialisation vector to vary in value 2.2
  • Standards that define the algorithm 3
  • See also 4
  • References 5

Security with fixed and variable-length messages

If the block cipher used is secure (meaning that it is a pseudorandom permutation), then CBC-MAC is secure for fixed-length messages.[1] However, by itself, it is not secure for variable-length messages. Thus, any single key must only be used for messages of a fixed and known length. This is because an attacker who knows the correct message-tag (i.e. CBC-MAC) pairs for two messages (m, t) and (m', t') can generate a third message m'' whose CBC-MAC will also be t'. This is simply done by XORing the first block of m' with t and then concatenating m with this modified m'; i.e., by making m'' = m \| [(m_1' \oplus t) \| m_2' \| \dots \| m_x']. When computing the MAC for the message m'', it follows that we compute the MAC for m in the usual manner as t, but when this value is chained forwards to the stage computing E_{K_\text{MAC}}(m_1' \oplus t) we will perform an exclusive OR operation with the value derived for the MAC of the first message. The presence of that tag in the new message means it will cancel, leaving no contribution to the MAC from the blocks of plain text in the first message m: E_{K_\text{MAC}}(m_1' \oplus t \oplus t) = E_{K_\text{MAC}}(m_1') and thus the tag for m'' is t'.

This problem cannot be solved by adding a message-size block to the end.[2] There are three main ways of modifying CBC-MAC so that it is secure for variable length messages: 1) Input-length key separation; 2) Length-prepending; 3) Encrypt last block.[2] In such a case, it may also be recommended to use a different mode of operation, for example, CMAC or HMAC to protect the integrity of variable-length messages.

Length prepending

One solution is to include the length of the message in the first block;[3] in fact CBC-MAC has been proven secure as long as no two messages that are prefixes of each other are ever used and prepending the length is a special case of this.[4] This can be problematic if the message length may not be known when processing begins.


Encrypt-last-block CBC-MAC (ECBC-MAC)[5] is defined as \text{CBC-MAC-ELB}(m, (k_1, k_2)) = E(k_2, \text{CBC-MAC}(k_1, m)).[2] Compared to the other discussed methods of extending CBC-MAC to variable-length messages, encrypt-last-block has the advantage of not needing to know the length of the message until the end of the computation.

Computation of CBC-MAC Encrypt-last-block.

Attack methods

As with many cryptographic schemes, naïve use of ciphers and other protocols may lead to attacks being possible, reducing the effectiveness of the cryptographic protection (or even rendering it useless). We present attacks which are possible due to using the CBC-MAC incorrectly.

Using the same key for encryption and authentication

One common mistake is to reuse the same key k for CBC encryption and CBC-MAC. Although a reuse of a key for different purposes is a bad practice in general, in this particular case the mistake leads to a spectacular attack:

Suppose Alice has sent to Bob the cipher text blocks C = C_1\ ||\ C_2\ ||\ \dots\ ||\ C_n. During the transmission process, Eve can tamper with any of the C_1 , \dots , C_{n-1} cipher-text blocks and adjust any of the bits therein as she chooses, provided that the final block, C_n, remains the same. We assume, for the purposes of this example and without loss of generality, that the initialisation vector used for the encryption process is a vector of zeroes.

When Bob receives the message, he will first decrypt the message by reversing the encryption process which Alice applied, using the cipher text blocks C=C_1\ ||\ C_2\ ||\ \cdots\ ||\ C_n. During the transmission process, Eve can tamper with any of the C_1 , \dots , C_{n-1} cipher text blocks and adjust any of the bits therein as she chooses, provided that the final block, C_n, remains the same. Her tampered version, later delivered to Bob in replacement of Alice's original, is C'=C_1'\ ||\ \dots\ ||\ C_{n-1}'\ ||\ C_n.

Bob first decrypts the message received using the shared secret key K to obtain corresponding plain text. Note that all plain text produced will be different from that which Alice originally sent, because Eve has modified all but the last cipher text block. In particular, the final plain text, P_n', differs from the original, P_n, which Alice sent; although C_n is the same, C_{n-1}' \not = C_{n-1}, so a different plain text P_n' is produced when chaining the previous cipher text block into the exclusive-OR after decryption of C_n: P_n' = C_{n-1}' \oplus E_K^{-1}(C_n).

It follows that Bob will now compute the authentication tag using CBC-MAC over all the values of plain text which he decoded. The tag for the new message, t', is given by:

t' = E_K(P_n' \oplus E_K(P_{n-1}' \oplus E_K( \dots \oplus E_K(P_1'))))

Notice that this expression is equal to

t' = E_K(P_n' \oplus C_{n-1}')

which is exactly C_n:

t' = E_K(C_{n-1}' \oplus E_K^{-1}(C_n) \oplus C_{n-1}') = E_K(E_K^{-1}(C_n)) = C_n

and it follows that t' = C_n = t.

Therefore, Eve was able to modify the cipher text in transit (without necessarily knowing what plain text it corresponds to) such that an entirely different message, P', was produced, but the tag for this message matched the tag of the original, and Bob was unaware that the contents had been modified in transit. By definition, a Message Authentication Code is broken if we can find a different message (a sequence of plain-text pairs P') which produces the same tag as the previous message, P, with P \not = P'. It follows that the message authentication protocol, in this usage scenario, has been broken, and Bob has been deceived into believing Alice sent him a message which she did not produce.

If, instead, we use different keys for the encryption and authentication stages, say K_1 and K_2, respectively, this attack is foiled. The decryption of the modified cipher-text blocks C_i' obtains some plain text string P_i'. However, due to the MAC's usage of a different key K_2, we cannot "undo" the decryption process in the forward step of the computation of the message authentication code so as to produce the same tag; each modified P_i' will now be encrypted by K_2 in the CBC-MAC process to some value MAC_i \not = C_i'.

This example also shows that a CBC-MAC cannot be used as a collision resistant one-way function: given a key it is trivial to create a different message which "hashes" to the same tag.

Allowing the initialisation vector to vary in value

When encrypting data using a block cipher in cipher block chaining (or another) mode, it is common to introduce an initialization vector to the first stage of the encryption process. It is typically required that this vector be chosen randomly (a nonce) and that it is not repeated for any given secret key under which the block cipher operates. This provides semantic security, by means of ensuring the same plain text is not encrypted to the same cipher text, allowing an attacker to infer a relationship exists.

When computing a message authentication code, such as by CBC-MAC, the use of an initialisation vector is a possible attack vector.

In the operation of a cipher block chaining cipher, the first block of plain text is mixed with the initialisation vector using an exclusive OR (P_1 \oplus IV). The result of this operation is the input to the block cipher for encryption.

However, when performing encryption and decryption, we are required to send the initialisation vector in plain text - typically as the block immediately preceding the first block of cipher text - such that the first block of plain text can be decrypted and recovered successfully. If computing a MAC, we will also need to transmit the initialisation vector to the other party in plain text so that they can verify the tag on the message matches the value they have computed.

If we allow the initialisation vector to be selected arbitrarily, it follows that the first block of plain text can potentially be modified (transmitting a different message) while producing the same message tag.

Consider a message M_1 = P_1 | P_2 | \dots. In particular, when computing the message tag for CBC-MAC, suppose we choose an initialisation vector IV_1 such that computation of the MAC begins with E_K(IV_1 \oplus P_1). This produces a (message, tag) pair (M_1, T_1).

Now produce the message M_2 = P_1' | P_2 | \dots. For each bit modified in P_1', flip the corresponding bit in the initialisation vector to produce the initialisation vector IV_1'. It follows that to compute the MAC for this message, we begin the computation by E_K(P_1' \oplus IV_1'). As bits in both the plain text and initialisation vector have been flipped in the same places, the modification is cancelled in this first stage, meaning the input to the block cipher is identical to that for M_1. If no further changes are made to the plain text, the same tag will be derived despite a different message being transmitted.

If the freedom to select an initialisation vector is removed and all implementations of CBC-MAC fix themselves on a particular initialisation vector (often the vector of zeroes, but in theory, it could be anything provided all implementations agree), this attack cannot proceed.

Standards that define the algorithm

FIPS PUB 113 Computer Data Authentication is a (now obsolete) U.S. government standard that specified the CBC-MAC algorithm using DES as the block cipher.

The CBC-MAC algorithm is equivalent to ISO/IEC 9797-1 MAC Algorithm 1.

See also

  • CMAC – A block-cipher–based MAC algorithm which is secure for messages of different lengths (recommended by NIST).
  • OMAC and PMAC – Other methods to turn block ciphers into message authentication codes (MACs).
  • One-way compression function – Hash functions can be made from block ciphers. But note, there are significant differences in function and uses for security between MACs (such as CBC-MAC) and hashes.


  1. ^ M. Bellare, J. Kilian and P. Rogaway. The security of the cipher block chaining message authentication code. JCSS 61(3):362–399, 2000.
  2. ^ a b c See Section 5 of Bellare, et al.
  3. ^ Information technology – Security techniques – Message Authentication Codes (MACs) – Part 1: Mechanisms using a block cipherISO/IEC 9797-1:1999 , clause 6.1.3 Padding Method 3
  4. ^ C. Rackoff and S. Gorbunov. On the Security of Block Chaining Message Authentication Code.
  5. ^
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.