Research on Linear Complexity of Primitive σ-LFSR Sequences
Pla Information · JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY · 2009
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.