一类新的周期为2pq的二元广义分圆序列的线性复杂度  

The Linear Complexity of a New Class of Generalized Cyclotomic Sequence with Period 2pq

作　　者：李瑞芳[1] 柯品惠[1] 

机构地区：[1]福建师范大学网络安全与密码技术福建省重点实验室,福州350007

出　　处：《电子与信息学报》2014年第3期650-654,共5页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(61102093)资助课题

摘　　要：该文提出一类新的周期为2pq,p和q为不同奇素数的广义分圆序列,并给出了该序列线性复杂度的计算公式。在已知序列支撑集的情况下,利用该公式可以得到该序列线性复杂度的精确值。A new class of generalized cyclotomic sequence with period 2pq is proposed in this paper, where p and q are distinct primes. A formula for computing the linear complexity of the proposed sequence is also given. With the knowledge of the support set of the generalized cyclotomic sequence, its linear complexity can be easily determined using the formula.

关 键 词：密码学 有限域 广义分圆序列 线性复杂度 

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