A cryptanalytic attack on a class of cryptographic sequence generators
M. E. Pazo-Robles, Amparo Fúster-Sabater · 2011
In this paper, a cryptanalytic attack on a class of cryptographic sequence generators (the class of Self-Shrinking Generators) is presented. In fact, the guess and determine cryptanalytic technique has been used as well as numerical results that improve other cryptanalysis developed on such a generator are shown. In particular, the complexities here presented are in the order of O(20.2L) for the amount of intercepted sequence, O(L2) for computer memory and O(20.5L) for execution time (L being the length of the linear feedback shift register).