Generalized Joint Linear Complexity of Linear Recurring Multisequences

Authors:
Wilfried Meidl;Ferruh Özbudak
Affiliations:
Faculty of Engineering and Natural Sciences, Sabancı University,Tuzla, İstanbul, Turkey 34956;Department of Mathematics and Institute of Applied Mathematics, Middle East Technical University, İnönü Bulvar1, Turkey 06531
Venue:
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Year:
2008

Citing 8
Cited 4

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Finite fields

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

Journal of Complexity
Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The expected value of the joint linear complexity of periodic multisequences

Journal of Complexity
The expectation and variance of the joint linear complexity of random periodic multisequences

Journal of Complexity
Generalized Joint Linear Complexity of Linear Recurring Multisequences

SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
On the expected value of the linear complexity and the k-error linear complexity of periodic sequences

IEEE Transactions on Information Theory

Generalized Joint Linear Complexity of Linear Recurring Multisequences

SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence

Theoretical Computer Science
The minimal polynomial over Fq of linear recurring sequence over Fqm

Finite Fields and Their Applications
Linear complexity over F q and over Fqm for linear recurring sequences

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform. Each N-periodic multisequence can be identified with a single N-periodic sequence over an appropriate extension field. It has been demonstrated that the linear complexity of this sequence, the so called generalized joint linear complexity of the multisequence, may be considerably smaller than the joint linear complexity, which is not desirable for vectorized stream ciphers. Recently new methods have been developed and results of greater generality on the joint linear complexity of multisequences consisting of linear recurring sequences have been obtained. In this paper, using these new methods, we investigate the relations between the generalized joint linear complexity and the joint linear complexity of multisequences consisting of linear recurring sequences.