SLCE序列的2-adic复杂度

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

Abstract

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

CLC Number:

TN918.1

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

Figures/Tables 1

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

2-adic complexity of SLCE sequence

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 1

References 16

Related Articles 15

Metrics

Recommended 0

[1]	Zhaocun ZHOU, Dengguo FENG. Survey on approaches of stream cipher cryptanalysis [J]. Journal on Communications, 2022, 43(11): 183-198.
[2]	Yanhui LU, Han LIU, Hang LI, Guangxu ZHU. Time series generation model based on multi-discriminator generative adversarial network [J]. Journal on Communications, 2022, 43(10): 167-176.
[3]	Baoze MA, Tianqi ZHANG, Zeliang AN, Pan DENG. Convolutive blind source separation method based on tensor decomposition [J]. Journal on Communications, 2021, 42(8): 52-60.
[4]	Xiuping PENG, Hongxiao LI, Shide WANG, Hongbin LIN. Balanced optimal almost binary sequence pairs of period N≡1（mod4） [J]. Journal on Communications, 2021, 42(12): 163-171.
[5]	Chenhuang WU,Chunxiang XU,Xiaoni DU. k-error linear complexity of q-ary sequence of period p² [J]. Journal on Communications, 2019, 40(12): 21-28.
[6]	Ruilin LI,Jiao HU,Chaojing TANG. Collision analysis of the GMR-2 cipher used in the satellite phone [J]. Journal on Communications, 2018, 39(2): 88-95.
[7]	Long-fei LIU,Kai YANG,Xiao-yuan YANG. On the linear complexity of a new generalized cyclotomic sequence with length ^mover GF(h) [J]. Journal on Communications, 2017, 38(9): 39-45.
[8]	Meng MA,Ya-qun ZHAO. Research on linear approximations of simplified Trivium [J]. Journal on Communications, 2016, 37(6): 185-191.
[9]	. The 2-adic complexity and the 1-error 2-adic complexity of single cycle T-functions [J]. Journal on Communications, 2014, 35(3): 15-139.
[10]	Wei YOU,Wen-feng QI. The 2-adic complexity and the 1-error 2-adic complexity of single cycle T-functions [J]. Journal on Communications, 2014, 35(3): 135-139.
[11]	Hai-ying GAO,Chen-hui JIN. Optimal combined distinguisher of stream cipher with multiple independent distinguishing characters [J]. Journal on Communications, 2012, 33(7): 44-48.
[12]	Li-hua DONG,Yu-pu HU,Yong ZENG. Computing on the joint quadratic complexity of multiple periodic sequences [J]. Journal on Communications, 2012, 33(6): 11-18.
[13]	Gang-min TAN,Guang ZENG,Wen-bao HAN,Na ZHANG. Calculation of interval vectors of primitive σ-LFSR sequences [J]. Journal on Communications, 2011, 32(9): 33-37.
[14]	Yang YANG,Guang ZENG. Construction of dynamic linear feedback shift registers in RAKAPOSHI stream cipher [J]. Journal on Communications, 2011, 32(11A): 178-183.
[15]	Feng-rong ZHANG,Yu-pu HU,Hua MA,Min XIE,Jun-tao GAO. Recursive constructions and counting of orthomorphic permutations [J]. Journal on Communications, 2011, 32(11A): 204-208.