New Generalized Cyclotomic Quaternary Sequences with Large Linear Complexity and a Product of Two Primes Period

Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength. Pseudo-random Sequences with a large linear complexity property are of importance in many domains. In this paper, based on the theory of inverse Gray mapping, two classes of new generalized cyclotomic quaternary sequences with period pq are constructed, where pq is a product of two large distinct primes. In addition, we give the linear complexity over the residue class ring Z4 via the Hamming weights of their Fourier spectral sequence. The results show that these two kinds of sequences have large linear complexity.

A Kind of Quaternary Sequences of Period 2pmqn and Their Linear Complexity

Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over F4 with period 2pmqn is constructed using generalized cyclotomic classes. Results show that the linear complexity of these sequences attains the maximum.