Institutional Repository
| The higher-order meet-in-The-middle attack and its application to the Camellia block cipher | |
| Lu, Jiqiang (1); Wei, Yongzhuang (2); Kim, Jongsung (4); Pasalic, Enes (5); Lu, J.(lvjiqiang@hotmail.com) | |
| 2014 | |
| 发表期刊 | Theoretical Computer Science
![]() |
| ISSN | 3043975 |
| 卷号 | 527页码:102-122 |
| 摘要 | The Camellia block cipher has a 128-bit block length, a user key of 128, 192 or 256 bits long, and a total of 18 rounds for a 128-bit key and 24 rounds for a 192 or 256-bit key. It is a Japanese CRYPTREC-recommended e-government cipher, a European NESSIE selected cipher and an ISO international standard. The meet-in-The-middle attack is a technique for analysing the security of a block cipher. In this paper, we propose an extension of the meet-in-The-middle attack, which we call the higher-order meet-in-The-middle (HO-MitM) attack; the core idea of the HO-MitM attack is to use multiple plaintexts to cancel some key-dependent component(s) or parameter(s) when constructing a basic unit of "value-in-The-middle". Then we introduce a novel approach, which combines integral cryptanalysis with the meet-in-The-middle attack, to construct HO-MitM attacks on 10-round Camellia with the FL/FL-1 functions under 128 key bits, 11-round Camellia with the FL/FL-1 functions under 192 key bits and 12-round Camellia with the FL/FL-1 functions under 256 key bits. Finally, we apply an existing approach to construct HO-MitM attacks on 14-round Camellia without the FL/FL-1 functions under 192 key bits and 16-round Camellia without the FL/FL-1 functions under 256 key bits. The HO-MitM attack can potentially be used to cryptanalyse other block ciphers. © 2014 Elsevier B.V. All rights reserved.; The Camellia block cipher has a 128-bit block length, a user key of 128, 192 or 256 bits long, and a total of 18 rounds for a 128-bit key and 24 rounds for a 192 or 256-bit key. It is a Japanese CRYPTREC-recommended e-government cipher, a European NESSIE selected cipher and an ISO international standard. The meet-in-The-middle attack is a technique for analysing the security of a block cipher. In this paper, we propose an extension of the meet-in-The-middle attack, which we call the higher-order meet-in-The-middle (HO-MitM) attack; the core idea of the HO-MitM attack is to use multiple plaintexts to cancel some key-dependent component(s) or parameter(s) when constructing a basic unit of "value-in-The-middle". Then we introduce a novel approach, which combines integral cryptanalysis with the meet-in-The-middle attack, to construct HO-MitM attacks on 10-round Camellia with the FL/FL-1 functions under 128 key bits, 11-round Camellia with the FL/FL-1 functions under 192 key bits and 12-round Camellia with the FL/FL-1 functions under 256 key bits. Finally, we apply an existing approach to construct HO-MitM attacks on 14-round Camellia without the FL/FL-1 functions under 192 key bits and 16-round Camellia without the FL/FL-1 functions under 256 key bits. The HO-MitM attack can potentially be used to cryptanalyse other block ciphers. © 2014 Elsevier B.V. All rights reserved. |
| 收录类别 | SCI ; EI |
| 关键词 | Cryptology Block Cipher Camellia Meet-in-the-middle Attack Integral Cryptanalysis |
| 部门归属 | (1) Institute for Infocomm Research, Agency for Science, Technology and Research, 1 Fusionopolis Way, Singapore 138632, Singapore; (2) Guilin University of Electronic Technology, Guilin City, Guangxi Province 541004, China; (3) State Key Lab of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China; (4) Department of E-Business, Kyungnam University, 449 Wolyoung-dong, Masan, Kyungnam, Korea, Republic of; (5) University of Primorska FAMNIT, Koper, Slovenia |
| 语种 | 英语 |
| WOS记录号 | WOS:000334011700008 |
| 引用统计 | |
| 内容类型 | 期刊论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/16868 |
| 专题 | 中国科学院软件研究所 |
| 通讯作者 | Lu, J.(lvjiqiang@hotmail.com) |
| 推荐引用方式 GB/T 7714 | Lu, Jiqiang ,Wei, Yongzhuang ,Kim, Jongsung ,et al. The higher-order meet-in-The-middle attack and its application to the Camellia block cipher[J]. Theoretical Computer Science,2014,527:102-122. |
| APA | Lu, Jiqiang ,Wei, Yongzhuang ,Kim, Jongsung ,Pasalic, Enes ,&Lu, J..(2014).The higher-order meet-in-The-middle attack and its application to the Camellia block cipher.Theoretical Computer Science,527,102-122. |
| MLA | Lu, Jiqiang ,et al."The higher-order meet-in-The-middle attack and its application to the Camellia block cipher".Theoretical Computer Science 527(2014):102-122. |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论