### Linear Complexity of Finite Field Sequences over Different Fields

Appeared in: International Workshop on Sequence Design and Applications
(IWSDA), Fukuoka, Japan, October 2005.
Authors:

Andrew Klapper, 779A Anderson Hall, Dept. of Computer Science,
University of Kentucky, Lexington, KY, 40506-0046, klapper at cs.uky.edu.
www.cs.uky.edu/~klapper/andy.html

**Abstract**
In this paper we study relationships between the linear complexities
of a sequence when treated as a sequence over two distinct fields. We
obtain bounds for one linear complexity in the form of a constant
multiple of the other, where the constant depends only on the fields,
not on the particular sequence.

**Index Terms --**
Linear complexity, stream cipher, finite field, pseudorandom sequence.