| LBlock的中间相遇攻击 |
| |
| 作者姓名： | 张磊 尚亚黎 孙勃 |
| |
| 作者单位： | 沈阳市65012部队, 沈阳 110001 |
| |
| 摘 要： | 基于LBlock算法的轮函数结构，给出16轮和17轮的LBlock分组密码算法的中间相遇攻击方法.攻击16轮LBlock算法所需的数据量约为232，计算量约为244.5次16轮加密；攻击17轮LBlock算法所需的数据量约为232，计算量约为255.5次17轮加密.攻击结果表明，17轮的轮LBlock算法对中间相遇攻击是不免疫的.
|
| 关 键 词： | 分组密码 中间相遇攻击 LBlock分组密码 |
| 收稿时间： | 2013-02-21 |
| 修稿时间： | 2013-08-28 |
A meet-in-the-middle attack on Lblock |
| |
| Authors: | ZHANG Lei SHANG Yali SUN Bo |
| |
| Institution: | Unit 65012 of PLA, Shenyang 110001, China |
| |
| 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. |
| |
| Keywords: | block cipher meet-in-the-middle attack LBlock block cipher |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |
