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 条
  • [21] 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
  • [22] 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
  • [23] Further Investigations on Nonlinear Complexity of Periodic Binary Sequences
    Yuan, Qin
    Li, Chunlei
    Zeng, Xiangyong
    Helleseth, Tor
    He, Debiao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (07) : 5376 - 5391
  • [24] Algorithm for Computing the k-error Linear Complexity and the Corresponding Error Sequence of 2p(n)-periodic Sequences over GF(q)
    Niu Zhihua
    Kong Deyu
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2018, 40 (07) : 1723 - 1730
  • [25] Periodic sequences with large k-error linear complexity
    Niederreiter, H
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (02) : 501 - 505
  • [26] Linear complexity of Ding generalized cyclotomic sequences
    闫统江
    陈智雄
    肖国镇
    Advances in Manufacturing, 2007, (01) : 22 - 26
  • [27] Linear complexity of generalized cyclotomic sequences with period
    Du X.-N.
    Yan T.-J.
    Shi Y.-F.
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2010, 32 (04): : 821 - 824
  • [28] On the linear complexity of the sequences generated by nonlinear filterings
    García-Villalba, LJ
    Fúster-Sabater, A
    INFORMATION PROCESSING LETTERS, 2000, 76 (1-2) : 67 - 73
  • [29] Fast algorithms for determining the linear complexity of sequences over GF (pm) with period 2tn
    Chen, H
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (05) : 1854 - 1856
  • [30] An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences
    Fuster-Sabater, Amparo
    Requena, Veronica
    Cardell, Sara D.
    MATHEMATICS, 2022, 10 (05)
12345