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)).