A fast algorithm for determing the linear complexity of a pseudo-random sequence with periodic n2v

R.A.Games,A.H.Chan,A fast algorithm for determining the complexity of a binary sequence with period 2n,IEEE Tans.on Inform.Theory,1983,29(3),144-146.[2]K.Imamura,T.Moriuchi,A fast algorithm for determining the linear complexity ofp-ary sequence with period pn,p a prime,IEICE Tech.Rep,1993,in Japanese,75(1),73-78.[3]J.L.Massey,S.Serconek,Linear complexity of periodic sequencs,A general theory,Advances in Cryptology-CRYPTO96,USA,1996,358-371.[4]C.Ding,G.Xiao,W.Shah,The Stability of Stream Ciphers,Lecture Notes in Computer Science,Spinger-Verlag,1991,Ch.5,81-129.[5]S.R.Blackburn,A generalisation of the discrete Fourier transfrom: determining the minimal polynomial of a periodic,IEEE Trans.on Info.Theory,1994,40(5),1702-1705.