摘要
线性复杂度是度量序列随机性的一个重要指标。基于广义分圆理论,在有限域F4上构造一类周期为2pq的四元平衡广义分圆序列。利用有限域上多项式根理论,通过分析序列的生成多项式与x2pq-1在F4代数闭包中公共根的个数,确定其线性复杂度的精确值。分析结果表明,新序列有较高的线性复杂度和较好的密码学性质。
Linear complexity is an important index for measuring the randomness properties of the sequences. Based on the theory of generalized cyclotomic,a newclass of quaternary balanced generalized cyclotomic sequences with period2 pq over finite field F4 is constructed. Using the theory of polynomial roots over finite field,linear complexity is determined by examining the common root of generating polynomial of the sequences and polynomial x2pq- 1 over the algebra closure of F4. The results showthat the newsequence has high linear complexity. It is a good sequence from the viewpoint of cryptography.
出处
《计算机工程》
CAS
CSCD
北大核心
2016年第3期161-164,共4页
Computer Engineering
基金
国家自然科学基金资助项目(61202395
61462077
61562077)
教育部"新世纪优秀人才计划"基金资助项目(NCET-12-0620)
关键词
流密码
伪随机序列
广义分圆
四元序列
线性复杂度
B-M算法
stream cipher
pseudo-random sequence
generalized cyclotomic
quaternary sequences
linear complexity
B-M algorithm
