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 Second Descent Points for the K-Error Linear Complexity of 2n-Periodic Binary Sequences
    Zhou, Jianqin
    Wang, Xifeng
    Liu, Wanquan
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INFORMATION MANAGEMENT AND NETWORK SECURITY, 2016, 47 : 311 - 314
  • [42] An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform
    Salagean, Ana
    Alecu, Alexandra
    SEQUENCES AND THEIR APPLICATIONS-SETA 2010, 2010, 6338 : 151 - +
  • [43] An algorithm for the k-error linear complexity of sequences over GF( pm) with period pn, p a prime
    Kaida, T
    Uehara, S
    Imamura, K
    INFORMATION AND COMPUTATION, 1999, 151 (1-2) : 134 - 147
  • [44] A typical profile of the k-error linear complexity for balanced binary sequences with period 2n
    Kaida, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (01) : 311 - 313
  • [45] On the k-error linear complexity of sequences with period 2pn over G F (q)
    Zhou, Jianqin
    DESIGNS CODES AND CRYPTOGRAPHY, 2011, 58 (03) : 279 - 296
  • [46] Improvements on k-error linear complexity of q-ary sequences derived from Euler quotients
    Edemskiy, Vladimir
    Wu, Chenhuang
    Xu, Chunxiang
    CRYPTOLOGIA, 2022, 46 (02) : 148 - 166
  • [47] An Efficient Algorithm for Determining the k-error Linear Complexity of Binary Sequences with Periods 2p(n)
    Wei, Shimin
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2008, 8 (04): : 221 - 224
  • [48] Multisequences With Large Linear and k-Error Linear Complexity From Hermitian Function Fields
    Xing, Chaoping
    Ding, Yang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (08) : 3858 - 3863
  • [49] On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p
    Wu, Chenhuang
    Edemskiy, Vladimir
    Xu, Chunxiang
    IEEE ACCESS, 2020, 8 : 51477 - 51481
  • [50] On the k-error sequences of 2n-periodic binary sequences
    Department of Applied Mathematics, Zhengzhou Information Engineering University, Zhengzhou 450002, China
    Dianzi Yu Xinxi Xuebao, 2008, 11 (2592-2595): : 2592 - 2595
12345