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 条
  • [31] AN ALGORITHM FOR THE K-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES WITH PERIOD-2(N)
    STAMP, M
    MARTIN, CF
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) : 1398 - 1401
  • [32] 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
  • [33] Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn
    Niu, Zhihua
    Li, Zhe
    Chen, Zhixiong
    Yan, Tongjiang
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (09) : 1637 - 1641
  • [34] 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
  • [35] 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
  • [36] 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
  • [37] 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
  • [38] 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
  • [39] The Distribution of 2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity
    Pan, Wenlun
    Bao, Zhenzhen
    Lin, Dongdai
    Liu, Feng
    INFORMATION SECURITY PRACTICE AND EXPERIENCE, ISPEC 2016, 2016, 10060 : 13 - 36
  • [40] 2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity for k=2 or 3
    Kavuluru, Ramakanth
    SEQUENCES AND THEIR APPLICATIONS - SETA 2008, 2008, 5203 : 252 - 265
12345