Analysis of the Linear Complexity and Its Stability for 2p^n-Periodic Binary Sequences(Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• 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. The k-error linear complexity of periodic sequences is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. For 2p^n-periodic binary sequences, where p is an odd prime and 2 is a primitive root modulo p^2, we present and prove the unique expression of the linear complexity. Moreover we show a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.

• 社団法人電子情報通信学会の論文
• 2005-09-01

著者

• Niu Zhihua

  Isn National Key Laboratories Xidian University

• XIAO Guozhen

  ISN National Key Laboratory, Xidian University

• Niu Zhihua

  Isn National Key Lab Xidian University:school Of Computer Technology And Science Shanghai University

• Xiao Guozhen

  Isn National Key Lab Xidian University

関連論文

• The Stability of the Lattice Structure of Pseudorandom Number Sequences(Information Security)
• On the Randomness of the Editing Generator(Information Security)
• Analysis of the Linear Complexity and Its Stability for 2p^n-Periodic Binary Sequences(Information Security)
• Autocorrelation and Linear Complexity of the New Generalized Cyclotomic Sequences(Information Security)
• On the Randomness of Generalized Cyclotomic Sequences of Order Two and Length pq(Information Security)
• Construction of d-Form Sequences with Ideal Autocorrelation

スポンサーリンク