Paper 2015/734

On the Security of Extended Generalized Feistel Networks

Manoj Kumar, Saibal K. Pal, and Anupama Panigrahi

Abstract

In this paper, we analyze the security claims of Extended Generalized Feistel Networks (EGFNs) schemes proposed by Berger et al [1]. We provide impossible differentials for 10 rounds of EGFNs with 16 branches which add up one round to the claim of 9 rounds in the impossible differential trail. Therefore, impossible differential trail covers 10 rounds for the EGFNs scheme, which is the best result on impossible differentials of EGFNs so far. We also provide several 10 round impossible differential trails to attack EGFNs based new cipher proposals. u–method is also used by authors to assert their claim for maximum number of rounds in impossible differential trails of EGFNs. This analysis indicates that u-method does not provide optimal results for this scheme.

Note: FIXING SOME CHARACTERS IN ABSTRACT

Metadata
Available format(s)
-- withdrawn --
Publication info
Preprint.
Keywords
secret-key cryptographyFeistel NetworkGeneralized Feistel NetworkImpossible Differential Cryptanalysisu-method
Contact author(s)
mktalyan @ yahoo com
History
2016-03-31: withdrawn
2015-07-24: received
See all versions
Short URL
https://ia.cr/2015/734
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.