The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata (CA). These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an algorithm that takes advantage of the inherent linearity of these CA and the interleaved m-sequences. Although irregularly decimated generators have been conceived and designed as non-linear ones, in practice they can be easily analysed in terms of simple linear structures.

中文翻译：

---

通过线性CA恢复基于抽取的加密序列

由加密序列生成器（称为收缩生成器）生成的序列可以建模为线性基本细胞自动机（CA）的输出序列。这些序列由基于反馈移位的线性结构产生的交错m序列组成。该有利的特征可以用于该生成器的密码分析中。在这项工作中，我们提出了一种算法，该算法利用了这些CA的固有线性和交错的m序列。尽管已经将不规则抽取的生成器设计为非线性生成器，但实际上，可以根据简单的线性结构轻松对其进行分析。