{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T09:33:16Z","timestamp":1773221596294,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642306143","type":"print"},{"value":"9783642306150","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30615-0_18","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T12:54:41Z","timestamp":1340801681000},"page":"190-201","source":"Crossref","is-referenced-by-count":12,"title":["Word-Oriented Transformation Shift Registers and Their Linear Complexity"],"prefix":"10.1007","author":[{"given":"Sartaj Ul","family":"Hasan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Panario","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Handbook of Combinatorial Designs, Discrete Mathematics and its Applications","year":"2007","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, Discrete Mathematics and its Applications, 2nd edn. Chapman & Hall\/CRC, Boca Raton (2007)","edition":"2"},{"issue":"8","key":"18_CR2","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1109\/TIT.2003.814487","volume":"49","author":"M. Dewar","year":"2003","unstructured":"Dewar, M., Panario, D.: Linear transformation shift registers. IEEE Trans. Inform. Theory\u00a049(8), 2047\u20132052 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-24633-6_5","volume-title":"Finite Fields and Applications","author":"M. Dewar","year":"2004","unstructured":"Dewar, M., Panario, D.: Mutual Irreducibility of Certain Polynomials. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds.) Fq7 2003. LNCS, vol.\u00a02948, pp. 59\u201368. Springer, Heidelberg (2004)"},{"key":"18_CR4","unstructured":"Dewar, M., Panario, D.: Tables for linear transformation shift registers, http:\/\/www.math.carleton.ca\/~daniel\/research\/tsr\/"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Gao, F., Yang, Y., Tan, G.: Some results on word-oriented nonlinear feedback shift registers. In: The Proceedings of International Conference on Electronics and Optoelectronics (ICEOE 2011), pp. V4-357\u2013V4-359 (2011)","DOI":"10.1109\/ICEOE.2011.6013504"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10623-010-9387-7","volume":"58","author":"S.R. Ghorpade","year":"2011","unstructured":"Ghorpade, S.R., Hasan, S.U., Kumari, M.: Primitive polynomials, Singer cycles, and word oriented linear feedback shift registers. Des. Codes Cryptogr.\u00a058(2), 123\u2013134 (2011)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"18_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ffa.2011.02.008","volume":"17","author":"S.R. Ghorpade","year":"2011","unstructured":"Ghorpade, S.R., Ram, S.: Block companion Singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields. Finite Fields Appl.\u00a017(5), 461\u2013472 (2011)","journal-title":"Finite Fields Appl."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Ghorpade, S.R., Ram, S.: Enumeration of splitting subspaces over finite fields. To Appear in: Aubry, Y., Ritzenthaler, C., Zykin, A. (eds.) Arithmetic, Geometry, Cryptography and Coding Theory, Luminy, France. Contemp. Math. Amer. Math. Society (2011)","DOI":"10.1090\/conm\/574\/11430"},{"key":"18_CR9","unstructured":"Golomb, S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Golomb, S.W., Gong, G.: Signal Design for Good Correlation. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511546907"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TIT.1971.1054618","volume":"17","author":"E.J. Groth","year":"1971","unstructured":"Groth, E.J.: Generation of binary sequences with controllable complexity. IEEE Trans. Inform. Theory\u00a017, 288\u2013296 (1971)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/TIT.1976.1055626","volume":"6","author":"E.L. Key","year":"1976","unstructured":"Key, E.L.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory\u00a06, 732\u2013736 (1976)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"228","DOI":"10.2307\/3610395","volume":"42","author":"C.D. Langford","year":"1958","unstructured":"Langford, C.D.: Problem. Math. Gaz.\u00a042, 228 (1958)","journal-title":"Math. Gaz."},{"key":"18_CR14","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1983)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0024-3795(93)90247-L","volume":"192","author":"H. Niederreiter","year":"1993","unstructured":"Niederreiter, H.: Factorization of polynomials and some linear-algebra problems over finite fields. Linear Algebra Appl.\u00a0192, 301\u2013328 (1993)","journal-title":"Linear Algebra Appl."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/ffta.1995.1002","volume":"1","author":"H. Niederreiter","year":"1995","unstructured":"Niederreiter, H.: The multiple-recursive matrix method for pseudorandom number generation. Finite Fields Appl.\u00a01, 3\u201330 (1995)","journal-title":"Finite Fields Appl."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1090\/S0025-5718-1995-1265018-4","volume":"64","author":"H. Niederreiter","year":"1995","unstructured":"Niederreiter, H.: Pseudorandom vector generation by the multiple-recursive matrix method. Math. Comp.\u00a064, 279\u2013294 (1995)","journal-title":"Math. Comp."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/ffta.1996.0015","volume":"2","author":"H. Niederreiter","year":"1996","unstructured":"Niederreiter, H.: Improved bound in the multiple-recursive matrix method for pseudorandom number and vector generation. Finite Fields Appl.\u00a02, 225\u2013240 (1996)","journal-title":"Finite Fields Appl."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60590-8_1","volume-title":"Fast Software Encryption","author":"B. Preneel","year":"1995","unstructured":"Preneel, B.: Introduction to the Proceedings of the Second Workshop on Fast Software Encryption. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 1\u20135. Springer, Heidelberg (1995)"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/ffta.2001.0339","volume":"8","author":"B. Tsaban","year":"2002","unstructured":"Tsaban, B., Vishne, U.: Efficient feedback shift registers with maximal period. Finite Fields Appl.\u00a08, 256\u2013267 (2002)","journal-title":"Finite Fields Appl."},{"key":"18_CR21","unstructured":"Zeng, G., Han, W., He, K.: Word-oriented feedback shift register: \u03c3-LFSR (Cryptology ePrint Archive: Report 2007\/114), http:\/\/eprint.iacr.org\/2007\/114"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-02181-7_14","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"G. Zeng","year":"2009","unstructured":"Zeng, G., Yang, Y., Han, W., Fan, S.: Word Oriented Cascade Jump \u03c3\u2212LFSR. In: Bras-Amor\u00f3s, M., H\u00f8holdt, T. (eds.) AAECC 2009. LNCS, vol.\u00a05527, pp. 127\u2013136. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Sequences and Their Applications \u2013 SETA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30615-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T18:38:47Z","timestamp":1743619127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30615-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642306143","9783642306150"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30615-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}