Please use this identifier to cite or link to this item:
|Title:||Linear complexity, k-error linear complexity, and the discrete Fourier transform|
|Keywords:||Discrete Fourier transform|
k-error linear complexity
|Citation:||Meidl, W., Niederreiter, H. (2002). Linear complexity, k-error linear complexity, and the discrete Fourier transform. Journal of Complexity 18 (1) : 87-103. ScholarBank@NUS Repository. https://doi.org/10.1006/jcom.2001.0621|
|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).|
|Source Title:||Journal of Complexity|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 21, 2018
WEB OF SCIENCETM
checked on Apr 30, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.