Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes
文献类型：期刊论文
| 作者 | Dong, Le (1) ; Wu, Wenling (2) ; Wu, Shuang (2) ; Zou, Jian (2) |
| 刊名 | Frontiers of Computer Science
 |
| 出版日期 | 2014 |
| 卷号 | 8期号:3页码:513-525 |
| 关键词 | known-key block cipher generalized Feistel scheme type-1 rebound attack integral distinguisher algebraic degree |
| ISSN号 | 20952228 |
| 通讯作者 | Dong, L.(dongle127@163.com) |
| 中文摘要 | We present some known-key distinguishers for a type-1 Feistel scheme with a permutation as the round function. To be more specific, the 29-round known-key truncated differential distinguishers are given for the 256-bit type-1 Feistel scheme with an SP (substitution-permutation) round function by using the rebound attack, where the S -boxes have perfect differential and linear properties and the linear diffusion layer has a maximum branch number. For two 128-bit versions, the distinguishers can be applied on 25-round structures. Based on these distinguishers, we construct near-collision attacks on these schemes with MMO (Matyas-Meyer-Oseas) and MP (Miyaguchi-Preneel) hashing modes, and propose the 26-round and 22-round near-collision attacks for two 256-bit schemes and two 128-bit schemes, respectively. We apply the near-collision attack on MAME and obtain a 26-round near-collision attack. Using the algebraic degree and some integral properties, we prove the correctness of the 31-round known-key integral distinguisher proposed by Sasaki et al. We show that if the round function is a permutation, the integral distinguisher is suitable for a type-1 Feistel scheme of any size. © 2014 Higher Education Press and Springer-Verlag Berlin Heidelberg. |
| 英文摘要 | We present some known-key distinguishers for a type-1 Feistel scheme with a permutation as the round function. To be more specific, the 29-round known-key truncated differential distinguishers are given for the 256-bit type-1 Feistel scheme with an SP (substitution-permutation) round function by using the rebound attack, where the S -boxes have perfect differential and linear properties and the linear diffusion layer has a maximum branch number. For two 128-bit versions, the distinguishers can be applied on 25-round structures. Based on these distinguishers, we construct near-collision attacks on these schemes with MMO (Matyas-Meyer-Oseas) and MP (Miyaguchi-Preneel) hashing modes, and propose the 26-round and 22-round near-collision attacks for two 256-bit schemes and two 128-bit schemes, respectively. We apply the near-collision attack on MAME and obtain a 26-round near-collision attack. Using the algebraic degree and some integral properties, we prove the correctness of the 31-round known-key integral distinguisher proposed by Sasaki et al. We show that if the round function is a permutation, the integral distinguisher is suitable for a type-1 Feistel scheme of any size. © 2014 Higher Education Press and Springer-Verlag Berlin Heidelberg. |
| 收录类别 | SCI ; EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000337042200015 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16860]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Dong, Le ,Wu, Wenling ,Wu, Shuang ,et al. Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes[J]. Frontiers of Computer Science,2014,8(3):513-525. |
| APA | Dong, Le ,Wu, Wenling ,Wu, Shuang ,&Zou, Jian .(2014).Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes.Frontiers of Computer Science,8(3),513-525. |
| MLA | Dong, Le ,et al."Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes".Frontiers of Computer Science 8.3(2014):513-525. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。