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

中国科学院大学学报 ›› 2014, Vol. 31 ›› Issue (4): 564-569.DOI: 10.7523/j.issn.2095-6134.2014.04.018

• 计算机科学 • 上一篇    下一篇

LBlock的中间相遇攻击

张磊, 尚亚黎, 孙勃   

  1. 沈阳市65012部队, 沈阳 110001
  • 收稿日期:2013-02-21 修回日期:2013-08-28 发布日期:2014-07-15
  • 通讯作者: 张磊,E-mail:log_log@126.com

A meet-in-the-middle attack on Lblock

ZHANG Lei, SHANG Yali, SUN Bo   

  1. Unit 65012 of PLA, Shenyang 110001, China
  • Received:2013-02-21 Revised:2013-08-28 Published:2014-07-15

摘要:

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

关键词: 分组密码, 中间相遇攻击, LBlock分组密码

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.

Key words: block cipher, meet-in-the-middle attack, LBlock block cipher

中图分类号: