On 2-transitivity of generalized Feistel ciphers

Several generalizations of the Feistel scheme are known. In this paper, we introduce a mathematical model including different generalizations of the Feistel scheme. For the described $\upsilon$-generalized Feistel ciphers, we get an accessible lower boundary for the number of rounds under which the 2-transitivity is achieved.