Research on Linear Complexity of Primitive -LFSR Sequences

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.