References

[1] Dawson E, Simpson L. Analysis and design issues for synchronous stream ciphers. In: Niederreiter H, ed. Coding Theory and Cryptology. Singapore: World Scientific, 2002. 49--90. Google Scholar https://scholar.google.com/scholar?&q=Dawson E, Simpson L. Analysis and design issues for synchronous stream ciphers. In: Niederreiter H, ed. Coding Theory and Cryptology. Singapore: World Scientific, 2002. 49--90&

[2] Ekdahl P, Johansson T. A new version of the stream ciphers SNOW. In: Proceedings of 9th Annual International Workshop on Selected Areas in Cryptography, Newfoundland, 2002. 47--61. Google Scholar https://scholar.google.com/scholar?&q=Ekdahl P, Johansson T. A new version of the stream ciphers SNOW. In: Proceedings of 9th Annual International Workshop on Selected Areas in Cryptography, Newfoundland, 2002. 47--61&

[3] Hawkes P, Rose G G. Exploiting multiples of the connection polynomial in word-oriented stream ciphers. In: Proceedings of 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, 2000. 303--316. Google Scholar https://scholar.google.com/scholar?&q=Hawkes P, Rose G G. Exploiting multiples of the connection polynomial in word-oriented stream ciphers. In: Proceedings of 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, 2000. 303--316&

[4] Niederreiter H. Linear Alg Appl, 1993, 192: 301-328 CrossRef Google Scholar https://scholar.google.com/scholar?author=Niederreiter H&publication_year=1993&journal=Linear Alg Appl&volume=192&pages=301-328

[5] Tsaban B, Vishne U. Finite Fields Appl, 2002, 8: 256-267 CrossRef Google Scholar https://scholar.google.com/scholar?author=Tsaban B&author=Vishne U&publication_year=2002&journal=Finite Fields Appl&volume=8&pages=256-267

[6] Zeng G, Han W, He K. High efficiency feedback shift register: $\sigma$-LFSR. Cryptology ePrint Archive, Report 2007/114, 2007. Google Scholar https://scholar.google.com/scholar?&q=Zeng G, Han W, He K. High efficiency feedback shift register: $\sigma$-LFSR. Cryptology ePrint Archive, Report 2007/114, 2007&

[7] Zeng G, He K, Han W. Sci China Ser-F: Inf Sci, 2007, 50: 359-372 Google Scholar https://scholar.google.com/scholar?author=Zeng G&author=He K&author=Han W&publication_year=2007&journal=Sci China Ser-F: Inf Sci&volume=50&pages=359-372

[8] Zeng G, Yang Y, Han W , et al. Word oriented cascade jump $\sigma$-LFSR. In: Proceedings of 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Tarragona, 2009. 127--136. Google Scholar https://scholar.google.com/scholar?&q=Zeng G, Yang Y, Han W , et al. Word oriented cascade jump $\sigma$-LFSR. In: Proceedings of 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Tarragona, 2009. 127--136&

[9] Berlekamp E R. Algebraic Coding Theory. New York: McGraw-Hill, 1968. Google Scholar https://scholar.google.com/scholar?&q=Berlekamp E R. Algebraic Coding Theory. New York: McGraw-Hill, 1968&

[10] Massey J L. IEEE Trans Inform Theory, 1969, 15: 122-127 CrossRef Google Scholar https://scholar.google.com/scholar?author=Massey J L&publication_year=1969&journal=IEEE Trans Inform Theory&volume=15&pages=122-127

[11] Dai Z D, Wang K P, Ye D F. Adv Math, 2004, 33: 246-248 Google Scholar https://scholar.google.com/scholar?author=Dai Z D&author=Wang K P&author=Ye D F&publication_year=2004&journal=Adv Math&volume=33&pages=246-248

[12] Dai Z D, Wang K P, Ye D F. Acta Arithmet, 2006, 122: 1-16 CrossRef Google Scholar https://scholar.google.com/scholar?author=Dai Z D&author=Wang K P&author=Ye D F&publication_year=2006&journal=Acta Arithmet&volume=122&pages=1-16

[13] Dai Z D, Yang J H. Finite Fields Appl, 2006, 12: 379-402 CrossRef Google Scholar https://scholar.google.com/scholar?author=Dai Z D&author=Yang J H&publication_year=2006&journal=Finite Fields Appl&volume=12&pages=379-402

[14] Ding C S. Proof of Massey's conjectured algorithm. In: Proceedings of Workshop on the Theory and Application of Cryptographic Techniques, Davos, 1988. 345--349. Google Scholar https://scholar.google.com/scholar?&q=Ding C S. Proof of Massey's conjectured algorithm. In: Proceedings of Workshop on the Theory and Application of Cryptographic Techniques, Davos, 1988. 345--349&

[15] Feng G L, Tzeng K K. IEEE Trans Inform Theory, 1991, 37: 1274-1287 CrossRef Google Scholar https://scholar.google.com/scholar?author=Feng G L&author=Tzeng K K&publication_year=1991&journal=IEEE Trans Inform Theory&volume=37&pages=1274-1287

[16] Wang L P, Zhu Y F, Pei D Y. IEEE Trans Inform Theory, 2004, 50: 2905-2910 CrossRef Google Scholar https://scholar.google.com/scholar?author=Wang L P&author=Zhu Y F&author=Pei D Y&publication_year=2004&journal=IEEE Trans Inform Theory&volume=50&pages=2905-2910

[17] Kaltofen F, Yuhasz G. ACM Trans Algorithm, 2013, 9: 33-2910 Google Scholar https://scholar.google.com/scholar?author=Kaltofen F&author=Yuhasz G&publication_year=2013&journal=ACM Trans Algorithm&volume=9&pages=33-2910

