A fast algorithm for determing the linear complexity of a pseudo-random sequence with periodic n2v
Cai Mian①②; Wang Hong②; Xiao Guozhen②
①National Key Laboratory of Integrated Services Networks and Research Inst. of Information Security Xidian Univ., Xi' an 710071 China; ②National Key Laboratory of Information Security The Graduate School of the Chinese Academy of Sciences Beijing 100039
Abstract：A generalized discrete Fourier transfom is used to give a fast algorithm for determing the linear complexity of a pseudo-random sequence with periodic n2v, and a new conclusion of Hasse derivatives of polynoimial on GF(2) are proposed.
蔡勉; 王宏; 肖国镇. 周期为N=n2v的序列线性复杂度的快速算法[J]. 电子与信息学报, 2002, 24(3): 370-376 .
Cai Mian①②; Wang Hong②; Xiao Guozhen②. A fast algorithm for determing the linear complexity of a pseudo-random sequence with periodic n2v. , 2002, 24(3): 370-376 .
2002, Vol. 24 
