中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Subject: Computer Science
Title:
cbcr: cbc mac with rotating transformations
Author: Zhang LiTing ; Wu WenLing ; Zhang Lei ; Wang Peng
Keyword: message authentication code ; cipher block chaining ; block cipher ; provable security
Source: SCIENCE CHINA-INFORMATION SCIENCES
Issued Date: 2011
Volume: 54, Issue:11, Pages:2247-2255
Indexed Type: SCI
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.
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
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.
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.
Language: 英语
WOS ID: WOS:000297709100003
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16142
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Zhang LiTing,Wu WenLing,Zhang Lei,et al. cbcr: cbc mac with rotating transformations[J]. SCIENCE CHINA-INFORMATION SCIENCES,2011-01-01,54(11):2247-2255.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zhang LiTing]'s Articles
[Wu WenLing]'s Articles
[Zhang Lei]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zhang LiTing]‘s Articles
[Wu WenLing]‘s Articles
[Zhang Lei]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace