On the k-error linear complexity of generalised cyclotomic sequences

被引：0
|
作者：
Liu L. [1 ]
Yang X. [1 ,2 ]
Du X. [2 ]
Wei B. [1 ]
机构：
[1] Key Laboratory of Network and Information Security of APF, Engineering College of APF, Xi'an
[2] Key Laboratory of Computer Network and Information Security of the Ministry of Education, Xidian University, Xi'an
来源：
Liu, Longfei (ya_zhou_521@163.com) | 1600年 / Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland卷 / 09期
关键词：
Generalised cyclotomy; K-error linear complexity; Pseudo-random sequence; Stream cipher;
D O I：
10.1504/IJHPCN.2016.080411
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Generalised cyclotomic binary sequences are divided into Whiteman-generalised cyclotomic and Ding-generalised cyclotomic. Firstly, two classes of error generalised cyclotomic sequences with length pq over Zpq are constructed; secondly, k-error linear complexity of generalised cyclotomic sequences are considered, using the trace representation and cyclotomic theory, respectively. It is shown that k-error linear complexity of generalised cyclotomic sequences do not exceed p + q-1 which is much less than the (zero-error) linear complexity. Copyright © 2016 Inderscience Enterprises Ltd.
引用
收藏
页码：394 / 400
页数：6
相关论文
共 50 条
  • [41] On the k-error linear complexity of 2p2-periodic binary sequences
    Zhihua Niu
    Can Yuan
    Zhixiong Chen
    Xiaoni Du
    Tao Zhang
    Science China Information Sciences, 2020, 63
  • [42] ON k-ERROR LINEAR COMPLEXITY OF PSEUDORANDOM BINARY SEQUENCES DERIVED FROM EULER QUOTIENTS
    Chen, Zhixiong
    Edemskiy, Vladimir
    Ke, Pinhui
    Wu, Chenhuang
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2018, 12 (04) : 805 - 816
  • [43] Cube Theory and k-error Linear Complexity Profile
    Zhou, Jianqin
    Liu, Wanquan
    Wang, Xifeng
    INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS, 2016, 10 (07): : 169 - 184
  • [44] Modified Berlekamp-Massey Algorithm for approximating the k-error linear complexity of binary sequences
    Alecu, Alexandra
    Salagean, Ana
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2007, 4887 : 220 - 232
  • [45] On the k-error linear complexity of 2p~2-periodic binary sequences
    Zhihua NIU
    Can YUAN
    Zhixiong CHEN
    Xiaoni DU
    Tao ZHANG
    ScienceChina(InformationSciences), 2020, 63 (09) : 263 - 276
  • [46] An Approximation Algorithm for Computing the k-error Linear Complexity of Sequences Using the Discrete Fourier Transform
    Alecu, Alexandra
    Salagean, Ana
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2414 - 2418
  • [47] ON THE k-ERROR LINEAR COMPLEXITY FOR pn-PERIODIC BINARY SEQUENCES VIA HYPERCUBE THEORY
    Zhou, Jianqin
    Liu, Wanquan
    Wang, Xifeng
    Zhou, Guanglu
    MATHEMATICAL FOUNDATIONS OF COMPUTING, 2019, 2 (04): : 279 - 297
  • [48] On the k-Error Linear Complexity of Binary Sequences Derived from the Discrete Logarithm in Finite Fields
    Chen, Zhixiong
    Wang, Qiuyan
    COMPLEXITY, 2019, 2019
  • [49] Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences
    Kavuluru, Ramakanth
    Klapper, Andrew
    SELECTED AREAS IN CRYPTOGRAPHY, 2009, 5381 : 151 - 164
  • [50] On the k-error linear complexity of sequences with period 2pn over GF(q)
    Jianqin Zhou
    Designs, Codes and Cryptography, 2011, 58 : 279 - 296
12345