A fast algorithm for the linear complexity of periodic sequences

被引：0
|
作者：
Wei, SM [1 ]
Chen, Z
Wang, Z
机构：
[1] Huaibei Coal Normal Coll, Dept Comp Sci & Technol, Huaibei 235000, Peoples R China
[2] Peking Univ, Dept Comp Sci & Technol, Beijing 100871, Peoples R China
来源：
CHINESE JOURNAL OF ELECTRONICS | 2004年 / 13卷 / 01期
关键词：
cryptography; stream cipher; periodic sequence; linear complexity; minimal polynomial; fast algorithm;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
An efficient algorithm for determining the linear complexity and the minimal polynomial of a sequence with period 2p(m)q(n) over a finite field GF(q) is proposed, where p and q are primes, and q is a primitive root modulo p(2). The new algorithm generalizes the algorithm for computing the linear complexity of a sequence with period q(n) over GF(q) and the algorithm for computing one of a sequence with period 2p(m) over GF(q).
引用
收藏
页码：86 / 91
页数：6
相关论文
共 50 条
  • [31] On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients
    LUO Bingyu
    ZHANG Jingwei
    ZHAO Chang'an
    Chinese Journal of Electronics, 2023, 32 (02) : 262 - 272
  • [32] FAST ADAPTIVE PARAFAC DECOMPOSITION ALGORITHM WITH LINEAR COMPLEXITY
    Viet-Dung Nguyen
    Abed-Meraim, Karim
    Nguyen Linh-Trung
    2016 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING PROCEEDINGS, 2016, : 6235 - 6239
  • [33] Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences
    Chee, Yeow Meng
    Chrisnata, Johan
    Etzion, Tuvi
    Kiah, Han Mao
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 2897 - 2902
  • [34] Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity
    Troyanskaya, OG
    Arbell, O
    Koren, Y
    Landau, GM
    Bolshoy, A
    BIOINFORMATICS, 2002, 18 (05) : 679 - 688
  • [35] Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games-Chan algorithm
    Meidl, Wilfried
    DESIGNS CODES AND CRYPTOGRAPHY, 2008, 46 (01) : 57 - 65
  • [36] Cube Theory and Stable k-Error Linear Complexity for Periodic Sequences
    Zhou, Jianqin
    Liu, Wanquan
    Zhou, Guanglu
    INFORMATION SECURITY AND CRYPTOLOGY, INSCRYPT 2013, 2014, 8567 : 70 - 85
  • [37] On the k-error linear complexity of pm-periodic binary sequences
    Han, Yun Kyoung
    Chung, Jin-Ho
    Yang, Kyeongcheol
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) : 2297 - 2304
  • [38] New Results on Periodic Sequences With Large k-Error Linear Complexity
    Hu, Honggang
    Gong, Guang
    Feng, Dengguo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (10) : 4687 - 4694
  • [39] Remarks on the k-error linear complexity of pn-periodic sequences
    Meidl, Wilfried
    Venkateswarlu, Ayineedi
    DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (02) : 181 - 193
  • [40] Remarks on the k-error linear complexity of pn-periodic sequences
    Wilfried Meidl
    Ayineedi Venkateswarlu
    Designs, Codes and Cryptography, 2007, 42 : 181 - 193
12345