Institutional Repository
| cbcr: cbc mac with rotating transformations | |
| Zhang LiTing; Wu WenLing; Zhang Lei; Wang Peng | |
| 2011 | |
| Source | SCIENCE CHINA-INFORMATION SCIENCES
 |
| ISSN | 1674-733X |
| Volume | 54Issue:11Pages:2247-2255 |
| English Abstract | 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.; 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. |
| Indexed Type | SCI |
| Keyword | Message Authentication Code Cipher Block Chaining Block Cipher Provable Security |
| Department | Zhang LiTing; Wu WenLing; Zhang Lei Chinese Acad Sci Inst Software State Key Lab Informat Secur Beijing 100190 Peoples R China. Zhang LiTing; Wang Peng Chinese Acad Sci Grad Univ Beijing 100049 Peoples R China. |
| Subject | Computer Science |
| Sponsorship | National High-Tech Research & Development Program of China2007AA01Z470; National Natural Science Foundation of China60873259, 60903219; National Basic Research Program of China2004CB318004; Chinese Academy of Sciences |
| Language | 英语 |
| WOS ID | WOS:000297709100003 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16142 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zhang LiTing,Wu WenLing,Zhang Lei,et al. cbcr: cbc mac with rotating transformations[J]. SCIENCE CHINA-INFORMATION SCIENCES,2011,54(11):2247-2255. |
| APA | Zhang LiTing,Wu WenLing,Zhang Lei,&Wang Peng.(2011).cbcr: cbc mac with rotating transformations.SCIENCE CHINA-INFORMATION SCIENCES,54(11),2247-2255. |
| MLA | Zhang LiTing,et al."cbcr: cbc mac with rotating transformations".SCIENCE CHINA-INFORMATION SCIENCES 54.11(2011):2247-2255. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment