Linear complexity of generalized cyclotomic binary sequences of order 2
From MaRDI portal
Cyclotomic sequences have quite good randomness properties and are potentially interesting for data encryption purposes. In this paper, given two odd primes \(p\) and \(q\), the author studies an associated sequence that is a generalized cyclotomic sequence of order 2. In case \(\text{gcd}(p-1, q-1)= 2\), he determines the linear complexity of this sequence. Let \(s^\infty= s_0s_1\cdots s_{n-1}\cdots\) be a periodic infinite sequence over a field \(F\). The linear complexity of \(s^\infty\) is defined to be the least positive integer \(\ell\) such that there are constants \(c_1,\dots, c_\ell\in F\) satisfying \(s_i= c_1s_{i-1}+ c_2s_{i-2}+\cdots+ c_\ell s_{i-\ell}\) for all \(i\geq \ell\). Thus, the linear complexity of a sequence is a measure of its randomness.
Recommendations
Cites work
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- A family of difference sets
- A Simple Unpredictable Pseudo-Random Number Generator
- A software-optimized encryption algorithm
- Cyclic difference sets
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 4062985 (Why is no real title available?)
- scientific article; zbMATH DE number 177032 (Why is no real title available?)
- scientific article; zbMATH DE number 1122449 (Why is no real title available?)
- scientific article; zbMATH DE number 1455086 (Why is no real title available?)
- scientific article; zbMATH DE number 1498327 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 3221502 (Why is no real title available?)
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- Linear Complexity and Random Sequences
- The stability theory of stream ciphers
Cited in
(55)- Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2ᵏ
- Remarks on a cyclotomic sequence
- A trace representation of binary Jacobi sequences
- New generalized cyclotomic binary sequences of period \(p^2\)
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- Linear complexity of a class of pseudorandom sequences over a general finite field
- Remarks on the generalized cyclotomic sequences of length 2p^m
- On the properties of generalized cyclotomic binary sequences of period \(2p^m\)
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\)
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- About the linear complexity of quaternary sequences with even length
- Cyclic codes via the general two-prime generalized cyclotomic sequence of order two
- On the linear complexity of Legendre-Sidelnikov sequences
- Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
- Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
- Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
- Linear complexity of quaternary sequences of length pq with low autocorrelation
- Sequences related to Legendre/Jacobi sequences
- A new frequency-hopping sequence set based upon generalized cyclotomy
- Pseudo-randomness of certain sequences of k symbols with length pq
- The linear complexity of new generalized cyclotomic binary sequences of order four
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- New \(M\)-ary sequences with low autocorrelation from interleaved technique
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2p^m
- Additive character sums of polynomial quotients
- On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six
- 2-adic complexity of two classes of generalized cyclotomic binary sequences
- Generalized cyclotomic numbers of order two and their applications
- The linear complexity of related prime sequences
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity
- Linear Complexity of Some Generalized Cyclotomic Sequences
- Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\)
- ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
- The linear complexity problem of a binary Jacobi sequence
- Cyclic codes from the first class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Linear complexity of binary cyclotomic sequences of order 6
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\)
- Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6
- Large families of pseudo-random subsets formed by generalized cyclotomic classes
- New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy
- On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period 4p^n
- An extension of binary cyclotomic sequences having order 2lt
- Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\)
- Permutation polynomials over finite fields from a powerful lemma
- Linear complexity of two classes of quaternary sequences based on sign alternation transformation
- Trace representation of a family of generalized cyclotomic binary sequences with period p^n
- Linear complexity and correlation of a class of binary cyclotomic sequences
- On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\)
- Trace representation of some generalized cyclotomic sequences of length pq
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
This page was built for publication: Linear complexity of generalized cyclotomic binary sequences of order 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266420)
