The linear complexity of a class of binary sequences with optimal autocorrelation

被引：12
|
作者：
Fan, Cuiling [1 ]
机构：
[1] Southwest Jiaotong Univ, Sch Math, Chengdu 611756, Sichuan, Peoples R China
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2018年 / 86卷 / 10期
关键词：
Binary sequences; Optimal autocorrelation; Linear complexity; Linear span; VALUE/MAGNITUDE;
D O I：
10.1007/s10623-018-0456-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., ), where p is an odd prime with . The objective of this paper is to determine the minimal polynomial and the linear complexity of this class of binary optimal sequences via a sequence polynomial approach. It turns out that this class of sequences has quite good linear complexity.
引用
收藏
页码：2441 / 2450
页数：10
相关论文
共 50 条
  • [1] The linear complexity of a class of binary sequences with optimal autocorrelation
    Cuiling Fan
    Designs, Codes and Cryptography, 2018, 86 : 2441 - 2450
  • [2] The Linear Complexity of Binary Sequences With Optimal Autocorrelation
    Wang, Qi
    Du, Xiaoni
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (12) : 6388 - 6397
  • [3] The Linear Complexity of Binary Sequences with Optimal Autocorrelation
    Wang, Qi
    Du, Xiaoni
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1228 - 1232
  • [4] Linear Complexity of a Class of Quaternary Sequences with Optimal Autocorrelation
    Zhao, Lu
    Xu, Bo
    Cao, Tianqing
    Du, Jiao
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2022, E105A (07) : 1070 - 1081
  • [5] The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation
    Sun, Yuhua
    Yan, Tongjiang
    Li, Hui
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (07) : 1586 - 1592
  • [6] 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
  • [7] The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
    Sun, Yuhua
    Yan, Tongjiang
    Chen, Zhixiong
    Wang, Lianhai
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2020, 12 (04): : 675 - 683
  • [8] 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
  • [9] 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
  • [10] 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
12345