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

01/29/2020
by   Qiuyan Wang, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2018

Linear complexity of generalized cyclotomic sequences of period 2p^m

In this paper, we construct two generalized cyclotomic binary sequences ...
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
01/26/2018

Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N

The autocorrelation and the linear complexity of a key stream sequence i...
research
02/02/2020

Autocorrelation of a class of quaternary sequences of period 2p^m

Sequences with good randomness properties are quite important for stream...
research
11/22/2017

Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes

A family of quaternary sequences over Z4 is defined based on the Ding-He...
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
05/28/2021

Linear Complexity of Binary Interleaved Sequences of Period 4n

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

Please sign up or login with your details

Forgot password? Click here to reset