Plaintext Pair Sieve Methods in Impossible Differential Attack
Zhang Qing-gui · Jisuanji gongcheng · 2010
Based on quicksort theory,this paper presents a basic plaintext pair sieve algorithm and an improved algorithm,and the computational complexity of improved algorithm is O(nlogn),which is less than O(n2) of the method by checking each pairs. It analyzes the computational complexity of plaintext pair sieve in impossible differential attacks on ARIA etc with the new algorithm,and proves that the computational complexity is higher remarkably than that in the key solving process for one impossible differential attack on ARIA.