# 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} }

- Published in J. Complexity 2002
DOI:10.1006/jcom.2001.0621

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.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 24 CITATIONS

## ANALYSIS OF SECURITY MEASURES FOR SEQUENCES

VIEW 5 EXCERPTS

HIGHLY INFLUENCED

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

VIEW 4 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

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

VIEW 6 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Enumeration of Quadratic Functions With Prescribed Walsh Spectrum

VIEW 2 EXCERPTS

CITES METHODS

## On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory

VIEW 1 EXCERPT

CITES METHODS

## Sparse polynomial interpolation codes and their decoding beyond half the minimum distance

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 12 REFERENCES

## Stream ciphers, in ‘‘Contemporary Cryptology: The Science of Information Integrity’

## Analysis and design of stream ciphers

VIEW 1 EXCERPT

## Theory and practice of error control codes

VIEW 1 EXCERPT