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

02/24/2021
by   Chun'e Zhao, et al.
0

In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences of period pq is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, we derive a lower bound on the 2-adic complexity of the corresponding sequence, which further expands our previous work (Zhao C, Sun Y and Yan T. Study on 2-adic complexity of a class of balanced generalized cyclotomic sequences. Journal of Cryptologic Research,6(4):455-462, 2019). The result shows that the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm(RAA) for feedback with carry shift registers(FCSRs), i.e., it is in fact lower bounded by pq-p-q-1, which is far larger than one half of the period of the sequences. Particularly, the 2-adic complexity is maximal if suitable parameters are chosen.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/21/2020

The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude

In 2008, a class of binary sequences of period N=4(2^k-1)(2^k+1) with op...
research
12/13/2019

Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products

This paper contributes to compute 2-adic complexity of two classes of Di...
research
09/05/2021

Linear complexity over 𝔽_q and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation

A class of binary sequences with period 2p is constructed using generali...
research
07/08/2021

On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation

In this paper, we determine the 4-adic complexity of the balanced quater...
research
11/24/2020

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

In cryptography, we hope a sequence over ℤ_m with period N having larger...
research
08/24/2021

On the linear complexity of feedforward clock-controlled sequence

As a research field of stream ciphers, the pursuit of a balance of secur...
research
02/22/2018

Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight

During the last two decades, many kinds of periodic sequences with good ...

Please sign up or login with your details

Forgot password? Click here to reset