Provided by: Australian Computer Society
Date Added: May 2009
In this paper, the authors show that the cryptanalysis of the shrinking generator requires fewer intercepted bits than that indicated by the linear complexity. Indeed, whereas the linear complexity of shrunken sequences is between A.2(S-2) and A.2(S-1), they claim that the initial states of both component registers are easily computed with less than A.S shrunken bits. Such a result is proven thanks to the definition of shrunken sequences as interleaved sequences. Consequently, it is conjectured that this statement can be extended to all interleaved sequences.