Notes about symmetric m-adic complexity of generalized cyclotomic sequences of order two with period pq

In this paper, we consider binary generalized cyclotomic sequences with period pq, where p and q are two distinct odd primes. These sequences derive from generalized cyclotomic classes of order two modulo pq. We investigate the generalized binary cyclotomic sequences as the sequences over the ring of integers modulo m for a positive integer m and study m-adic complexity of sequences. We show that they have high symmetric m-adic complexity. Our results generalize well-known statements about 2-adic complexity of these sequences.

3-adic complexity of ternary generalized cyclotomic sequences with period

In this paper, we study the ternary generalized cyclotomic sequences with a period equal to a power of an odd prime. Ding-Helleseth’s generalized cyclotomic classes of order three are used for the definition of these sequences. We derive the symmetric 3-adic complexity of above mention sequences and obtain the estimate of symmetric 3-adic complexity of sequences. It is shown that 3-adic complexity of these sequences is large enough to resist the attack of the rational approximation algorithm for feedback with carry shift registers.

Symmetric 2-adic complexity of generalized cyclotomic sequences of order six with period p n

In this paper, the symmetric 2-adic complexity of generalized cyclotomic sequences of order six with period equals a power of an odd prime is studied. The estimate of symmetric 2-adic complexity of these sequences is obtained. It is shown that above sequences have high symmetric 2-adic complexity and the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm for feedback with carry shift registers.

Linear Complexity and Trace Representation of New Ding Generalized Cyclotomic Sequences with Period pq and Order Two

Linear complexity is an important property to measure the unpredictability of pseudo-random sequences. Trace representation is helpful for analyzing cryptography properties of pseudo-random sequences. In this paper, a class of new Ding generalized cyclotomic binary sequences of order two with period pq is constructed based on the new segmentation of Ding Helleseth generalized cyclotomy. Firstly, the linear complexity and minimal polynomial of the sequences are investigated. Then, their trace representation is given. It is proved that the sequences have larger linear complexity and can resist the attack of the Berlekamp–Massey algorithm. This paper also confirms that generalized cyclotomic sequences with good randomness may be obtained by modifying the characteristic set of generalized cyclotomy.

Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq

Ding constructed a new cyclotomic class V 0 , V 1 . Based on it, a construction of generalized cyclotomic binary sequences with period p q is described, and their autocorrelation value, linear complexity, and minimal polynomial are confirmed. The autocorrelation function C S w is 3-level if p ≡ 3 mod 4 , and C S w is 5-level if p ≡ 1 mod 4 . The linear complexity LC S > p q / 2 if p ≡ 1 mod 8 , p > q + 1 , or p ≡ 3 mod 4 or p ≡ − 3 mod 8 . The results show that these sequences have quite good cryptographic properties in the aspect of autocorrelation and linear complexity.