Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period $ pq $

Abstract

In this paper, we investigate some quaternary sequences with low autocorrelation and period pq where p and q are two odd distinct primes. These sequences are constructed by interleaving the cyclotomic sequences of period p according to the quadratic residues with respect to q. We estimate the symmetric 4-adic complexity of considered sequences and show that they have a sufficiently large 4-adic complexity to effectively resist the attack of the rational approximation algorithm.