DeepAI AI Chat
Log In Sign Up

The 4-Adic Complexity of A Class of Quaternary Cyclotomic Sequences with Period 2p

by   Shiyuan Qiang, et al.

In cryptography, we hope a sequence over ℤ_m with period N having larger m-adic complexity. Compared with the binary case, the computation of 4-adic complexity of knowing quaternary sequences has not been well developed. In this paper, we determine the 4-adic complexity of the quaternary cyclotomic sequences with period 2p defined in [6]. The main method we utilized is a quadratic Gauss sum G_p valued in ℤ_4^N-1 which can be seen as a version of classical quadratic Gauss sum. Our results show that the 4-adic complexity of this class of quaternary cyclotomic sequences reaches the maximum if 5∤ p-2 and close to the maximum otherwise.


page 1

page 2

page 3

page 4


On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences

We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM)...

A kind of quaternary sequences of period 2p^mq^n and their linear complexity

Sequences with high linear complexity have wide applications in cryptogr...

Linear Complexity of Binary Interleaved Sequences of Period 4n

Binary periodic sequences with good autocorrelation property have many a...

A new neural-network-based model for measuring the strength of a pseudorandom binary sequence

Maximum order complexity is an important tool for measuring the nonlinea...

On the 2-adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequenc...

Further results on the 2-adic complexity of a class of balanced generalized cyclotomic sequences

In this paper, the 2-adic complexity of a class of balanced Whiteman gen...

Towards a symbolic summation theory for unspecified sequences

The article addresses the problem whether indefinite double sums involvi...