{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:51:55Z","timestamp":1725454315219},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593393"},{"type":"electronic","value":"9783540492368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0000426","type":"book-chapter","created":{"date-parts":[[2005,10,7]],"date-time":"2005-10-07T11:27:29Z","timestamp":1128684449000},"page":"80-90","source":"Crossref","is-referenced-by-count":8,"title":["On the linear complexity of nonlinearly filtered PN-sequences"],"prefix":"10.1007","author":[{"given":"Amparo","family":"F\u00faster-Sabater","sequence":"first","affiliation":[]},{"given":"Pino","family":"Caballero-Gil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,8]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TIT.1971.1054618","volume":"IT-17","author":"E.J. Groth","year":"1971","unstructured":"E.J. Groth, Generation of binary sequences with controllable complexity, IEEE Trans. Inform. Theory, vol. IT-17, pp. 288\u2013296, May 1971.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR2","doi-asserted-by":"crossref","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, vol. IT-22, pp. 732\u2013736, Nov. 1976.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/TIT.1983.1056766","volume":"IT-29","author":"P. V. Kumar","year":"1983","unstructured":"P. V. Kumar and R. A. Scholtz, Bounds on the linear span of bent sequences, IEEE Trans. Inform. Theory, vol. IT-29, pp. 854\u2013862, Nov. 1983.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"J.L. Massey, Shift-Register synthesis and BCH decoding, IEEE Trans. Inform. Theory, vol. IT-15, Jan. 1969.","DOI":"10.1109\/TIT.1969.1054260"},{"key":"7_CR5","unstructured":"J.L. Massey, Seminar Cryptography: Fundamentals and applications, Zurich, 1990."},{"key":"7_CR6","volume-title":"Error-Correcting Codes","author":"W.W. Peterson","year":"1972","unstructured":"W.W. Peterson and E.J. Weldon, Error-Correcting Codes, Cambridge, MA: MIT Press, 1972."},{"key":"7_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and design of stream ciphers","author":"R.A Rueppel","year":"1986","unstructured":"R.A Rueppel, Analysis and design of stream ciphers, Springer-Verlag, New York, 1986."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT'94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T17:46:40Z","timestamp":1549216000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593393","9783540492368"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0000426","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}