On the Randomness of Generalized Cyclotomic Sequences of Order Two and Length pq(Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
In this letter we introduce new generalized cyclotomic sequences of order two and length pq firstly, then we determine the linear complexity and autocorrelation values of these sequences. Our results show that these sequences are rather good from the linear complexity viewpoint.
- 社団法人電子情報通信学会の論文
- 2007-09-01
著者
-
Chen Zhixiong
Key Laboratory Of Applied Mathematics Putian University
-
Li Shengqiang
Isn National Key Lab. Xidian University:(present Office)univ Of Electronic Science And Technology Of
-
Sun Rong
Isn National Key Lab. Xidian University
-
Xiao Guozhen
Isn National Key Lab Xidian University
-
Chen Zhixiong
Key Lab Of Applied Mathematics Putian University
関連論文
- Trace Representation of a New Class of Sextic Residue Sequences of Period p≡3 (mod 8)
- 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)
- A Construction of Binary Cyclotomic Sequences Using Extension Fields
- More Efficient VLR Group Signature Satisfying Exculpability
- Trace Representation of Binary Generalized Cyclotomic Sequences with Length p^m
- 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)
- Linear Complexity of Quaternary Sequences Generated Using Generalized Cyclotomic Classes Modulo 2p
- Construction of d-Form Sequences with Ideal Autocorrelation