  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.
