|
|
Research on Linear Complexity of Primitive σ-LFSR Sequences |
Liu Xiang-hui;Zeng Guang;Han Wen-bao |
Information Engineering Institute, PLA Information Engineering University, Zhengzhou 450002, China |
|
|
Abstract Linear complexity is an important parameter of sequences’ security. In this paper, the linear complexity properties of primitive σ-LFSR sequences are studied. Firstly, the bounds of the linear complexity for one n stages primitive σ-LFSR sequence is given and it is proved that the bounds are tight; then, with the tool of root representation, a method to get the linear complexity of one primitive LFSR sequence is obtained.
|
Received: 15 December 2008
|
|
|
|
|
|
|
|