Analysis of 3-line generalized Feistel networks with double SD-functions

Andrey Bogdanov, Kyoji Shibutani

Research output: Contribution to journalJournal articleResearchpeer-review


Generalized Feistel networks (GFN) are broadly employed in the design of primitives for block ciphers, stream ciphers, and hash functions. Lately, endowing the functions of GFNs with the structure of nonlinear substitution followed by linear diffusion (substitution–diffusion, SD) has received a great deal of attention. In this contribution, we prove tight lower bounds on the number of differentially and linearly active S-boxes for 3-line GFNs with double SD-functions where two SD-structures are applied one after another. We also show 8-round impossible differentials for 3-line GFNs with bijective functions. Moreover, we demonstrate that the proportion of active S-boxes in all S-boxes for such GFNs is by up to 14% higher than that for 4-line GFNs with double SD-functions, when instantiated with MDS matrices. This indicates that, rather surprisingly, the 3-line GFNs can be more efficient in practice than those with 4 lines.
Original languageEnglish
JournalInformation Processing Letters
Issue number13
Pages (from-to)656-660
Publication statusPublished - 2011
Externally publishedYes


Dive into the research topics of 'Analysis of 3-line generalized Feistel networks with double SD-functions'. Together they form a unique fingerprint.

Cite this