Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform

@article{Meidl2002LinearCK,
  title={Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform},
  author={Wilfried Meidl and Harald Niederreiter},
  journal={J. Complexity},
  year={2002},
  volume={18},
  pages={87-103}
}
Complexity measures for sequences of elements of a finite field play an important role in cryptology. We focus first on the linear complexity of periodic sequences. By means of the discrete Fourier transform, we determine the number of periodic sequences S with given prime period length N and linear complexity LN, 0(S)=c as well as the expected value of the linear complexity of N-periodic sequences. Cryptographically strong sequences should not only have a large linear complexity, but also the… CONTINUE READING

Topics from this paper.

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 24 CITATIONS

Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences

  • Selected Areas in Cryptography
  • 2008
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Remarks on the k-error linear complexity of pn-periodic sequences

  • Des. Codes Cryptogr.
  • 2007
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Enumeration of Quadratic Functions With Prescribed Walsh Spectrum

  • IEEE Transactions on Information Theory
  • 2014
VIEW 2 EXCERPTS
CITES METHODS