Linear complexity of generalized cyclotomic sequences of order 4 over F_l
From MaRDI portal
Publication:2173752
Abstract: Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the generalized sequences of order 4. Under certain conditions, the linear complexity of these sequences of order 4 is developed over a finite field F_l. Results show that in many cases they have high linear complexity.
Summary: Generalized cyclotomic sequences of period \(pq\) have several desirable randomness properties if the two primes \(p\) and \(q\) are chosen properly. In particular, Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the generalized sequences of order 4. Under certain conditions, the linear complexity of these sequences is developed over a finite field \(\mathbb{F}_l\). The results show that, in many cases, they have high linear complexity.
Recommendations
- Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems
- Linear complexity of generalized cyclotomic binary sequences of period \(pq\)
- Research on linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2{p^m}\)
- Linear complexity of generalized cyclotomic binary sequences of order 2
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
Cites work
- A family of difference sets
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
- About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
- Autocorrelation values of generalized cyclotomic sequences of order two
- Cyclic codes from cyclotomic sequences of order four
- Cyclic Codes From the Two-Prime Sequences
- scientific article; zbMATH DE number 3116691 (Why is no real title available?)
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- scientific article; zbMATH DE number 1182117 (Why is no real title available?)
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Linear complexity of generalized cyclotomic binary sequences of order 2
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- New generalized cyclotomy and its applications
- On cyclotomic generator of order \(r\).
- On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
- On the linear complexity of Hall's sextic residue sequences
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- Pattern distributions of Legendre sequences
- Remarks on a cyclotomic sequence
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
Cited in
(17)- Linear complexity of generalized cyclotomic binary sequences of order 2
- Linear complexity of a class of pseudorandom sequences over a general finite field
- Linear complexity of some sequences derived from hyperelliptic curves of genus 2
- Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
- The linear complexity of new generalized cyclotomic binary sequences of order four
- On cyclotomic generator of order \(r\).
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- The linear complexity of related prime sequences
- On the linear complexity of a new generalized cyclotomic sequence with length \({p^3}\) over \({\text{GF}}\left( l \right)\)
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- Research on linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2{p^m}\)
- 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
- Linear complexity of Ding generalized cyclotomic sequences
- An extension of binary cyclotomic sequences having order 2lt
This page was built for publication: Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173752)
