Cryptanalysis of Feistel Networks with Secret Round Functions

Abstract : Generic distinguishers against Feistel Network with up to 5 rounds exist in the regular setting and up to 6 rounds in a multi-key setting. We present new cryptanalyses against Feistel Networks with 5, 6 and 7 rounds which are not simply distinguishers but actually recover completely the unknown Feistel functions. When an exclusive-or is used to combine the output of the round function with the other branch, we use the so-called yoyo game which we improved using a heuristic based on particular cycle structures. The complexity of a complete recovery is equivalent to O(2 2n) encryptions where n is the branch size. This attack can be used against 6-and 7-round Feistel Networks in time respectively O(2 n2 n−1 +2n) and O(2 n2 n +2n). However when modular addition is used, this attack does not work. In this case, we use an optimized guess-and-determine strategy to attack 5 rounds with complexity O(2 n2 3n/4). Our results are, to the best of our knowledge, the first recovery attacks against generic 5-, 6-and 7-round Feistel Networks.
Type de document :
Communication dans un congrès
Selected Areas in Cryptography - SAC 2015, Aug 2015, Sackville, Canada
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger
Contributeur : Gaëtan Leurent <>
Soumis le : lundi 14 décembre 2015 - 15:21:35
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : samedi 29 avril 2017 - 13:16:59


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01243130, version 1



Alex Biryukov, Gaëtan Leurent, Léo Perrin. Cryptanalysis of Feistel Networks with Secret Round Functions. Selected Areas in Cryptography - SAC 2015, Aug 2015, Sackville, Canada. 〈hal-01243130〉



Consultations de la notice


Téléchargements de fichiers