Some group-theoretical results on Feistel Networks in a long-key scenario

TL;DR

This paper investigates conditions under which Feistel networks with long keys are resistant to recent partition-based cryptanalysis, contributing to the understanding of their security in symmetric cryptography.

Contribution

It provides new group-theoretical results identifying conditions that enhance Feistel networks' immunity to partition-based attacks in long-key scenarios.

Findings

Identifies specific conditions for Feistel networks to resist partition-based attacks

Enhances understanding of the algebraic structure of Feistel networks

Offers theoretical insights into designing more secure block ciphers

Abstract

The study of the trapdoors that can be hidden in a block cipher is and has always been a high-interest topic in symmetric cryptography. In this paper we focus on Feistel-network-like ciphers in a classical long-key scenario and we investigate some conditions which make such a construction immune to the partition-based attack introduced recently by Bannier et al.