Please use this identifier to cite or link to this item:
Title: Improved differential cryptanalysis on Generalized Feistel Schemes
Authors: Tjuawinata, Ivan
Huang, Tao
Wu, Hongjun
Keywords: Generalized Feistel Network
Differential Analysis
Issue Date: 2017
Source: Tjuawinata I., Huang T., & Wu H. (2017). Improved differential cryptanalysis on Generalized Feistel Schemes. In: Patra A., Smart N. (eds) Progress in Cryptology - INDOCRYPT 2017. INDOCRYPT 2017. Lecture Notes in Computer Science, vol 10698. Springer, Cham. doi:10.1007/978-3-319-71667-1_16
Conference: Progress in Cryptology - INDOCRYPT 2017
Abstract: 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.
DOI: 10.1007/978-3-319-71667-1_16
Schools: School of Physical and Mathematical Sciences 
Rights: This is a post-peer-review, pre-copyedit version of an article published in Progress in Cryptology - INDOCRYPT 2017. The final authenticated version is available online at:
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Conference Papers

Files in This Item:
File Description SizeFormat 
Improved differential cryptanalysis on generalized feistel schemes.pdf607.27 kBAdobe PDFThumbnail

Citations 50

Updated on Feb 22, 2024

Web of ScienceTM
Citations 50

Updated on Oct 24, 2023

Page view(s)

Updated on Feb 25, 2024

Download(s) 50

Updated on Feb 25, 2024

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.