Linear Complexity of A Class of Quaternary Sequences with Optimal Autocorrelation

Author(s):  
Lu ZHAO ◽  
Bo XU ◽  
Tianqing CAO ◽  
Jiao DU
Information ◽  
2021 ◽  
Vol 12 (5) ◽  
pp. 193
Author(s):  
Jiang Ma ◽  
Wei Zhao ◽  
Yanguo Jia ◽  
Haiyang Jiang

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.


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

Author(s):  
Minglong QI ◽  
Shengwu XIONG ◽  
Jingling YUAN ◽  
Wenbi RAO ◽  
Luo ZHONG

Sign in / Sign up

Export Citation Format

Share Document