{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:37Z","timestamp":1725551617516},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308553"},{"type":"electronic","value":"9783540324249"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11599548_17","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:44:08Z","timestamp":1133430248000},"page":"202-209","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences"],"prefix":"10.1007","author":[{"given":"Shimin","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guolong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guozhen","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J.L. Massey","year":"1969","unstructured":"Massey, J.L.: Shift register synthesis and BCH decoding. IEEE Trans. on Inform. Theory.\u00a015(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. on Inform. Theory."},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"R.A. Games","year":"1983","unstructured":"Games, R.A., Chan, A.H.: A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Trans on Inform. Theory\u00a029(1), 144\u2013146 (1983)","journal-title":"IEEE Trans on Inform. Theory"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54973-0","volume-title":"The Stability Theory of Stream Ciphers","author":"C. Ding","year":"1991","unstructured":"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.\u00a0561, Springer, Heidelberg (1991)"},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/18.868492","volume":"46","author":"G. Xiao","year":"2000","unstructured":"Xiao, G., Wei, S., Lam, K.Y., Imamura, K.: A fast algorithm for determining the linear complexity of a sequence with period p\n                           n over GF(q). IEEE Trans. on Inform. Theory\u00a046(6), 2203\u20132206 (2000)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"6","key":"17_CR5","first-page":"453","volume":"44","author":"S. Wei","year":"2001","unstructured":"Wei, S., Xiao, G., Chen, Z.: A fast algorithm for determining the linear complexity of a binary sequence with period 2n\n                           p\n                           m. Science in China(Series F)\u00a044(6), 453\u2013460 (2001)","journal-title":"Science in China(Series F)"},{"issue":"10","key":"17_CR6","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1109\/TIT.2002.802609","volume":"48","author":"S. Wei","year":"2002","unstructured":"Wei, S., Xiao, G., Chen, Z.: a fast algorithm for determining the minimal polynomial of a sequence with period 2p\n                           n over GF(q). IEEE Trans. on Inform. Theory\u00a048(10), 2754\u20132758 (2002)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"17_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"R.J. McEliece","year":"1987","unstructured":"McEliece, R.J.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic, Boston (1987)"},{"key":"17_CR8","volume-title":"Elementary Number Theory and Its Applications","author":"K.H. Rosen","year":"1988","unstructured":"Rosen, K.H.: Elementary Number Theory and Its Applications. Addision-Wesley, Reading (1988)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11599548_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:00:00Z","timestamp":1619492400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11599548_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308553","9783540324249"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11599548_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}