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 条
  • [31] Two constructions of binary sequences with optimal autocorrelation magnitude
    Krengel, E. I.
    Ivanov, P. V.
    ELECTRONICS LETTERS, 2016, 52 (17) : 1457 - 1458
  • [32] Interleaved construction of binary sequences with optimal autocorrelation magnitude
    Yu, Nam Yul
    Gong, Guang
    PROCEEDINGS OF 2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 530 - +
  • [33] 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences with Order 4
    Du, Xiaoni
    Zhao, Liping
    Niu, Zhihua
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (11) : 1566 - 1570
  • [34] On the Linear Complexity of Binary Sequences of Period 4N With Optimal Autocorrelation Value/Magnitude
    Li, Nian
    Tang, Xiaohu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (11) : 7597 - 7604
  • [35] A Fog Computing Security: 2-Adic Complexity of Balanced Sequences
    Hui-Juan, Wang
    Yong, Jiang
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2018,
  • [36] Joint k-error 2-adic complexity for binary periodic multi-sequences
    Dong, Li-Hua
    Hu, Yu-Pu
    Zeng, Yong
    Jisuanji Xuebao/Chinese Journal of Computers, 2009, 32 (06): : 1134 - 1139
  • [37] New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
    Tang, Xiaohu
    Gong, Guang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (03) : 1278 - 1286
  • [38] Fourier transforms and the 2-adic span of periodic binary sequences
    Goresky, M
    Klapper, AM
    Washington, L
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 687 - 691
  • [39] Fourier transforms and the 2-adic span of periodic binary sequences
    Goresky, M
    Klapper, A
    Washington, L
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 102 - 102
  • [40] On the 2-Adic Complexity of Cyclotomic Binary Sequences with Period p2 and 2p2
    Sun, Fuqing
    Yue, Qin
    Li, Xia
    ARITHMETIC OF FINITE FIELDS, WAIFI 2022, 2023, 13638 : 334 - 347
12345