On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences

2005 ◽  
pp. 166-178 ◽  
Author(s):  
Takayasu Kaida
Keyword(s):  
Linear Complexity ◽  
Periodic Sequences ◽  
Error Linear Complexity

ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS

2020 ◽  
Vol 102 (2) ◽  
pp. 342-352
Author(s):  
YUHUI ZHOU ◽  
YUHUI HAN ◽  
YANG DING
Keyword(s):  
Lower Bound ◽  
Linear Complexity ◽  
Function Fields ◽  
Stream Ciphers ◽  
Security Measures ◽  
Periodic Sequences ◽  
Error Linear Complexity

The linear complexity and the error linear complexity are two important security measures for stream ciphers. We construct periodic sequences from function fields and show that the error linear complexity of these periodic sequences is large. We also give a lower bound for the error linear complexity of a class of nonperiodic sequences.

An Efficient Algorithm for Computing the k-Error Linear Complexity Spectrum of Periodic Sequences

2012 ◽  
Vol 532-533 ◽  
pp. 1726-1731
Author(s):  
Ling Yong Ma ◽  
Hao Cao
Keyword(s):  
Efficient Algorithm ◽  
Linear Complexity ◽  
Primitive Root ◽  
Periodic Sequences ◽  
Period 2 ◽  
Primitive Root Modulo ◽  
Modulo P ◽  
Error Linear Complexity ◽  
Error Linear Complexity Spectrum

An efficient algorithm for computing the k-error linear complexity spectrum of a q- ary sequence s with period 2 pn is presented, where q is an odd prime and a primitive root modulo p2. The algorithm generalizes both the Wei-Xiao-Chen and the Wei algorithms, The new algorithm can compute the k-error linear complexity spectrum of s using at most 4 n+1 steps.

Sign in / Sign up

Export Citation Format

Share Document