Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn

スポンサーリンク

概要

• 論文の詳細を見る

• The linear complexity and its stability of periodic sequences are of fundamental importance as measure indexes on the security of stream ciphers and the k-error linear complexity reveals the stability of the linear complexity properly. Recently, Zhou designed an algorithm for computing the k-error linear complexity of 2pn periodic sequences over GF(q). In this paper, we develop a genetic algorithm to confirm that one can't get the real k-error linear complexity for some sequenes by the Zhou's algorithm. Analysis indicates that the Zhou's algorithm is unreasonable in some steps. The corrected algorithm is presented. Such algorithm will increase the amount of computation, but is necessary to get the real k-error linear complexity. Here p and q are odd prime, and q is a primitive root (modp2).

著者

• Yan Tongjiang

  College Of Mathematics And Computational Science China University Of Petroleum

• YAN Tongjiang

  College of Sciences, China University of Petroleum

• NIU Zhihua

  School of Computer Engineering and Science, Shanghai University

• LI Zhe

  School of Computer Engineering and Science, Shanghai University

• CHEN Zhixiong

  Department of Mathematics, Putian University

関連論文

• Construction of d-Form Sequences with Ideal Autocorrelation
• Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn
• The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation
• Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4
• Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2p^n

スポンサーリンク