The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

被引：12
|
作者：
Sun, Yuhua [1 ,2 ,3 ]
Yan, Tongjiang [1 ]
Chen, Zhixiong [2 ]
Wang, Lianhai [3 ]
机构：
[1] China Univ Petr, Coll Sci, Qingdao 266555, Shandong, Peoples R China
[2] Putian Univ, Prov Key Lab Appl Math, Putian 351100, Fujian, Peoples R China
[3] Qilu Univ Technol, Shandong Acad Sci, Shandong Prov Key Lab Comp Networks, Natl Supercomp Ctr Jinan,Shandong Comp Sci Ctr, Jinan, Shandong, Peoples R China
来源：
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES | 2020年 / 12卷 / 04期
基金：
国家自然科学基金国际合作与交流项目; 中国国家自然科学基金;
关键词：
Cyclotomic sequence; Interleaved sequence; Optimal autocorrelation; 2-adic complexity; 11; Bxx; LINEAR COMPLEXITY; PERIOD; 4N;
D O I：
10.1007/s12095-019-00411-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on Ding-Helleseth-Lam sequences and interleaving technique (Designs, Codes and Cryptography 86, 1329-1338, 2018). The linear complexity of this class of sequences has been proved to be large enough to resist the B-M Algorithm by Fan (Designs, Codes and Cryptography 86, 2441-2450, 2018). In this paper, we study the 2-adic complexities of these sequences with period 4p and show they are no less than 2p, i.e., its 2-adic complexity is large enough to resist the Rational Approximation Algorithm.
引用
收藏
页码：675 / 683
页数：9
相关论文
共 50 条
  • [1] The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
    Yuhua Sun
    Tongjiang Yan
    Zhixiong Chen
    Lianhai Wang
    Cryptography and Communications, 2020, 12 : 675 - 683
  • [2] Linear complexity and 2-adic complexity of binary interleaved sequences with optimal autocorrelation magnitude
    Wang, Yan
    Cao, Ying
    Heng, Ziling
    Wang, Weiqiong
    AIMS MATHEMATICS, 2022, 7 (08): : 13790 - 13802
  • [3] On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation Magnitude
    Yang, Minghui
    Zhang, Lulu
    Feng, Keqin
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 2915 - 2920
  • [4] The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
    Yuhua Sun
    Qiang Wang
    Tongjiang Yan
    Cryptography and Communications, 2018, 10 : 467 - 477
  • [5] The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
    Sun, Yuhua
    Wang, Qiang
    Yan, Tongjiang
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2018, 10 (03): : 467 - 477
  • [6] 2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude
    Xiao, Zibi
    Zeng, Xiangyong
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2021, 13 (05): : 865 - 885
  • [7] 2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude
    Zibi Xiao
    Xiangyong Zeng
    Cryptography and Communications, 2021, 13 : 865 - 885
  • [8] The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q
    Edemskiy, Vladimir
    Sun, Yuhua
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (02): : 183 - 199
  • [9] The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q
    Vladimir Edemskiy
    Yuhua Sun
    Cryptography and Communications, 2022, 14 : 183 - 199
  • [10] The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude
    Sun, Yuhua
    Yan, Tongjiang
    Wang, Qiuyan
    DESIGNS CODES AND CRYPTOGRAPHY, 2021, 89 (04) : 695 - 707
12345