Improved differential cryptanalysis on Generalized Feistel Schemes

• المؤلفون الرئيسيون: Tjuawinata, Ivan, Huang, Tao, Wu, Hongjun
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: 2019
• الموضوعات: Generalized Feistel Network; Science::Physics; Differential Analysis
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/104475; http://hdl.handle.net/10220/49998
• المؤسسة: Nanyang Technological University

Nachef et al. used differential cryptanalysis to study four types of Generalized Feistel Scheme (GFS). They gave the lower bound of maximum number of rounds that is indistinguishable from a random permutation. In this paper, we study the security of several types of GFS by exploiting the asymmetric property. We show that better lower bounds can be achieved for the Type-1 GFS, Type-3 GFS and Alternating Feistel Scheme. Furthermore, we give the first general results regarding to the lower bound of the Unbalanced Feistel Scheme.