节点文献
周期为p~m的广义割圆序列线性复杂度研究
Study of Linear Complexity of Generalized Cyclotomic Sequences with Period p~m
【摘要】 针对广义割圆序列的构造问题,提出周期为pm的任意阶广义割圆序列的构造方法,应用有限域GF(2)上多项式根的理论,分析该类序列线性复杂度所有可能的取值。结果表明,该序列具有较好的线性复杂度,能抗击B-M算法,可用于推广现有的周期为pm序列的相关研究,并对已有文献中的部分错误证明进行订正。
【Abstract】 According to the construction of generalized cyclotomic sequences,this paper propose a construction method of generalized cyclotomic sequences with period pmof arbitrary order.It uses the theory of polynomial root over finite fields GF(2).All the possible values of linear complexity of sequences are obtained.Results show that the new sequence has larger linear complexity and can resist the attack by B-M algorithm.The sequence generalizes the existed construction,and also revises some incorrect proof in the literature.
【关键词】 流密码;
有限域;
广义割圆序列;
线性复杂度;
极小多项式;
【Key words】 stream cipher; finite field; generalized cyclotomic sequence; linear complexity; minimal polynomial;
【Key words】 stream cipher; finite field; generalized cyclotomic sequence; linear complexity; minimal polynomial;
【基金】 国家自然科学基金资助项目(61063041,61202395);甘肃省自然科学基金资助项目(1208RJZA255);教育部“新世纪优秀人才计划”基金资助项目(NCET-12-0620);福建省高等学校新世纪优秀人才支持计划基金资助项目(JK2010047)
- 【文献出处】 计算机工程 ,Computer Engineering , 编辑部邮箱 ,2013年07期
- 【分类号】TN918.1
- 【被引频次】6
- 【下载频次】62