SLCE序列的2-adic复杂度

doi:10.11959/j.issn.1000-436x.2019143

通信学报 ›› 2019, Vol. 40 ›› Issue (8): 151-156.doi: 10.11959/j.issn.1000-436x.2019143

SLCE序列的2-adic复杂度

王艳,李顺波,薛改娜

西安建筑科技大学理学院，陕西西安 710055

修回日期:2019-05-21 出版日期:2019-08-25 发布日期:2019-08-30
作者简介:王艳（1982- ），女，陕西三原人，博士，西安建筑科技大学副教授，主要研究方向为序列密码。|李顺波（1979- ），男，陕西周至人，博士，西安建筑科技大学副教授，主要研究方向为数字签名和序列密码。|薛改娜（1992- ），女，陕西渭南人，西安建筑科技大学硕士生，主要研究方向为序列密码。
基金资助:
西安建筑科技大学自然科学专项基金资助项目(1609718034);国家自然科学基金资助项目(11471255);西安建筑科技大学校人才基金资助项目(RC1221)

2-adic complexity of SLCE sequence

Yan WANG,Shunbo LI,Gaina XUE

School of Science,Xi’ an University of Architecture and Technology,Xi’ an 710055,China

Revised:2019-05-21 Online:2019-08-25 Published:2019-08-30
Supported by:
The Natural Science Foundation of Xi’an University of Architectural Science and Technology(1609718034);The National Natural Science Foundation of China(11471255);The Talent Fund of Xi’an University of Architectural Science and Technology(RC1221)

摘要/Abstract

摘要：

针对SLCE序列的2-adic复杂度，首先利用分圆数获得此类序列的自相关函数值，根据2-adic复杂度与自相关函数的关系分析了序列2-adic复杂度取值特点，结合SLCE序列的自相关函数值与周期的最大公因子，给出了一个SLCE序列2-adic复杂度达到最大值的条件。结果表明很多有限域上的SLCE序列的2-adic复杂度可达到最大值。

关键词: 序列密码, Sidelnikov-Lempel-Cohn-Eastman序列, 2-adic复杂度, 自相关性

Abstract:

Aiming at the 2-adic complexity of Sidelnikov-Lempel-Cohn-Eastman sequences,autocorrelation function value of this kind of sequence was obtained by using the cyclotomic number.Based on the relationship between 2-adic complexity and autocorrelation function,properties of 2-adic complexity value were analyzed.According to the greatest common divisor between the autocorrelation function value and the period of SLCE sequence,the condition that the 2-adic complexity of a SLCE sequence reaches its maximum value was given.The results show that 2-adic complexity of SLCE sequence on many finite field can reach the maximum value.

Key words: stream cipher, Sidelnikov-Lempel-Cohn-Eastman sequence, 2-adic complexity, autocorrelation

中图分类号:

TN918.1

王艳,李顺波,薛改娜. SLCE序列的2-adic复杂度[J]. 通信学报, 2019, 40(8): 151-156.

Yan WANG,Shunbo LI,Gaina XUE. 2-adic complexity of SLCE sequence[J]. Journal on Communications, 2019, 40(8): 151-156.

图/表 1

参考文献 16

