Linear solutions for cryptographic nonlinear sequence generators

This Letter analyzes the linearization of a class of cryptographic pseudo-random noise generators: the shrinking generators. The linearization process is based on the concatenation of chaotic linear automata. Since the shrinking generators can be so easily linearized, they do not provide enough guarantees to be used for encryption purposes. Due to the generality of these ideas, this automata-based linearization technique can be extended to more general pseudo-random noise generators.