周期为2pq的四元序列线性复杂度研究

doi:10.3969/j.issn.1000-3428.2016.03.029

计算机工程

周期为2pq的四元序列线性复杂度研究

魏万银,杜小妮,王国辉

(西北师范大学数学与统计学院,兰州 730070)

收稿日期:2015-01-28 出版日期:2016-03-15 发布日期:2016-03-15
作者简介:魏万银(1989-),女,硕士研究生,主研方向为密码学;杜小妮,教授、博士;王国辉,硕士研究生。
基金资助:
国家自然科学基金资助项目(61202395,61462077);教育部“新世纪优秀人才计划”基金资助项目(NCET-12-0620)。

Research on Linear Complexity of Quaternary Sequences with Period 2pq

WEI Wanyin,DU Xiaoni,WANG Guohui

(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)

Received:2015-01-28 Online:2016-03-15 Published:2016-03-15

摘要/Abstract

摘要：

线性复杂度是度量序列随机性的一个重要指标。基于广义分圆理论,在有限域F4上构造一类周期为2pq的四元平衡广义分圆序列。利用有限域上多项式根理论,通过分析序列的生成多项式与x2pq－1在F4代数闭包中公共根的个数,确定其线性复杂度的精确值。分析结果表明,新序列有较高的线性复杂度和较好的密码学性质。

关键词: 流密码, 伪随机序列, 广义分圆, 四元序列, 线性复杂度, B-M算法

Abstract:

Linear complexity is an important index for measuring the randomness properties of the sequences.Based on the theory of generalized cyclotomic,a new class of quaternary balanced generalized cyclotomic sequences with period 2pq 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 show that the new sequence has high linear complexity.It is a good sequence from the viewpoint of cryptography.

Key words: stream cipher, pseudo-random sequence, generalized cyclotomic, quaternary sequences, linear complexity, B-M algorithm

中图分类号:

TN918.4

