利用线性CA恢复基于抽取的密码序列
Recovering decimation-based cryptographic sequences by means of linear CAs
摘要：
由称为收缩生成器的密码序列生成器产生的序列可以被建模为线性初等细胞自动机的输出序列。这些序列由基于反馈移位的线性结构产生的交织m序列组成。这一有益的特性可用于该生成器的密码分析。在这项工作中，我们提出了一个算法，利用这些细胞自动机和交织的m序列的固有线性。虽然不规则抽取发生器已被设想和设计为非线性序列发生器，但在实践中，它们可以很容易地用简单的线性结构进行分析。
英文摘要：
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. 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 cellular automata and the interleaved m-sequences. Although irregularly decimated generators have been conceived and designed as non-linear sequence generators, in practice they can be easily analysed in terms of simple linear structures.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
