Error linear complexity measures for multisequences

Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences. For finite multisequences as well as for periodic multisequences with prime period, we present formulas for the number of multisequences with given error linear complexity for several cases, and we present lower bounds for the expected error linear complexity.

• Type: Journal
• Year: 2007
• Where: JC
• Authors: Wilfried Meidl, Harald Niederreiter, Ayineedi Venkateswarlu
• Keywords: Complexity Measures, Error Linear Complexity, JC 2007, Linear Complexity