On the Randomness of the Editing Generator(Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• In their paper, G. Gong and S.Q. Jiang construct a new pseudo-random sequence generator by using two ternary linear feedback shift registers (LFSR). The new generator is called an editing generator which a combined model of the clock-controlled generator and the shrinking generator. For a special case (Both the base sequence and the control sequence are mm-sequence of degree ri), the period, linear complexity, symbol distribution and security analysis are discussed in the same article. In this paper, we expand the randomness results of the edited sequence for general cases, we do not restrict the base sequence and the control sequence has the same length. For four special cases of this generator, the randomness of the edited sequence is discussed in detail. It is shown that for all four cases the editing generator has good properties, such as large periods, high linear complexities, large ratio of linear complexity per symbol, and small un-bias of occurrences of symbol. All these properties make it necessary to resist to the attack from the application of Berlekamp-Massey algorithm.

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

著者

• Niu Zhihua

  Isn National Key Laboratories Xidian University

• BAI Enjian

  School of Communications, Donghua University

• XIAO Guozhen

  ISN National Key Laboratory, Xidian University

• BAI Enjian

  ISN National Key Laboratories, Xidian University

• Niu Zhihua

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

• Bai Enjian

  Isn National Key Laboratories Xidian University

• Xiao Guozhen

  Xidian Univ. Shaanxi Chn

• 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

スポンサーリンク