{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:47:34Z","timestamp":1753886854377},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39805-8_14","type":"book-chapter","created":{"date-parts":[[2007,4,14]],"date-time":"2007-04-14T08:09:22Z","timestamp":1176538162000},"page":"119-129","source":"Crossref","is-referenced-by-count":23,"title":["On Functions of Linear Shift Register Sequences"],"prefix":"10.1007","author":[{"given":"Tore","family":"Herlestam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"L. Fibonacci, Liber Abaci, 1202"},{"key":"14_CR2","unstructured":"E. Galois, \u201cSur la theorie des nombres\u201d, Bull. Sci. Math. de M. Ferussac, 1830; J. Math. Pures Appl., 1846"},{"key":"14_CR3","first-page":"146","volume":"2","author":"L. Kronecker","year":"1881","unstructured":"L. Kronecker, Werke Bd. 2, pp. 146\u2013149, 1881","journal-title":"Werke"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"D. E. M\u00fcller, \u201cApplication of Boolean Algebra to Switching Circuit Design and to Error Detection\u201d, IRE Trans. on Electron, Comp., 1954","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"I. S, Reed, \u201cA Class of Error Correcting Codes and the Decoding Scheme\u201d, IRE Trans. on Electron. Comp., 1954","DOI":"10.1109\/TIT.1954.1057465"},{"key":"14_CR6","unstructured":"N. Zierler, \u201cLinear Recurring Sequences\u201d, J. SIAM, 1959; also in W. H. Kautz, Linear Sequential Switching Circuits, Holden-Day, San Francisco, 1965"},{"key":"14_CR7","volume-title":"Linear Recurrence Relations over Finite Fields","author":"E. S. Selmer","year":"1966","unstructured":"E. S. Selmer, Linear Recurrence Relations over Finite Fields, Univ. of Bergen, Norway, 1966"},{"key":"14_CR8","volume-title":"Algebra I","author":"B. L. Waerden van der","year":"1966","unstructured":"B. L. van der Waerden, Algebra I, Springer, Berlin, 1966"},{"key":"14_CR9","volume-title":"Shift Register Sequences","author":"S. W. Golomb","year":"1967","unstructured":"S. W. Golomb, Shift Register Sequences, Holden-Day, San Francisco, 1967"},{"key":"14_CR10","volume-title":"Algebraic Coding Theory","author":"E. R. Berlekamp","year":"1968","unstructured":"E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York. 1968"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"J. L. Massey, \u201cShift-Register Synthesis and BCH Decoding\u201d, IEEE Trans on Inform. Th., 1969","DOI":"10.1109\/TIT.1969.1054260"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"E. J. Groth, \u201cGeneration of Binary Sequences with Controllable Complexity\u201d, IEEE Trans. on Inform. Th., 1971","DOI":"10.1109\/TIT.1971.1054618"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"N. Zierler and W. H. Mills, \u201cProducts of Linear Recurring Sequences\u201d, J. Algebra, 1973","DOI":"10.1016\/0021-8693(73)90170-1"},{"key":"14_CR14","unstructured":"M. P. Ristenbatt et al., \u201cCrack-Resistant Sequences for Data Security\u201d, IEEE Nat. Telecomm. Conf., 1973"},{"key":"14_CR15","unstructured":"P. R. Geffe, \u201cHow to Protect Data with Ciphers That Are Really Hard to Break\u201d, Electronics, 1973"},{"key":"14_CR16","unstructured":"P. Nyffeler, Bin\u00e4re Automaten und ihren linearen Rekursionen, Ph.D. Thesis, Bern, 1975"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"B. Benjauthrit and I. S. Reed, \u201cGalois Switching Functions and Their Applications\u201d, IEEE Trans. on Comp., 1976","DOI":"10.1109\/TC.1976.5009207"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"E. L. Key, \u201cAn Analysis of the Structure and Complexity of Nonlinear Binary Sequences Generators\u201d, IEEE Trans. on Inform. Th., 1976","DOI":"10.1109\/TIT.1976.1055626"},{"key":"14_CR19","unstructured":"K. P. Yiu and R. B. Ward, \u201cA Method for Deciphering a Maximal-Length Sequence\u201d, Proc. IEEE, 1977"},{"key":"14_CR20","volume-title":"On Linearization of Nonlinear Combinations of Linear Shift Register Sequences","author":"T. Herlestam","year":"1977","unstructured":"T. Herlestam, \u201cOn Linearization of Nonlinear Combinations of Linear Shift Register Sequences\u201d, IEEE ISIT, Ithaca, New York, 1977"},{"key":"14_CR21","volume-title":"Galoisfelder, Kreisteilungsk\u00f6rper und Schieberegisterfolgen","author":"H. L\u00fcneburg","year":"1979","unstructured":"H. L\u00fcneburg, Galoisfelder, Kreisteilungsk\u00f6rper und Schieberegisterfolgen, Bibliogr. Inst., Z\u00fcrich, 1979"},{"key":"14_CR22","volume-title":"Applied Combinatorics","author":"A. Tucker","year":"1980","unstructured":"A. Tucker, Applied Combinatorics, Wiley, New York, 1980"},{"key":"14_CR23","unstructured":"S. M. Jennings, A Special Class of Binary Sequences, Ph.D. Thesis, London, 1980"},{"key":"14_CR24","volume-title":"Cryptography, Proc. Burg Feuerstein, 1982","author":"T. Herlestam","year":"1983","unstructured":"T. Herlestam, \u201cOn Using Prime Polynomials in Crypto Generators\u201d, in Cryptography, Proc. Burg Feuerstein, 1982, ed. by T. Beth, Springer, Berlin, 1983"},{"key":"14_CR25","volume-title":"On the Complexity of Functions of Linear Shift Register Sequences","author":"T. Herlestam","year":"1982","unstructured":"T. Herlestam, \u201cOn the Complexity of Functions of Linear Shift Register Sequences\u201d, IEEE ISIT, Les Arcs, France, 1982"},{"key":"14_CR26","volume-title":"Cipher Systems","author":"H. Beker","year":"1982","unstructured":"H. Beker and F. Piper, Cipher Systems, Northwood Publ., London, 1982"},{"key":"14_CR27","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Encycl. Math. and Its Appl. Vol. 20, Addison-Wesley, 1983"},{"key":"14_CR28","unstructured":"T. Herlestam, \u201cOn the Complexity of Certain Crypto Generators\u201d, in security, IFIP\/sec\u201983, ed. by V. F\u00e5k, North-Holland, 1983"},{"key":"14_CR29","unstructured":"R. Rueppel, New Approaches to Stream Ciphers, Ph.D. Thesis, Z\u00fcrich, 1984"},{"key":"14_CR30","unstructured":"L. Brynielsson, \u201cOn the Linear Complexity of Combined Shift Register Sequences\u201d, Eurocrypt 85, Linz, Austria, 1985"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 85"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39805-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:39Z","timestamp":1605647139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39805-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540164685"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-39805-8_14","relation":{},"subject":[]}}