欢迎访问中国科学院大学学报,今天是
计算机科学

LBlock的中间相遇攻击

  • 张磊 ,
  • 尚亚黎 ,
  • 孙勃
展开
  • 沈阳市65012部队, 沈阳 110001

收稿日期: 2013-02-21

  修回日期: 2013-08-28

  网络出版日期: 2014-07-15

A meet-in-the-middle attack on Lblock

  • ZHANG Lei ,
  • SHANG Yali ,
  • SUN Bo
Expand
  • Unit 65012 of PLA, Shenyang 110001, China

Received date: 2013-02-21

  Revised date: 2013-08-28

  Online published: 2014-07-15

摘要

基于LBlock算法的轮函数结构,给出16轮和17轮的LBlock分组密码算法的中间相遇攻击方法.攻击16轮LBlock算法所需的数据量约为232,计算量约为244.5次16轮加密;攻击17轮LBlock算法所需的数据量约为232,计算量约为255.5次17轮加密.攻击结果表明,17轮的轮LBlock算法对中间相遇攻击是不免疫的.

本文引用格式

张磊 , 尚亚黎 , 孙勃 . LBlock的中间相遇攻击[J]. 中国科学院大学学报, 2014 , 31(4) : 564 -569 . DOI: 10.7523/j.issn.2095-6134.2014.04.018

Abstract

The meet-in-the-middle attack property of LBlock block cipher is analyzed. Based on the property of the structure of round function, the meet-in-the-middle attacks on 16-round and 17-round reduced LBlock are presented. It is shown that the attack on 16-round requires about 232 chosen plaintexts and 244.5 16-round encryptions and the attack on 17-round requires about 232 chosen plaintexts and 255.5 17-round encryptions. Therefore, 17-round LBlock is not immune to the meet-in-the-middle attack.

参考文献

[1] Hong D, Sung J, Lim J, et al. HIGHT: A new block cipher suitable for low-resource device[C]//CHES 2006, LNCS 4249. Springer-Verlag, 2006: 46-59.

[2] Bogdanov A, Kundsen L R, Leander G Poschmann, et al. PRESENT: An ultra-lightweight block cipher[C]//CHES 2007, LNCS 4727. Springer-Verlag, 2007: 450-466.

[3] Izadi M, Sadeghiyan B, Sadeghian S, et al. MIBS: A new lightweight Block cipher[C]//CANS 2009, LNCS 5888. Springer-Verlag, 2009: 334-348.

[4] De Canniere C, Dunkelman Orr, Knezevic M. KATAN and KTANTAN-A family of small and efficient hardware-oriented Block cipher[C]//CHES 2009, LNCS 5747. Springer-Verlag, 2009: 272-288.

[5] Wu W L , Zhang L. LBlock: A lightweight Block cipher[C]//ANCS 2011, LNCS 6715. Springer-Verlag, 2011: 327-344.

[6] Wu W L, Zhang L. LBlock: A lightweight Block cipher . Cryptology ePrint Archive, Report 2011/345, 2011. http:eprint.iacr.org/.

[7] Liu Y, Gu D W, Liu Z Q, et al. Impossible differential attacks on reduced-round LBlock[C]//Information Security Practice and Experience, LNCS 7232. Springer-Verlag, 2012: 97-108.

[8] Marine Miniera, Maria Naya-Plasenciab. A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock[C]//Information Processing Letters, Volume 112. Issue 16, 2012: 624-629.

[9] Zhan Y J, Guan J, Ding L, et al. Related-key impossible differential attack on reduced round LBLock[J]. Journal of Electronics & Information Technology, 2012, 34(9): 2161-2166(in Chinese). 詹英杰,关杰,丁林,等. 对简化版LBLock算法的相关密钥不可能差分攻击[J]. 电子与信息学报, 2012, 34(9): 2161-2166.

[10] Gilbert Henri, Marine Minier. A collision attack on 7 round of rijndael[C]//The Third AES Candidate Conference. 2000: 230-241.

[11] Demirci H, Aydm Seluk A. A meet in the middle attack on 8-round AES[C]//FSE 2008, LNCS 5086. Springer, 2008: 116-126.

文章导航

/