Title: Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes
Author: Dong, Le (1)
; Wu, Wenling (2)
; Wu, Shuang (2)
; Zou, Jian (2)
Corresponding Author: Dong, L.(dongle127@163.com)
Keyword: known-key
; block cipher
; generalized Feistel scheme
; type-1
; rebound attack
; integral distinguisher
; algebraic degree
Source: Frontiers of Computer Science
Issued Date: 2014
Volume: 8, Issue: 3, Pages: 513-525 Indexed Type: SCI
; EI
Department: (1) College of Mathematics and Information Science, Henan Normal University, Xinxiang, 453007, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China; (3) Graduate University of Chinese Academy of Sciences, Beijing, 100149, China
Abstract: 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. English Abstract: 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. Language: 英语
WOS ID: WOS:000337042200015
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16860
Appears in Collections: 软件所图书馆_期刊论文
There are no files associated with this item.
Recommended Citation:
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-01-01,8(3):513-525.
