Improved differential cryptanalysis on Generalized Feistel Schemes

Improved differential cryptanalysis on Generalized Feistel Schemes

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Tjuawinata, Ivan, Huang, Tao, Wu, Hongjun
Other Authors: School of Physical and Mathematical Sciences
Format: Conference or Workshop Item
Language:English
Published: 2019
Subjects:
Generalized Feistel Network
Science::Physics
Differential Analysis
Online Access:https://hdl.handle.net/10356/104475
http://hdl.handle.net/10220/49998
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary: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.

Similar Items