Autocorrelation and Linear Complexity of the New Generalized Cyclotomic Sequences(Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
This paper contributes to a new generalized cyclotomic sequences of order two with respect to p_1^<e_1>p_2^<e_2>…p_t^<e_t>. The emphasis is on the linear complexity and autocorrelation of new prime-square sequences and two-prime sequences, two special cases of these generalized cyclotomic sequences. Our method is based on their characteristic polynomials. Results show that these sequences possess good linear complexity. Under certain conditions, the autocorrelation functions of new prime-square sequences and two-prime sequences may be three-valued.
- 社団法人電子情報通信学会の論文
- 2007-04-01
著者
-
Sun Rong
State Key Laboratory Of Integrated Service Networks Xidian University
-
Sun Rong
Isn National Key Lab. Xidian University
-
Xiao Guozhen
Isn National Key Lab. Xidian University
-
Xiao Guozhen
Isn National Key Lab Xidian University
-
YAN Tongjiang
ISN National Key Lab., Xidian University
-
Yan Tongjiang
Isn National Key Lab. Xidian University:college Of Maths And Computation China University Of Petrole
関連論文
- Trace Representation of a New Class of Sextic Residue Sequences of Period p≡3 (mod 8)
- Cryptanalysis of an Identity Based Proxy Multi-Signature Scheme
- 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
- 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