On the (p−1)/2-error Linear Complexity of Generalized Cyclotomic Sequence with Length pm
Liu Long-fei① Yang Xiao-yuan①② Chen Hai-bin①
①(Key Laboratory of Network & Information Security of Armed Police Force, Engineering University of Armed Police Force, Xi’an 710086, China) ②(Key Laboratory of Computer Network & Information Security of the Ministry of Education, Xidian University, Xi’an 710071, China)
Abstract：The generalized cyclotomic sequences with length pm has high linear complexity. In this paper, a class of error generalized cyclotomic sequences is constructed by changing the characteristic sets of the above sequences. The results show that the (p−1)/2-error linear complexity of generalized cyclotomic sequences do not exceed pm−1, which are much less than its (zero-error) linear complexity. Thus, it is not secure enough to be used in the stream cipher system.
刘龙飞, 杨晓元, 陈海滨. 周期为pm的广义割圆序列的(p−1)/2-错线性复杂度[J]. 电子与信息学报, 2013, 35(1): 191-195.
Liu Long-Fei, Yang Xiao-Yuan, Chen Hai-Bin. On the (p−1)/2-error Linear Complexity of Generalized Cyclotomic Sequence with Length pm. , 2013, 35(1): 191-195.
2013, Vol. 35 