魏万银,杜小妮,王国辉. 周期为2pq的四元序列线性复杂度研究[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2016.03.029.

WEI Wanyin,DU Xiaoni,WANG Guohui. Research on Linear Complexity of Quaternary Sequences with Period 2pq[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2016.03.029.

https://www.ecice06.com/CN/Y2016/V42/I3/161

参考文献

参考文献［1］Golomb S W,Guang Gong.Signal Design for Good Correlation for Wireless Communication［M］.Cambridge,UK:Cambridge University Press,2005. ［2］石永芳,杜小妮,闫统江,等.周期为pm的广义割圆序列线性复杂度研究［J］.计算机工程,2013,39(7):189192. ［3］杜小妮,肖国镇.周期为p≡7(mod 8)的一类新六次剩余序列的迹表示［J］.计算机工程,2007,33(7):2122. ［4］Ding Cunsheng,Hellseth T.On the Linear Complexity of Legendre Sequences［J］.IEEE Transactions on Information Theory,1998,44(1):12761278. ［5］Ding Cunsheng,Hellseth T.Generalized Cyclotomic Codes of Length pe11pe22…pett［J］.IEEE Transactions on Information Theory,1999,45(2):467474. ［6］Yan Tongjiang,Sun Rong,Xiao Guozhen.Autocorrelation and Linear Complexity of the New Generalized Cyclotomic Sequences［J］.IEICE Transactions on Fundamentals,2007,90(4):857864. ［7］Kim Youngjoon,Jin Seokyong.Linear Complexity and Autocorrelation of Prime Cube Sequences［J］.Applied Algebra and Error Correcting Codes,2007,18(1):188197. ［8］Du Xiaoni,Chen Zhixiong.Linear Complexity of Quaternary Sequence Generated Using Generalized Cyclotomic Classes Modulo 2p［J］.IEICE Transactions on Fundamentals,2011,94(5):12141217. ［9］Ke Pinhui.New Classes of Quaternary Cyclotomic Sequence of Length 2pmwith High Linear Complexity［J］.Information Processing Letters,2012,112(16):646650. ［10］Chang Zuling,Li Dandan.On the Linear Complexity of Quaternary Cyclotomic Sequences with the Period 2pq［J］.IEICE Transactions on Fundamentals,2014,97(2):679684. ［11］Massey J L.Shift Register Synthesis and BCH Decoding［J］.IEEE Transactions on Information Theory,1969,15(1):122127. ［12］Burton D M.Elementary Number Theory［M］.New York,USA:McGrawHill International Editions,1998. ［13］Nathanson M B.Elementary Methods in Number Theory［M］.New York,USA:McGrawHill International Editions,2003. ［14］Yan Tongjiang,Li Shengqiang,Xiao Guozhen.On the Linear Complexity of Generalized Cyclotomic Sequences with the Period pm［J］.Application of Mathematics,2008,21(2):187193. ［15］Vladimir E.About Computation of the Linear Complexity of Generalized Cyclotomic Sequences with the Period pn+1［J］.Designs,Codes and Cryptography,2011,61(3):251260. ［16］Zhang Jingwei,Zhao Chang’an,Ma Xiao.Linear Complexity of Generalized Cyclotomic Binary Sequences with the Period 2pm［J］.Applied Algebra and Error Correcting Codes,2010,21(2):93108. ［17］Ke Pinhui,Zhang Jie,Zhang Shengyuan.On the linear Complexity and the Autocorrelation of Generalized Cyclotomic Binary Sequences with the Period 2pm［J］.Designs,Codes and Cryptography,2013,67(3):325339. ［18］Ding Cunsheng.Linear Complexity of Generalized Cyclotomic Binary Sequences of Order2［J］.Finite Field and Their Applications,1997,3(2):159174. 编辑顾逸斐

[1]	夏文涛, 潘森杉, 王良民. 一种面向RFID的超轻量级流密码算法[J]. 计算机工程, 2019, 45(10): 144-149.
[2]	丁杰,石会,龚晶,邓元庆. 一种抗滑动攻击的密钥流提取改进算法[J]. 计算机工程, 2018, 44(2): 158-162.
[3]	叶婷,陈克非,沈忠华,孟倩,张文政. 扩展的Welch-Gong序列构造与分析[J]. 计算机工程, 2016, 42(8): 101-106.
[4]	戴小平,毕松松,王喜凤,周建钦. k错线性复杂度具有第二下降点的2n周期序列[J]. 计算机工程, 2016, 42(1): 156-162.
[5]	周文倩,马燕,李顺宝,张相芬,张玉萍. 应用于QR码信息加密的RC4改进算法[J]. 计算机工程, 2015, 41(8): 105-109.
[6]	王秋艳，金晨辉. LEX算法的相关密钥攻击[J]. 计算机工程, 2014, 40(4): 141-145,150.
[7]	王荣扬, 钱振华, 殷勇辉. 基于FPGA的互相关无串扰超声测距系统[J]. 计算机工程, 2013, 39(8): 307-313.
[8]	石永芳, 杜小妮, 闫统江, 李旭. 周期为pm的广义割圆序列线性复杂度研究[J]. 计算机工程, 2013, 39(7): 189-192,199.
[9]	李旭, 杜小妮, 张记, 王彩芬. 针对WSN流密码加密方案的代数攻击及改进[J]. 计算机工程, 2013, 39(3): 142-145.
[10]	王锦玲，高鹏歌. GF(3)上的新型自缩控生成器[J]. 计算机工程, 2013, 39(11): 127-130,135.
[11]	李静, 舒永录, 张玉书. 基于混沌映射的图像块加密算法[J]. 计算机工程, 2012, 38(20): 13-16.
[12]	龚洁中, 陈恭亮, 李林森, 李建华. 基于流密码的RFID安全认证协议[J]. 计算机工程, 2012, 38(18): 126-129.
[13]	花文昭, 韩文报. 基于椭圆曲线的二元伪随机序列构造与分析[J]. 计算机工程, 2012, 38(18): 100-102.
[14]	吴盼望, 张善从. 基于移位寄存器的伪随机序列改进算法[J]. 计算机工程, 2012, 38(18): 265-267.
[15]	胡大亮, 曾光, 韩文报, 刘向辉. 本原?-LFSR序列距离向量性质研究[J]. 计算机工程, 2012, 38(13): 105-107.

选择文件类型/文献管理软件名称

选择包含的内容

周期为2pq的四元序列线性复杂度研究

Research on Linear Complexity of Quaternary Sequences with Period 2pq

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

周期为2pq的四元序列线性复杂度研究

Research on Linear Complexity of Quaternary Sequences with Period 2pq

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价