A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences
An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period p m q n over a finite field GF(q) is designed, where p andq are primes, and q is a primitive root modulo p 2. The new algorithm generalizes the algorithm for computing the linear complexity of sequences with period q n over GF(q) and that for computing the linear complexity of sequences with period p m over GF(q).
KeywordsEfficient Algorithm Fast Algorithm Binary Sequence Linear Complexity Anhui Province
Unable to display preview. Download preview PDF.
- 3.Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. In: Ding, C., Shan, W., Xiao, G. (eds.) The Stability Theory of Stream Ciphers. LNCS, vol. 561, Springer, Heidelberg (1991)Google Scholar