[1]	SIDELNIKOV V M . Some k-valued pseudo-random and nearly equidistant code[J]. Problems of Information Transmission, 1969,5(1): 16-22.
[2]	LEMPEL A , COHN M , EASTMAN W L . A class of balanced binary sequences with optimal autocorrelation properties[J]. IEEE Transactions on Information Theory, 1977,23(1): 38-42.
[3]	KYUREGHYAN G M , POTT A . On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences[J]. Designs Codes ＆Cryptography, 2003,49(1-3): 149-164.
[4]	HELLESETH H , KIM S H , NO J S . Linear complexity over F_p and trace representation of Lembel-Cohn-Eastman sequences[J]. IEEE Transactions on Information Theory, 2003,49(6): 1548-1552.
[5]	HELLESETH H , MAAS M , MATHIASSN J E ,et al. Linear complexity over F_p of Sidel’nikov sequences[J]. IEEE Transactions on Information Theory, 2004,50(10): 2468-2472.
[6]	MEIDL W , WINTERHOF A . Some notes on the linear complexity of Sidel’nikov-Lempel-Cohn-Eastman sequences[J]. Designs Codes ＆Cryptography, 2006,38(2): 159-178.
[7]	EUN Y C , SONG H Y , KYUREGHYAN G M . One-error linear complexity over F_p of Sidelnikov sequences[C]// International Conference on Algorithmic Applications in Management. Springer, 2004, 154-165.
[8]	GARAEV M Z , LUCA F , SHPARLINSKI I E ,et al. On the lower bound of the linear complexity over F_p of Sidelnikov sequences[J]. IEEE Transactions on Information Theory, 2006,52(7): 3299-3304.
[9]	SU M . On the linear complexity of Legendre-Sidelnikov sequences[J]. Designs Codes ＆ Cryptography, 2015,74(3): 703-717.
[10]	SABAN A , MILLAR G . Character values of the SidelnikovLempel-Cohn-Eastman sequences[J]. Cryptography ＆ Communications, 2016,9(6): 1-18.
[11]	MYERSON G . Period polynomials and Gauss sums for finite fields[J]. ACTA Arithmetica, 1981,39(3): 251-264.
[12]	KLAPPER A , GORESKY M . Feedback shift registers,2-adic span,and combiners with memory[J]. Journal of Cryptology, 1997,10(2): 111-147.
[13]	TIAN T , QI W F . Adic complexity of binary-sequences[J]. IEEE Transactions on Information Theory , 2010,56(1): 450-454.
[14]	XIONG H , QU L , LI C . A new method to compute the 2-adic complexity of binary sequences[J]. IEEE Transactions on Information Theory, 2014,60(4): 2399-2406.
[15]	HU H G . Comments on “a new method to compute the 2-adic complexity of binary sequences”[J]. IEEE Transactions on Information Theory, 2014,60(9): 5803-5804.
[16]	DING C S . Stream ciphers and number theory[M]. Amsterdam: ElsevierPress, 2004: 113-114.

SLCE序列的2-adic复杂度

2-adic complexity of SLCE sequence

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献 16

相关文章 12

Metrics

推荐阅读 0

[1]	彭秀平, 李红晓, 王仕德, 林洪彬. 周期为N≡1（mod4）的平衡最优几乎二元序列对[J]. 通信学报, 2021, 42(12): 163-171.
[2]	吴晨煌,许春香,杜小妮. 周期为p²的q元序列的k–错线性复杂度[J]. 通信学报, 2019, 40(12): 21-28.
[3]	游伟,戚文峰. 单圈T-函数的2-adic复杂度和1-错2-adic复杂度[J]. 通信学报, 2014, 35(3): 135-139.
[4]	游伟1，戚文峰2,3. 单圈T-函数的2-adic复杂度和1-错2-adic复杂度[J]. 通信学报, 2014, 35(3): 15-139.
[5]	高海英,金晨辉. 基于多个独立区分特征的序列密码最优联合区分器[J]. 通信学报, 2012, 33(7): 44-48.
[6]	谭刚敏,曾光,韩文报,张娜. 本原σ-LFSR序列距离向量的计算[J]. 通信学报, 2011, 32(9): 33-37.
[7]	杨阳,曾光. 序列密码算法RAKAPOSHI的动态移存器构造[J]. 通信学报, 2011, 32(11A): 178-183.
[8]	李鹤龄,戚文峰. F_p上pⁿ-周期序列的k-错误序列[J]. 通信学报, 2010, 31(6): 19-24.
[9]	谭林,戚文峰. 2^p周期二元序列的线性复杂度和k错线性复杂度[J]. 通信学报, 2008, 29(7): 44-49.
[10]	罗永龙,戚文峰. Klimov-Shamir T-函数的代数结构[J]. 通信学报, 2008, 29(10): 143-148.
[11]	刘训寿,戚文峰. 给定线性复杂度谱的序列的条数[J]. 通信学报, 2006, 27(12): 10-13.
[12]	陈兰芳,戚文峰. 周期为2^mpⁿ的二元序列的2-adic复杂度[J]. 通信学报, 2005, 26(6): 6-10.