Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4

被引：0
作者：
Li, Xiaoping [1 ,2 ]
Ma, Wenping [1 ]
Yan, Tongjiang [2 ]
Zhao, Xubo [1 ,2 ]
机构：
[1] Xidian Univ, State Key Lab ISN, Xian 710071, Shanxi, Peoples R China
[2] China Univ Petr, Coll Sci, Qingdao 266580, Shandong, Peoples R China
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2013年 / E96A卷 / 01期
基金：
中国国家自然科学基金;
关键词：
generalized cyclotomic sequences; linear complexity; cryptography; minimal polynomial; LENGTH PQ;
D O I：
10.1587/transfun.E96.A.363
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this letter we propose a new Whiteman generalized cyclotomic sequence of order 4. Meanwhile, we determine its linear complexity and minimal polynomial. The results show that this sequence possesses both high linear complexity and optimal balance on 1 s and 0 s, which may be attractive for cryptographic applications.
引用
收藏
页码：363 / 366
页数：4
相关论文
共 50 条
  • [41] On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p m
    Ke, Pinhui
    Zhang, Jie
    Zhang, Shengyuan
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2013, 67 (03) : 325 - 339
  • [42] On error linear complexity of new generalized cyclotomic binary sequences of period p2
    Wu, Chenhuang
    Xu, Chunxiang
    Chen, Zhixiong
    Ke, Pinhui
    [J]. INFORMATION PROCESSING LETTERS, 2019, 144 : 9 - 15
  • [43] Linear Complexity of Generalized Cyclotomic Quaternary Sequences with Period pq
    Li, Dan-dan
    Wen, Qiao-yan
    Zhang, Jie
    Chang, Zu-ling
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (05) : 1153 - 1158
  • [44] Linear Complexity of New Generalized Cyclotomic Sequences of Length 2pq
    王宏伟
    葛武
    [J]. TransactionsofNanjingUniversityofAeronauticsandAstronautics, 2014, 31 (06) : 710 - 716
  • [45] The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods pn and 2pn
    Vladimir Edemskiy
    Nikita Sokolovskiy
    [J]. Cryptography and Communications, 2022, 14 : 395 - 414
  • [46] The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods pn and 2pn
    Edemskiy, Vladimir
    Sokolovskiy, Nikita
    [J]. CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2022, 14 (02): : 395 - 414
  • [47] On the Linear Complexity of Binary Generalized Cyclotomic Sequences of Period 2pm+1qn+1
    Yang, Minghui
    Lin, Dongdai
    Wang, Qiuyan
    Gao, Jian
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (04) : 676 - 679
  • [48] Linear complexity and trace representation of quaternary sequences over Z4 based on generalized cyclotomic classes modulo pq
    Chen, Zhixiong
    [J]. CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (04): : 445 - 458
  • [49] The linear complexity of generalized cyclotomic sequences with period 2pn
    Edemskiy, Vladimir
    Antonova, Olga
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2014, 25 (03) : 213 - 223
  • [50] Linear complexity of generalized cyclotomic sequences of period 2pm
    Ouyang, Yi
    Xie, Xianhong
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (11) : 2585 - 2596
12345