Cryptanalytic attack on the self-shrinking sequence generator

Abstract

In this paper, a cryptanalysis on the Self-Shrinking Generator a well known sequence generator with cryptographic application is presented. An improvement in the Guess-and-Determine cryptanalytic technique has been proposed. Numerical results that improve other cryptanalysis developed on such a generator are given. In particular, complexities in the order of O(20.2L ) for the amount of intercepted sequence, O(L 2) for computer memory and O(20.5L ) for execution time (L being the length of the generator register) are obtained. In addition, a specific hardware for a practical cryptanalysis has been proposed. © 2011 Springer-Verlag.