Some group-theoretical results on Feistel Networks in a long-key scenario
arXiv:1912.06751v24 citations
AI Analysis
This work addresses security vulnerabilities in block ciphers for cryptographic applications, but appears incremental as it builds on existing attacks and scenarios.
The paper investigates conditions for Feistel-network-like ciphers in a long-key scenario to be immune to the partition-based attack by Bannier et al., focusing on trapdoor prevention in symmetric cryptography.
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.