Cryptanalysis of self-shrinking generator
Lizhen Yang, Kefei Chen, Xiaoyun Wang · Electronics Letters · 2003
A simple cryptanalysis of the self-shrinking generator with very short keystream for the case of unknown connection polynomial is provided. The expected complexity of this cryptanalysis is 21.5L when the length of the LFSR of the generator is L.