2-adic complexity of SLCE sequence

Yan WANG; Shunbo LI; Gaina XUE

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

您当前的位置：

首页 >

文章列表页 >

2-adic complexity of SLCE sequence

Papers | 更新时间：2024-06-05

- 2-adic complexity of SLCE sequence
- Journal on Communications Vol. 40, Issue 8, Pages: 151-156(2019)
- 作者机构：
  
  西安建筑科技大学理学院，陕西西安 710055
- 作者简介：
- 基金信息：
  
  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)
- DOI：10.11959/j.issn.1000-436x.2019143
  CLC： TN918.1
- Online First：2019-08，
  
  Published：25 August 2019
- 稿件说明：
移动端阅览
Yan WANG, Shunbo LI, Gaina XUE. 2-adic complexity of SLCE sequence[J]. Journal on Communications, 2019, 40(8): 151-156.
DOI：

Yan WANG, Shunbo LI, Gaina XUE. 2-adic complexity of SLCE sequence[J]. Journal on Communications, 2019, 40(8): 151-156. DOI： 10.11959/j.issn.1000-436x.2019143.

摘要

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

关键词

Keywords

references

SIDELNIKOV V M . Some k-valued pseudo-random and nearly equidistant code [J ] . Problems of Information Transmission , 1969 , 5 ( 1 ): 16 - 22 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

SU M . On the linear complexity of Legendre-Sidelnikov sequences [J ] . Designs Codes ＆ Cryptography , 2015 , 74 ( 3 ): 703 - 717 .

SABAN A , MILLAR G . Character values of the SidelnikovLempel-Cohn-Eastman sequences [J ] . Cryptography ＆ Communications , 2016 , 9 ( 6 ): 1 - 18 .

MYERSON G . Period polynomials and Gauss sums for finite fields [J ] . ACTA Arithmetica , 1981 , 39 ( 3 ): 251 - 264 .

KLAPPER A , GORESKY M . Feedback shift registers,2-adic span,and combiners with memory [J ] . Journal of Cryptology , 1997 , 10 ( 2 ): 111 - 147 .

TIAN T , QI W F . Adic complexity of binary-sequences [J ] . IEEE Transactions on Information Theory , 2010 , 56 ( 1 ): 450 - 454 .

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 .

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 .

DING C S . Stream ciphers and number theory [M ] . Amsterdam : ElsevierPress , 2004 : 113 - 114 .

Views

1769

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

The 2-adic complexity and the 1-error 2-adic complexity of single cycle T-functions

Balanced optimal almost binary sequence pairs of period N≡1（mod4）

k-error linear complexity of q-ary sequence of period p2

Optimal combined distinguisher of stream cipher with multiple independent distinguishing characters

Number of sequences with given linear complexity profiles

Related Author

Wei YOU

Wen-feng QI

Xiuping PENG

Hongxiao LI

Shide WANG

Hongbin LIN

Chenhuang WU

Chunxiang XU

Related Institution

National Digital Switching System Engineering ＆ Technological Research Center

Fourth Institute,PLA Information Engineering University

State Key Laboratory of Mathematical Engineering and Advanced Computing, PLA Information Engineering University

School of Information Science ＆Engineering， Yanshan University

Hebei Province Key Laboratory of Information Transmission and Signal Processing

AI问答

⁰