Periodic sequences with maximal linear complexity and large k-error linear complexity
It is well known that sequences to be used as keystreams in stream ciphers should possess a large linear complexity. For cryptographic purposes, however, it is also required that altering a few terms of such a sequence should not cause a significant decrease in its linear complexity. This leads to the concept of \(k\)-error linear complexity. This concept has been studied previously, and it has been shown that under certain conditions there exist \(N\)-periodic sequences with maximal linear complexity and large \(k\)-error linear complexity. For practical purposes however, the existence of such sequences is not enough as these are useful only if a large number of sequences actually satisfy the conditions. In the paper a lower bound on the number of \(N\)-periodic sequences with maximal linear complexity and \(k\)-error linear complexity close to \(N\) is given. Also conditions under which the overwhelming majority of all \(N\)-periodic sequences with linear complexity \(N\) have a \(k\)-error linear complexity close to \(N\) for relatively large values of \(k\) are shown.
- Cryptography and Coding
- Periodic sequences with large k-error linear complexity
- New Results on Periodic Sequences With Large $k$-Error Linear Complexity
- scientific article; zbMATH DE number 2247712
- Linear complexity and k-error linear complexity for p^n-periodic sequences
- Periodic multisequences with large error linear complexity
- Remarks on the k-error linear complexity of p^n-periodic sequences
- On the $k$-Error Linear Complexity of $p^{m}$-Periodic Binary Sequences
- Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Periodic multisequences with large error linear complexity
- Periods of termwise exclusive ors of maximal length FCSR sequences
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Linear recurrent sequences over a finite field and applications in cryptography
- Linear complexity and k-error linear complexity for p^n-periodic sequences
- A construction ofp-ary balanced sequence with largek-error linear complexity
- Cube theory and stable \(k\)-error linear complexity for periodic sequences
- Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)
- Counting functions and expected values in the stability theory of stream ciphers
- A relationship between linear complexity and k-error linear complexity
- Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period
- Efficient NLMS and RLS Algorithms for Perfect and Imperfect Periodic Sequences
- On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
- Periodic sequences with large k-error linear complexity
- FCSR periodic multisequences with maximal joint N-adic complexity and large k-error joint N-adic complexity over Z/(N)
- On the \(k\)-error linear complexity of sequences from function fields
- The 4 (or 5)-error sequences of 2ⁿ-periodic binary sequences with linear complexity 2ⁿ-2ᵐ
- Analysis of the linear complexity and its stability for periodic binary sequences
- Cryptography and Coding
- On the k-Operation Linear Complexity of Periodic Sequences
- scientific article; zbMATH DE number 2247712 (Why is no real title available?)
- On the k-error linear complexity of -sequences
- Improved results on periodic multisequences with large error linear complexity
- Error linear complexity measures for multisequences
This page was built for publication: Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422205)
