中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
A meet-in-the-middle attack on the LBlock cipher
Author: Wei, Yongzhuang (1) ; Su, Chongmao (1) ; Ma, Chunbo (1)
Conference Name: 2013 IEEE Conference Anthology, ANTHOLOGY 2013
Conference Date: January 1, 2013 - January 8, 2013
Issued Date: 2014
Conference Place: China
Publish Place: IEEE Computer Society, 2001 L Street N.W., Suite 700, Washington, DC 20036-4928, United States
Indexed Type: EI
ISBN: 9781479916603
Department: (1) Department of Communication and Information Engineering, Guilin University of Electronic Technology, Guilin, Guangxi, China; (2) State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an, Shanxi, China; (3) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China
Abstract: LBlock is a new lightweight Block cipher which was proposed by Wu and Zhang at ACNS2011. The block size of LBlock is 64 bits and its key size is 80 bits. It was reported that the cipher is very suitable for many resource constrained environments (for instance RFID and sensor networking) which usually have weak computation ability, strict power constraints, or a small storage space and so on. In this paper, the security of LBlock cipher against a meet-in-the-middle attack is examined. An 11-round distinguisher is constructed by using the structure of LBlock encryption algorithm. Moreover, it is shown that 19-round LBlock is breakable with a data complexity of 238 chosen plaintexts and a time complexity of 265 19-round LBlock encryptions. This is the first known evaluation of the LBlock cipher against a meet-in-the - middle attack. © 2013 IEEE.
English Abstract: LBlock is a new lightweight Block cipher which was proposed by Wu and Zhang at ACNS2011. The block size of LBlock is 64 bits and its key size is 80 bits. It was reported that the cipher is very suitable for many resource constrained environments (for instance RFID and sensor networking) which usually have weak computation ability, strict power constraints, or a small storage space and so on. In this paper, the security of LBlock cipher against a meet-in-the-middle attack is examined. An 11-round distinguisher is constructed by using the structure of LBlock encryption algorithm. Moreover, it is shown that 19-round LBlock is breakable with a data complexity of 238 chosen plaintexts and a time complexity of 265 19-round LBlock encryptions. This is the first known evaluation of the LBlock cipher against a meet-in-the - middle attack. © 2013 IEEE.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16579
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Wei, Yongzhuang ,Su, Chongmao ,Ma, Chunbo . A meet-in-the-middle attack on the LBlock cipher[C]. 见:2013 IEEE Conference Anthology, ANTHOLOGY 2013. China. January 1, 2013 - January 8, 2013.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Wei, Yongzhuang (1)]'s Articles
[Su, Chongmao (1)]'s Articles
[Ma, Chunbo (1)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Wei, Yongzhuang (1)]‘s Articles
[Su, Chongmao (1)]‘s Articles
[Ma, Chunbo (1)]‘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-2020  中国科学院软件研究所 - Feedback
Powered by CSpace