AN ALGORITHM FOR THE K-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES WITH PERIOD-2(N)

被引：124
|
作者：
STAMP, M [1 ]
MARTIN, CF [1 ]
机构：
[1] TEXAS TECH UNIV,DEPT MATH,LUBBOCK,TX 79409
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1993年 / 39卷 / 04期
基金：
美国国家科学基金会; 美国国家航空航天局;
关键词：
LINEAR COMPLEXITY; K-ERROR LINEAR COMPLEXITY; ALGORITHM;
D O I：
10.1109/18.243455
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Certain applications require pseudo-random sequences which are unpredictable in the sense that recovering more of the sequence from a short segment must be computationally infeasible. It is shown that linear complexity is useful in determining such sequences. A generalized linear complexity which has application to the security of stream ciphers is proposed and an efficient algorithm is given for the case where the sequence is binary with period 2n. This new algorithm generalizes an algorithm due to Games and Chan.
引用
收藏
页码：1398 / 1401
页数：4
相关论文
共 50 条
  • [41] Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity
    Wilfried Meidl
    Harald Niederreiter
    Applicable Algebra in Engineering, Communication and Computing, 2003, 14 : 273 - 286
  • [42] 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
  • [43] Determining the k-error joint linear complexity spectrum for a binary multisequence with period pn
    Li, Fulin
    Zhu, Shixin
    Hu, Honggang
    Jiang, Ting
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2016, 8 (04): : 513 - 523
  • [44] 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
  • [45] On k-error Linear Complexity of Zeng-Cai-Tang-Yang Generalized Cyclotomic Binary Sequences of Period p2
    Wu, Chenhuang
    Xu, Chunxiang
    FRONTIERS IN CYBER SECURITY, 2018, 879 : 9 - 22
  • [46] Periodic sequences with maximal linear complexity and almost maximal k-error linear complexity
    Niederreiter, H
    Shparlinski, IE
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2003, 2898 : 183 - 189
  • [47] ON THE k-ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS
    Zhou, Yuhui
    Han, Yuhui
    Ding, Yang
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2020, 102 (02) : 342 - 352
  • [48] On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences
    Hu, HG
    Feng, DG
    SEQUENCES AND THEIR APPLICATIONS - SETA 2004, 2005, 3486 : 185 - 196
  • [49] 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
  • [50] On the k-Error Linear Complexity of Binary Sequences Derived from the Discrete Logarithm in Finite Fields
    Chen, Zhixiong
    Wang, Qiuyan
    COMPLEXITY, 2019, 2019
12345