CBCR: CBC MAC with rotating transformations

Li Ting Zhang, Wen Ling Wu, Lei Zhang, Peng Wang

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Message authentication codes (MACs) are widely used to protect data integrity and data origin authentication in communications. In this paper, we propose a new block-cipher-based MAC algorithm, CBCR, with provable security for arbitrary-length messages. CBCR adopts rotating operations in the end of cipher-block-chaining structure, and it appends fixed-length prefixes to all messages, which implies flexible usages in practice. For example, these fixed-length prefixes can be filled with some security parameters, message redundancies, etc. We also propose CBCR0, a special case of CBCR that sets its prefix to be an all-zero block. Compared with CMAC, a recommended standard by the US National Institute of Standards and Technology (NIST), CBCR0 enjoys all the advantages that CMAC has, but requires less memory; so, in practical applications, CBCR0 behaves as well as CMAC does, and it is even more suitable for environments with limited memory resources, e. g. smart cards.

Original languageEnglish
Pages (from-to)2247-2255
Number of pages9
JournalScience China Information Sciences
Issue number11
StatePublished - Nov 2011
Externally publishedYes


  • block cipher
  • cipher block chaining
  • message authentication code
  • provable security


Dive into the research topics of 'CBCR: CBC MAC with rotating transformations'. Together they form a unique fingerprint.

Cite this