Complexity of periodic sequences S ~∞ and S(*∞) over F_p
Shixin Zhu · Jisuanji yingyong yanjiu · 2009
Linear complexity is the most important standards to scale the randomness properties of sequences. It can be achieved by using the minimum polynomials .This paper presented the relation between minimum polynomials of periodic sequences S ∞ and S *∞ over field F_p,respectively. The relation presented can be used to analyze the complexity of periodic sequences of stream ciphers over F_p.