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 条
  • [21] On the k-error linear complexity of cyclotomic sequences
    Aly, Hassan
    Meidl, Wilfried
    Winterhof, Arne
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2007, 1 (03) : 283 - 296
  • [22] A genetic algorithm for computing complexity of cryptographic the k-error linear sequences
    Alecu, A.
    Salagean, A. M.
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 3569 - 3576
  • [23] 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
  • [24] On the k-error linear complexity of binary sequences derived from polynomial quotients
    CHEN ZhiXiong
    NIU ZhiHua
    WU ChenHuang
    ScienceChina(InformationSciences), 2015, 58 (09) : 83 - 97
  • [25] On the k-error linear complexity of binary sequences derived from polynomial quotients
    Chen ZhiXiong
    Niu ZhiHua
    Wu ChenHuang
    SCIENCE CHINA-INFORMATION SCIENCES, 2015, 58 (09) : 1 - 15
  • [26] On the k-error linear complexity of sequences with period pn over GF(q)
    Zhou, Jianqin
    Shangguan, Cheng
    2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS, 2008, : 267 - +
  • [27] 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
  • [28] An efficient algorithm for k-error linear complexity
    Wei, SM
    Xiao, GZ
    Chen, Z
    CHINESE JOURNAL OF ELECTRONICS, 2002, 11 (02): : 265 - 267
  • [29] 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):
  • [30] 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