Performance of the cryptanalysis over the shrinking generator

Abstract

The shrinking generator is a decimation-based nonlinear sequence generator with cryptographic application. Its output sequence can be modelled as one of the sequences generated by a linear cellular automata. Taking advantage of this linear structure, in this work a cryptanalysis of the shrinking generator has been introduced. The algorithm here developed recovers the secret key of the shrinking generator.