{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:20:28Z","timestamp":1725495628682},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534334"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46885-4_54","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T14:15:56Z","timestamp":1195136156000},"page":"563-570","source":"Crossref","is-referenced-by-count":0,"title":["On the Linear Complexity of Feedback Registers"],"prefix":"10.1007","author":[{"given":"A. H.","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Goresky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Klapper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0097-3165(82)90038-3","volume":"A 33-3","author":"A.H. Chan","year":"1982","unstructured":"A.H. Chan, R.A. Games and E.L. Key. On the complexity of de Bruijn sequences. Journal of Combinatorial Theory, Series A 33-3, pp. 233\u2013246, 1982.","journal-title":"Journal of Combinatorial Theory"},{"key":"54_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H. Fredricksen","year":"1982","unstructured":"H. Fredricksen. A Survey of Full Length Nonlinear Shift Register Cycle Algorithms. SIAM Review 24, pp. 195\u2013221, 1982.","journal-title":"SIAM Review"},{"key":"54_CR3","volume-title":"Shift Register Sequences","author":"S. Golomb","year":"1982","unstructured":"S. Golomb, \u201cShift Register Sequences\u201d, Aegean Park Press, Laguna Hills, CA, 1982."},{"issue":"6","key":"54_CR4","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/TIT.1976.1055626","volume":"IT-22","author":"E.L. Key","year":"1976","unstructured":"E.L. Key. An Analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory IT-22 no. 6, pp. 732\u2013736, Nov. 1976.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT-15","author":"J.L. Massey","year":"1969","unstructured":"J.L. Massey. Shift Register Synthesis and BCH Decoding. IEEE Trans. Inform. Theory IT-15, page 122\u2013127, 1969.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"54_CR6","volume-title":"New approaches to stream ciphers","author":"R.A. Rueppel","year":"1984","unstructured":"R.A. Rueppel. New approaches to stream ciphers. Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, Switzerland. 1984."},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1987.1057268","volume":"IT-33","author":"R.A. Rueppel","year":"1987","unstructured":"R.A. Rueppel and O.J. Staffelbach. Products of Linear Recurring Sequences with Maximum Complexity IEEE Trans. Inform. Theory IT-33 no. 1, pp.124\u2013131, 1987.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201989"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46885-4_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:49:07Z","timestamp":1619570947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46885-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540534334"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-46885-4_54","relation":{},"subject":[]}}