一类线性移位寄存器的改造方法  

Rebuilding Way of Non-primitive Irreducible Polynomial LFSR

作　　者：余秦勇[1] 张文科[1] 

机构地区：[1]卫士通信息产业股份有限公司,四川成都610041

出　　处：《通信技术》2011年第4期121-123,共3页Communications Technology

摘　　要：线性移位寄存器由于能产生可控的随机性好的长周期序列,一直受到密码界的关注,但是,主要是对本原不可约多项式进行了深入的研究,对非本原不可约多项式的应用研究较少。这里给出了一种将联接多项式为非本原不可约的线性反馈移位寄存器改造成级数不变,线性递推关系相同,而从一个初始状态可获得分属不同圈的多个输出序列的线性时序电路的方法。For its generation of controllable long period sequence,LFSR always attracts much attention from the cryptographic community.However,the in-depth study mainly focuses on the primitive irreducible connection polynomial.This paper gives a way to rebuild the LFSR,with which the non-primitive irreducible connection polynomial is changed into the linear sequential circuit with same length and same linear recursive relation,and capable to get different-round,multi-output sequence.

关 键 词：线性反馈移位寄存器 线性递推关系 延迟算子 

分 类 号：TN918[电子电信—通信与信息系统]