Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus

スポンサーリンク

概要

• 論文の詳細を見る

• We define a family of 2e+1-periodic binary threshold sequences and a family of p2-periodic binary threshold sequences by using Carmichael quotients modulo 2e(e>2) and 2p (p is an odd prime), respectively. These are extensions of the construction derived from Fermat quotients modulo an odd prime in our earlier work. We determine exact values of the linear complexity, which are larger than half of the period. For cryptographic purpose, the linear complexities of the sequences in this letter are of desired values.

• 2012-07-01

著者

• Du Xiaoni

  College Of Mathematic And Information Science Northwest Normal University

• WU Chenhuang

  the Department of Mathematics, Putian University

• CHEN Zhixiong

  the Department of Mathematics, Putian University

• DU Xiaoni

  College of Mathematics and Information Science, Northwest Normal University

関連論文

• Trace Representation of a New Class of Sextic Residue Sequences of Period p≡3 (mod 8)
• A Construction of Binary Cyclotomic Sequences Using Extension Fields
• Trace Representation of Binary Generalized Cyclotomic Sequences with Length p^m
• Linear Complexity of Quaternary Sequences Generated Using Generalized Cyclotomic Classes Modulo 2p
• Construction of d-Form Sequences with Ideal Autocorrelation
• Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus
• Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2p^n

スポンサーリンク