Linear complexity, k-error linear complexity, and the discrete Fourier transform

46Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 change of a few terms should not cause a significant decrease of the linear complexity. This requirement leads to the concept of the k-error linear complexity LN,k(S) of sequences S with period length N. For some k and c we determine the number of periodic sequences S with given period length N and LN,k(S) = c. For prime N we establish a lower bound on the expected value of the k-error linear complexity. © 2002 Elsevier Science (USA).

Cite

CITATION STYLE

APA

Meidl, W., & Niederreiter, H. (2002). Linear complexity, k-error linear complexity, and the discrete Fourier transform. Journal of Complexity, 18(1), 87–103. https://doi.org/10.1006/jcom.2001.0621

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free