Linear Complexity of r-Ary Sequences Derived from Euler Quotient Modulo pq

In this paper, we present a generic construction of Formula: see text-ary sequences with period Formula: see text based on the Euler quotient modulo Formula: see text, where Formula: see text and Formula: see text are odd primes satisfying that Formula: see text divides Formula: see text and Formula: see text is any prime less than Formula: see text. The minimal polynomial and the linear complexity of the proposed sequences are determined in most cases under the assumption that Formula: see text. The result shows that each of the sequences has large linear complexity.