## CryptoDB

### Paper: General Diffusion Analysis: How to Find Optimal Permutations for Generalized Type-II Feistel Schemes

Authors: Victor Cauchois , DGA-MI, Boîte Postale 7, 35998 Rennes Cedex 9; 2 IRMAR, Université de Rennes 1, Campus de Beaulieu, 35042 Rennes Clément Gomez , DGA-MI, Boîte Postale 7, 35998 Rennes Cedex 9 Gaël Thomas , DGA-MI, Boîte Postale 7, 35998 Rennes Cedex 9 DOI: 10.13154/tosc.v2019.i1.264-301 URL: https://tosc.iacr.org/index.php/ToSC/article/view/7404 Search ePrint Search Google Slides Type-II Generalized Feistel Schemes are one of the most popular versions of Generalized Feistel Schemes. Their round function consists in applying a classical Feistel transformation to p sub-blocks of two consecutive words and then shifting the k = 2p words cyclically. The low implementation costs it offers are balanced by a low diffusion, limiting its efficiency. Diffusion of such structures may however be improved by replacing the cyclic shift with a different permutation without any additional implementation cost. In this paper, we study ways to determine permutations with the fastest diffusion called optimal permutations.To do so, two ideas are used. First, we study the natural equivalence classes of permutations that preserve cryptographic properties; second, we use the representation of permutations as coloured trees.For both heuristic and historical reasons, we focus first on even-odd permutations, that is, those permutations for which images of even numbers are odd. We derive from their structure an upper bound on the number of their equivalence classes together with a strategy to perform exhaustive searches on classes. We performed those exhaustive searches for sizes k ≤ 24, while previous exhaustive searches on all permutations were limited to k ≤ 16. For sizes beyond the reach of this method, we use tree representations to find permutations with good intermediate diffusion properties. This heuristic leads to an optimal even-odd permutation for k = 26 and best-known results for sizes k = 64 and k = 128.Finally, we transpose these methods to all permutations. Using a new strategy to exhaust equivalence classes, we perform exhaustive searches on classes for sizes k ≤ 20 whose results confirmed the initial heuristic: there always exist optimal permutations that are even-odd and furthermore for k = 18 all optimal permutations are even-odd permutations.
##### BibTeX
@article{tosc-2019-29271,
title={General Diffusion Analysis: How to Find Optimal Permutations for Generalized Type-II Feistel Schemes},
journal={IACR Transactions on Symmetric Cryptology},
publisher={Ruhr-Universität Bochum},
volume={2019, Issue 1},
pages={264-301},
url={https://tosc.iacr.org/index.php/ToSC/article/view/7404},
doi={10.13154/tosc.v2019.i1.264-301},
author={Victor Cauchois and Clément Gomez and Gaël Thomas},
year=2019
}