|Authors||L. Knudsen and H. Raddum|
|Title||Distinguishing attack on five-round Feistel networks|
|Afilliation||, Communication Systems|
|Publication Type||Journal Article|
|Year of Publication||2003|
|Other Numbers||ISSN: 0013-5194|
Recently it was shown (by J. Patarin) how to distinguish a general five-round Feistel network from a random permutation using O(23n/2) chosen plaintexts or O(27n/4) known plaintexts. The present authors report improvement of these results and a distinguisher is presented which uses roughly 2n chosen plaintexts or roughly 23n/2 known plaintexts.