Please use this identifier to cite or link to this item:
|Title:||The expected value of the joint linear complexity of periodic multisequences|
|Keywords:||Generalized discrete Fourier transform|
|Citation:||Meidl, W., Niederreiter, H. (2003-02). The expected value of the joint linear complexity of periodic multisequences. Journal of Complexity 19 (1) : 61-72. ScholarBank@NUS Repository. https://doi.org/10.1016/S0885-064X(02)00009-2|
|Abstract:||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 N-tuples to the case of multisequences. Using the concept of the generalized discrete Fourier transform for multisequences, we compute the expected value of the joint linear complexity of random periodic multisequences, and for some types of period lengths N we determine the number NN t (c) of t N-periodic sequences with given joint linear complexity c. © 2002 Elsevier Science (USA). All rights reserved.|
|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 Sep 19, 2018
WEB OF SCIENCETM
checked on Sep 4, 2018
checked on Sep 14, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.