A meet-in-the-middle attack on the LBlock cipher

ISCAS OpenIR

	A meet-in-the-middle attack on the LBlock cipher
	Wei, Yongzhuang (1); Su, Chongmao (1); Ma, Chunbo (1)
	2014
会议名称	2013 IEEE Conference Anthology, ANTHOLOGY 2013
会议日期	January 1, 2013 - January 8, 2013
会议地点	China
收录类别	EI
出版地	IEEE Computer Society, 2001 L Street N.W., Suite 700, Washington, DC 20036-4928, United States
ISBN	9781479916603
部门归属	(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
摘要	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 2³⁸ chosen plaintexts and a time complexity of 2⁶⁵ 19-round LBlock encryptions. This is the first known evaluation of the LBlock cipher against a meet-in-the - middle attack. © 2013 IEEE.; 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 2³⁸ chosen plaintexts and a time complexity of 2⁶⁵ 19-round LBlock encryptions. This is the first known evaluation of the LBlock cipher against a meet-in-the - middle attack. © 2013 IEEE.
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16579
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Wei, Yongzhuang ,Su, Chongmao ,Ma, Chunbo . A meet-in-the-middle attack on the LBlock cipher[C]. IEEE Computer Society, 2001 L Street N.W., Suite 700, Washington, DC 20036-4928, United States,2014.