摘要
基于LBlock算法的轮函数结构,给出16轮和17轮的LBlock分组密码算法的中间相遇攻击方法.攻击16轮LBlock算法所需的数据量约为232,计算量约为244.5次16轮加密;攻击17轮LBlock算法所需的数据量约为232,计算量约为255.5次17轮加密.攻击结果表明,17轮的轮LBlock算法对中间相遇攻击是不免疫的.
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 232chosen plaintexts and 244. 516-round encryptions and the attack on 17-round requires about 232chosen plaintexts and 255. 517-round encryptions. Therefore,17-round LBlock is not immune to the meet-inthe-middle attack.
出处
《中国科学院大学学报（中英文）》
CAS
CSCD
北大核心
2014年第4期564-569,共6页
Journal of University of Chinese Academy of Sciences
