Improved Differential Cryptanalysis on Generalized Feistel Schemes

Ivan Tjuawinata; Tao Huang; Hongjun Wu

Paper 2017/1194

Improved Differential Cryptanalysis on Generalized Feistel Schemes

Ivan Tjuawinata, Tao Huang, and Hongjun Wu

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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Minor revision. Indocrypt 2017
Keywords: Generalized Feistel Network Differential Analysis Chosen Ciphertext Attack Known Plaintext Attack.
Contact author(s): s120015 @ e ntu edu sg
History: 2017-12-18: received
Short URL: https://ia.cr/2017/1194
License: CC BY

BibTeX

@misc{cryptoeprint:2017/1194,
      author = {Ivan Tjuawinata and Tao Huang and Hongjun Wu},
      title = {Improved Differential Cryptanalysis on Generalized Feistel Schemes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/1194},
      year = {2017},
      url = {https://eprint.iacr.org/2017/1194}
}