Computational Complexity Analysis on Improved Py Distinguish Attack Algorithm

Using the way of computing directly, this paper analyzes the computation complexity of the improved Py distinguish attack algorithm proposed by Crowley P.Using the concept of replacing time with space, this paper presents a new method to implement the attack which can reduce the complexity to 1/14 times of that of using the way of computing directly.