Fast Algorithms for Determining the Linear Complexity of Period Sequences

Guozhen Xiao, Shimin Wei. Fast Algorithms for Determining the Linear Complexity of Period Sequences. In Alfred Menezes, Palash Sarkar, editors, Progress in Cryptology - INDOCRYPT 2002, Third International Conference on Cryptology in India, Hyderabad, India, December 16-18, 2002. Volume 2551 of Lecture Notes in Computer Science, pages 12-21, Springer, 2002. [doi]

@inproceedings{XiaoW02,
  title = {Fast Algorithms for Determining the Linear Complexity of Period Sequences},
  author = {Guozhen Xiao and Shimin Wei},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2551/25510012.htm},
  researchr = {https://researchr.org/publication/XiaoW02},
  cites = {0},
  citedby = {0},
  pages = {12-21},
  booktitle = {Progress in Cryptology - INDOCRYPT 2002, Third International Conference on Cryptology in India, Hyderabad, India, December 16-18, 2002},
  editor = {Alfred Menezes and Palash Sarkar},
  volume = {2551},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-00263-4},
}