摘要
该文基于反馈多项式产生序列的原理,提出了一种通过构造n级(n<32)M序列反馈多项式从而生成M序列的高效生成算法,并在此算法基础上提出一类新的序列(M-1序列)。由此算法产生的反馈多项式十分简单,易于用硬件实现。此算法方案可以作为设计序列密码的密钥发生器的基础,亦可以用于通信、编码等领域,具有一定的实用性。
Based on the theory that a feedback shift register can generate a sequence, this paper puts forward a new high-efficient algorithm, which can construct n stage （n〈32） M sequences from feedback polynomials. This paper also presents a new kind of sequences （M-1 sequences） based on this algorithm. In the result of algorithm, the feedback polynomials are very simple, can be easily implemented by hardware. This scheme is practical and can be reference to designing the key generator of stream cipher, as well as used in communication and code.
出处
《计算机安全》
2007年第11期11-13,共3页
Network & Computer Security
基金
浙江省自然科学基金资助项目(20050495)
关键词
移位寄存器
M序列
多项式
算法
shift register
M-sequences
polynomial
algorithm