[18] Kaltofen F, Yuhasz G. Linear Alg Appl, 2013, 439: 2515-2526 CrossRef Google Scholar https://scholar.google.com/scholar?author=Kaltofen F&author=Yuhasz G&publication_year=2013&journal=Linear Alg Appl&volume=439&pages=2515-2526

[19] Antoulas A C. IEEE Trans Automat Control, 1985, 31: 1121-1135 Google Scholar https://scholar.google.com/scholar?author=Antoulas A C&publication_year=1985&journal=IEEE Trans Automat Control&volume=31&pages=1121-1135

[20] Dickinson B W, Morf M, Kailath D. IEEE Trans Automat Control, 1974, 19: 31-38 CrossRef Google Scholar https://scholar.google.com/scholar?author=Dickinson B W&author=Morf M&author=Kailath D&publication_year=1974&journal=IEEE Trans Automat Control&volume=19&pages=31-38

[21] Gragg W B, Lindquist A. Linear Alg Appl, 1983, 50: 277-319 CrossRef Google Scholar https://scholar.google.com/scholar?author=Gragg W B&author=Lindquist A&publication_year=1983&journal=Linear Alg Appl&volume=50&pages=277-319

[22] Kuijper M. Syst Contr Lett, 1997, 31: 225-233 CrossRef Google Scholar https://scholar.google.com/scholar?author=Kuijper M&publication_year=1997&journal=Syst Contr Lett&volume=31&pages=225-233

[23] van Barel M, Bultheel M A. Linear Alg Appl, 1997, 254: 527-551 CrossRef Google Scholar https://scholar.google.com/scholar?author=van Barel M&author=Bultheel M A&publication_year=1997&journal=Linear Alg Appl&volume=254&pages=527-551

[24] Wang L P. A lattice-based minimal partial realization algorithm. In: Proceedings of 5th International Conference on Sequences and Their Applications, Lexington, 2008. 278--289. Google Scholar https://scholar.google.com/scholar?&q=Wang L P. A lattice-based minimal partial realization algorithm. In: Proceedings of 5th International Conference on Sequences and Their Applications, Lexington, 2008. 278--289&

[25] Wang L P. Cryptogr Commun, 2011, 3: 29-42 CrossRef Google Scholar https://scholar.google.com/scholar?author=Wang L P&publication_year=2011&journal=Cryptogr Commun&volume=3&pages=29-42

[26] Wang L P. Lagrange interpolation polynomials and generalized Reed-Solomon codes over rings of matrices. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2012. 3098--3100. Google Scholar https://scholar.google.com/scholar?&q=Wang L P. Lagrange interpolation polynomials and generalized Reed-Solomon codes over rings of matrices. In: Proceedings of IEEE International Symposium on Information Theory, Cambridge, 2012. 3098--3100&

[27] Quintin G, Barbier M, Chabot C. IEEE Trans Inform Theory, 2013, 59: 5882-5897 CrossRef Google Scholar https://scholar.google.com/scholar?author=Quintin G&author=Barbier M&author=Chabot C&publication_year=2013&journal=IEEE Trans Inform Theory&volume=59&pages=5882-5897

[28] Dai Z D, Imamura K, Yang J H. Asymptotic behavior of normalized linear complexity of multi-sequences. In: Proceeding of 3rd International Conference on Sequences and Their Applications, Seoul, 2004. 126--142. Google Scholar https://scholar.google.com/scholar?&q=Dai Z D, Imamura K, Yang J H. Asymptotic behavior of normalized linear complexity of multi-sequences. In: Proceeding of 3rd International Conference on Sequences and Their Applications, Seoul, 2004. 126--142&

[29] Niederreiter H, Wang L P. Proof of a conjecture on the joint linear complexity profile of multisequences. In: Proceeding of 6th International Conference on Cryptology in India, Bangalore, 2005. 13--22. Google Scholar https://scholar.google.com/scholar?&q=Niederreiter H, Wang L P. Proof of a conjecture on the joint linear complexity profile of multisequences. In: Proceeding of 6th International Conference on Cryptology in India, Bangalore, 2005. 13--22&

[30] Niederreiter H, Wang L P. Monatsh Math, 2007, 150: 141-155 CrossRef Google Scholar https://scholar.google.com/scholar?author=Niederreiter H&author=Wang L P&publication_year=2007&journal=Monatsh Math&volume=150&pages=141-155

[31] Niederreiter H, Vielhaber M, Wang L P. Sci China Inf Sci, 2012, 55: 165-170 CrossRef Google Scholar https://scholar.google.com/scholar?author=Niederreiter H&author=Vielhaber M&author=Wang L P&publication_year=2012&journal=Sci China Inf Sci&volume=55&pages=165-170

[32] Wang L P, Niederreiter H. Finite Fields Appl, 2006, 12: 613-637 CrossRef Google Scholar https://scholar.google.com/scholar?author=Wang L P&author=Niederreiter H&publication_year=2006&journal=Finite Fields Appl&volume=12&pages=613-637

[33] Mahler K. Ann Math, 1941, 42: 488-522 CrossRef Google Scholar https://scholar.google.com/scholar?author=Mahler K&publication_year=1941&journal=Ann Math&volume=42&pages=488-522

[34] Couture R, L'Ecuyer P. Math Comput, 2000, 69: 757-765 Google Scholar https://scholar.google.com/scholar?author=Couture R&author=L'Ecuyer P&publication_year=2000&journal=Math Comput&volume=69&pages=757-765