scholarly journals A Kind of Quaternary Sequences of Period 2pmqn and Their Linear Complexity

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Qiuyan Wang ◽  
Chenhuang Wu ◽  
Minghui Yang ◽  
Yang Yan
Keyword(s):  
Linear Complexity ◽  
New Class ◽  
Quaternary Sequences ◽  
Generalized Cyclotomic Classes

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

A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity

2018 ◽  
Vol 16 (01) ◽  
pp. 1850006 ◽  
Author(s):  
Longfei Liu ◽  
Xiaoyuan Yang ◽  
Bin Wei ◽  
Liqiang Wu
Keyword(s):  
Finite Fields ◽  
Linear Complexity ◽  
Periodic Sequences ◽  
New Class ◽  
New Family ◽  
Generalized Cyclotomic Classes ◽  
Cyclotomic Sequences

Periodic sequences over finite fields, constructed by classical cyclotomic classes and generalized cyclotomic classes, have good pseudo-random properties. The linear complexity of a period sequence plays a fundamental role in the randomness of sequences. In this paper, we construct a new family of quaternary generalized cyclotomic sequences with order [Formula: see text] and length [Formula: see text], which generalize the sequences constructed by Ke et al. in 2012. In addition, we determine its linear complexity using cyclotomic theory. The conclusions reveal that these sequences have high linear complexity, which means they can resist linear attacks.

scholarly journals New Generalized Cyclotomic Quaternary Sequences with Large Linear Complexity and a Product of Two Primes Period

Information ◽  
2021 ◽  
Vol 12 (5) ◽  
pp. 193
Author(s):  
Jiang Ma ◽  
Wei Zhao ◽  
Yanguo Jia ◽  
Haiyang Jiang
Keyword(s):  
Spectral Sequence ◽  
Linear Complexity ◽  
Residue Class ◽  
Important Criterion ◽  
Random Sequences ◽  
Gray Mapping ◽  
Quaternary Sequences ◽  
Hamming Weights ◽  
Residue Class Ring ◽  
Class Ring

Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength. Pseudo-random Sequences with a large linear complexity property are of importance in many domains. In this paper, based on the theory of inverse Gray mapping, two classes of new generalized cyclotomic quaternary sequences with period pq are constructed, where pq is a product of two large distinct primes. In addition, we give the linear complexity over the residue class ring Z4 via the Hamming weights of their Fourier spectral sequence. The results show that these two kinds of sequences have large linear complexity.

Linear complexity of generalised cyclotomic quaternary sequences of length 2p m+1 q n+1

2016 ◽  
Vol 10 (2) ◽  
pp. 104-111
Author(s):  
Dan-dan Li ◽  
Qiao-yan Wen ◽  
Zu-ling Chang ◽  
Jie Zhang
Keyword(s):  
Linear Complexity ◽  
Quaternary Sequences

scholarly journals Linear Complexity over Fq of Generalized Cyclotomic Quaternary Sequences with Period 2p

2015 ◽  
Vol E98.A (7) ◽  
pp. 1569-1575 ◽  
Author(s):  
Minglong QI ◽  
Shengwu XIONG ◽  
Jingling YUAN ◽  
Wenbi RAO ◽  
Luo ZHONG
Keyword(s):  
Linear Complexity ◽  
Quaternary Sequences ◽  
Period 2
Sign in / Sign up

Export Citation Format

Share Document