Institutional Repository
| A meet-in-the-middle attack on the LBlock cipher | |
| Wei, Yongzhuang (1); Su, Chongmao (1); Ma, Chunbo (1) | |
| 2014 | |
| Conference Name | 2013 IEEE Conference Anthology, ANTHOLOGY 2013 |
| Conference Date | January 1, 2013 - January 8, 2013 |
| Conference Place | China |
| Indexed Type | EI |
| Publish Place | IEEE Computer Society, 2001 L Street N.W., Suite 700, Washington, DC 20036-4928, United States |
| 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 |
| 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.; 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 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| 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