Joint Linear Complexity and Its Fast Algorithm of Multi-periodic Sequence
Gongyi Wu · Jisuanji gongcheng · 2007
The linear complexity of periodic sequences is one of the important security indices of stream cipher systems. Recently developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the joint linear complexity of multi-sequences. This paper gives a new calculation method to compute the joint linear complexity of random Pn-periodic sequences over Fp. A new fast algorithm for computing the joint linear complexity of Pn-periodic sequences over Fp is proposed.