A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The expected value of the joint linear complexity of periodic multisequences
2003
Journal of Complexity
Complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based (or vectorized) stream ciphers, which require the study of the complexity of multisequences. We extend a well-known relationship between the linear complexity of an N-periodic sequence and the (generalized) discrete Fourier transform of Ntuples to the case of multisequences. Using the
doi:10.1016/s0885-064x(02)00009-2
fatcat:vcwrlyatc5hflgzplsv6p5ub6m