Some group-theoretical results on Feistel Networks in a long-key scenario
Journal article, Peer reviewed
MetadataShow full item record
Original versionAdvances in Mathematics of Communications. 2020, 14(4): 727-743 http://dx.doi.org/10.3934/amc.2020093
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.