Title :
Improvement for distinguisher efficiency of the 3-round Feistel network and a random permutation
Author :
Oliynykov, Roman ; Gorbenko, Ivan ; Dolgov, Victor ; Kaidalov, Dmytro
Author_Institution :
Kharkov Nat. Univ. of Radioelectron., Kharkov, Ukraine
Abstract :
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.
Keywords :
cryptography; random processes; 3-round Feistel network; algorithm execution complexity; distinguisher efficiency; random permutation; round function collision probability; Algorithm design and analysis; Complexity theory; Encryption; Equations; Generators; Upper bound; Feistel network; cryptography; random permutation; symmetric block cipher;
Conference_Titel :
Intelligent Data Acquisition and Advanced Computing Systems (IDAACS), 2011 IEEE 6th International Conference on
Conference_Location :
Prague
Print_ISBN :
978-1-4577-1426-9
DOI :
10.1109/IDAACS.2011.6072869
