The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation

2013 ◽  
Vol E96.A (7) ◽  
pp. 1586-1592 ◽  
Author(s):  
Yuhua SUN ◽  
Tongjiang YAN ◽  
Hui LI
Keyword(s):  
Linear Complexity ◽  
Binary Sequences

New Results on the Linear Complexity of Binary Sequences

2006 ◽  
Author(s):  
Konstantinos Limniotis ◽  
Nicholas Kolokotronis ◽  
Nicholas Kalouptsidis
Keyword(s):  
Linear Complexity ◽  
Binary Sequences

scholarly journals On $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients

2018 ◽  
Vol 12 (4) ◽  
pp. 805-816 ◽  
Author(s):  
Zhixiong Chen ◽  
◽  
Vladimir Edemskiy ◽  
Pinhui Ke ◽  
Chenhuang Wu ◽  
...  
Keyword(s):  
Linear Complexity ◽  
Binary Sequences ◽  
Error Linear Complexity

scholarly journals Autocorrelation and Linear Complexity of Binary Generalized Cyclotomic Sequences with Period pq

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Yan Wang ◽  
Liantao Yan ◽  
Qing Tian ◽  
Liping Ding
Keyword(s):  
Autocorrelation Function ◽  
Linear Complexity ◽  
Minimal Polynomial ◽  
Binary Sequences ◽  
Cyclotomic Class ◽  
Cyclotomic Sequences ◽  
Autocorrelation Value

Ding constructed a new cyclotomic class V 0   , V 1 . Based on it, a construction of generalized cyclotomic binary sequences with period p q is described, and their autocorrelation value, linear complexity, and minimal polynomial are confirmed. The autocorrelation function C S w is 3-level if p ≡ 3 mod 4 , and C S w is 5-level if p ≡ 1 mod 4 . The linear complexity LC S > p q / 2 if p ≡ 1   mod   8 , p > q + 1 , or p ≡ 3 mod 4 or p ≡ − 3 mod 8 . The results show that these sequences have quite good cryptographic properties in the aspect of autocorrelation and linear complexity.

Sign in / Sign up

Export Citation Format

Share Document