Improvement for distinguisher efficiency of the 3-round Feistel network and a random permutation
Roman Oliynykov, І.Д. Горбенко, Victor Dolgov, Dmytro Kaidalov · 2011
An exact value of round functions collision probability for 3-round Feistel network is derived. The upper bound of algorithm execution complexity for distinguishing Feistel network from a random permutation is given.