On the k-error linear complexity for p^n-periodic binary sequences via hypercube theory
From MaRDI portal
Publication:2668568
Abstract: The linear complexity and the -error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is developed for -periodic binary sequences. In fact, hypercube theory is based on a typical sequence decomposition and it is a very important tool in investigating the critical error linear complexity spectrum proposed by Etzion et al. To demonstrate the importance of hypercube theory, we first give a standard hypercube decomposition based on a well-known algorithm for computing linear complexity and show that the linear complexity of the first hypercube in the decomposition is equal to the linear complexity of the original sequence. Second, based on such decomposition, we give a complete characterization for the first decrease of the linear complexity for a -periodic binary sequence . This significantly improves the current existing results in literature. As to the importance of the hypercube, we finally derive a counting formula for the -hypercubes with the same linear complexity.
Recommendations
- Cube theory and stable \(k\)-error linear complexity for periodic sequences
- Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
- The distribution of 2ⁿ-periodic binary sequences with fixed k-error linear complexity
- scientific article; zbMATH DE number 6262500
- The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
Cites work
- A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- A fast algorithm for determining the linear complexity of a sequence with period p^n over GF(q)
- A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/ over GF (q)
- A relationship between linear complexity and k-error linear complexity
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Analysis and design of stream ciphers
- Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
- Computing the error linear complexity spectrum of a binary sequence of period 2/sup n/
- Cube theory and stable \(k\)-error linear complexity for periodic sequences
- How many bits have to be changed to decrease the linear complexity?
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
- On the \(k\)-error linear complexity of sequences with period \(2p^{n}\) over \(GF(q)\)
- On the Stability of<tex>$2^n$</tex>-Periodic Binary Sequences
- Properties of the Error Linear Complexity Spectrum
- The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
- The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity
- The stability theory of stream ciphers
Cited in
(4)- Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
- scientific article; zbMATH DE number 2127875 (Why is no real title available?)
- Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
- Cube theory and stable \(k\)-error linear complexity for periodic sequences
This page was built for publication: On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668568)
