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 条
  • [1] Fast algorithm for determining the linear complexity in periodic sequences
    Zhou, Jianqin
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2007, 35 (02): : 43 - 46
  • [2] A fast algorithm for determining the linear complexity of periodic sequences
    Wei, SM
    Chen, GL
    Xia, GZ
    INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 2005, 3822 : 202 - 209
  • [3] A fast algorithm for determining the linear complexity of periodic sequences over GF(3)
    Zhou, Jianqin
    Zheng, Qiang
    CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS, 2006, 4301 : 213 - +
  • [4] On the calculation of the linear complexity of periodic sequences
    Aly, Hassan
    Marzouk, Radwa
    Meidl, Wilfried
    FINITE FIELDS: THEORY AND APPLICATIONS, 2010, 518 : 11 - +
  • [5] THE DISTRIBUTION FUNCTIONS FOR THE LINEAR COMPLEXITY OF PERIODIC SEQUENCES
    Yang Minghui Zhu Shixin School of Computer Information Hefei University of Technology Hefei China School of Mathematics Hefei University of Technology Hefei China
    JournalofElectronics(China), 2012, 29(Z2) (China) : 211 - 214
  • [6] THE DISTRIBUTION FUNCTIONS FOR THE LINEAR COMPLEXITY OF PERIODIC SEQUENCES
    Yang Minghui* Zhu Shixin* ** *(School of Computer & Information
    Journal of Electronics(China), 2012, (Z2) : 211 - 214
  • [7] A Matrix Algebra for the Linear Complexity of Periodic Sequences
    Ma, Chingwo
    THIRD INTERNATIONAL CONFERENCE ON INFORMATION SECURITY AND INTELLIGENT CONTROL (ISIC 2012), 2012, : 17 - 20
  • [8] A Hybrid Genetic Algorithm for Computing the k-Error Linear Complexity of Periodic Sequences
    Niu Z.
    Yuan C.
    Kong D.
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2020, 54 (06): : 599 - 606
  • [9] Error Decomposition Algorithm for Approximating the k-Error Linear Complexity of Periodic Sequences
    Yu, Fangwen
    Su, Ming
    Wang, Gang
    Ren, Mingming
    2016 IEEE TRUSTCOM/BIGDATASE/ISPA, 2016, : 505 - 510
  • [10] Periodic sequences with maximal linear complexity and large k-error linear complexity
    Meidl, W
    Niederreiter, H
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2003, 14 (04) : 273 - 286
12345