主要论述对序列密码的攻击方法:对于线性反馈移位寄存器序列,利用m序列的游程特性以及序列本身的递推关系,彻底还原产生该m序列的线性反馈移位寄存器。对于非线性组合序列,利用m序列的采样特性,降低其攻击难度,从而易于求取非线性组合生成器中各个线性反馈移位寄存器的极小多项式和初始密钥。 Mainly discusses the method of attack on sequence cipher: For the linear feedback shift register sequence, the linear feedback shift register generating the m sequence is completely restored by utilizing the run-length property of the m-sequence and the recursion relationship of the sequence itself. For the non-linear combination sequence, the sampling characteristic of m sequence is used to reduce the difficulty of attack, so that it is easy to get the minimum polynomial and initial key of each linear feedback shift register in the non-linear combination generator.