Generic Attacks on Classical Feistel Ciphers

2017 ◽  
pp. 65-73
Author(s):  
Valerie Nachef ◽  
Jacques Patarin ◽  
Emmanuel Volte
Author(s):  
Jian Guo ◽  
Jérémy Jean ◽  
Ivica Nikolic ◽  
Yu Sasaki

We show generic attacks on unbalanced Feistel ciphers based on the meet-in-the-middle technique. We analyze two general classes of unbalanced Feistel structures, namely contracting Feistels and expanding Feistels. In both of the cases, we consider the practical scenario where the round functions are keyless and known to the adversary. In the case of contracting Feistels with 4 branches, we show attacks on 16 rounds when the key length k (in bits) is as large as the block length n (in bits), and up to 24 rounds when k = 2n. In the case of expanding Feistels, we consider two scenarios: one, where different nonlinear functions without particular structures are used in the round function, and a more practical one, where a single nonlinear is used but different linear functions are introduced in the state update. In the former case, we propose generic attacks on 13 rounds when k = n, and up to 21 rounds when k = 2n. In the latter case, 16 rounds can be attacked for k = n, and 24 rounds for k = 2n.


2017 ◽  
pp. 139-153
Author(s):  
Valerie Nachef ◽  
Jacques Patarin ◽  
Emmanuel Volte

2017 ◽  
pp. 95-116
Author(s):  
Valerie Nachef ◽  
Jacques Patarin ◽  
Emmanuel Volte

2017 ◽  
pp. 117-138
Author(s):  
Valerie Nachef ◽  
Jacques Patarin ◽  
Emmanuel Volte

2017 ◽  
pp. 75-94 ◽  
Author(s):  
Valerie Nachef ◽  
Jacques Patarin ◽  
Emmanuel Volte

2020 ◽  
Vol 64 (1) ◽  
Author(s):  
Yaobin Shen ◽  
Hailun Yan ◽  
Lei Wang ◽  
Xuejia Lai
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document