{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T06:05:09Z","timestamp":1775455509504,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319951614","type":"print"},{"value":"9783319951621","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95162-1_5","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T04:15:34Z","timestamp":1530591334000},"page":"67-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["NLFSR Functions with Optimal Periods"],"prefix":"10.1007","author":[{"given":"Sultan","family":"Almuhammadi","sequence":"first","affiliation":[]},{"given":"Ibraheem","family":"Al-Hejri","sequence":"additional","affiliation":[]},{"given":"Ghashmi Bin","family":"Talib","sequence":"additional","affiliation":[]},{"given":"Awadh","family":"Gaamel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"9","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TCAD.2004.831584","volume":"23","author":"G Mrugalski","year":"2004","unstructured":"Mrugalski, G., Rajski, J., Tyszer, J.: Ring generators-new devices for embedded test applications. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(9), 1306\u20131320 (2004)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/2.67207","volume":"24","author":"K Zeng","year":"1991","unstructured":"Zeng, K., Yang, C.-H., Wei, D.-Y., Rao, T.: Pseudorandom bit generators in stream-cipher cryptography. Computer 24(2), 8\u201317 (1991)","journal-title":"Computer"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"McCluskey, J.: High speed calculation of cyclic redundancy codes. In: Proceedings of the 1999 ACM\/SIGDA Seventh International symposium on Field Programmable Gate Arrays, p. 250. ACM (1999)","DOI":"10.1145\/296399.296516"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1080\/002072197136075","volume":"82","author":"A Ahmad","year":"1997","unstructured":"Ahmad, A.: Achievement of higher testability goals through the modification of shift registers in LFSR-based testing. Int. J. Electron. 82(3), 249\u2013260 (1997)","journal-title":"Int. J. Electron."},{"key":"5_CR5","volume-title":"Shift Register Sequences","author":"S Golomb","year":"1982","unstructured":"Golomb, S.: Shift Register Sequences. Aegean, Laguna Hills (1982)"},{"key":"5_CR6","unstructured":"Jansen, C.J.A.: Investigations on nonlinear streamcipher systems: construction and evaluation methods (1989)"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10623-014-9947-3","volume":"73","author":"E Dubrova","year":"2014","unstructured":"Dubrova, E.: Generation of full cycles by a composition of NLFSRS. Des. Codes Crypt. 73(2), 469\u2013486 (2014)","journal-title":"Des. Codes Crypt."},{"key":"5_CR8","unstructured":"Rachwalik, T., Szmidt, J., Wicik, R., Zab\u0142ocki, J.: Generation of nonlinear feedback shift registers with special-purpose hardware. In: 2012 Military Communications and Information Systems Conference (MCC), pp. 1\u20134. IEEE (2012)"},{"key":"5_CR9","unstructured":"Sainte-Marie, C.F.: Solution to question nr. 48. L\u00e2\u00c2\u0179interm\u00e9diaire des Math\u00e9maticiens, vol. 1, pp. 107\u2013110 (1894)"},{"key":"5_CR10","unstructured":"de Bruijn, F.: A combinatorial problem (1946)"},{"issue":"5","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1109\/18.57220","volume":"36","author":"GL Mayhew","year":"1990","unstructured":"Mayhew, G.L., Golomb, S.W.: Linear spans of modified de bruijn sequences. IEEE Trans. Inf. Theor. 36(5), 1166\u20131167 (1990)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"5_CR12","unstructured":"Gammel, B.M., G\u00f6ttfert, R., Kniffler, O.: The achterbahn stream cipher. Submiss. eSTREAM (2005)"},{"key":"5_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and their Applications","author":"R Lidl","year":"1994","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications. Cambridge University Press, Cambridge (1994)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J Massey","year":"1969","unstructured":"Massey, J.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theor. 15(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"11","key":"5_CR15","doi-asserted-by":"publisher","first-page":"5263","DOI":"10.1109\/TIT.2009.2030467","volume":"55","author":"E Dubrova","year":"2009","unstructured":"Dubrova, E.: A transformation from the Fibonacci to the Galois NLFSRS. IEEE Trans. Inf. Theor. 55(11), 5263\u20135271 (2009)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-15874-2_3","volume-title":"Sequences and Their Applications","author":"JM Chabloz","year":"2010","unstructured":"Chabloz, J.M., Mansouri, S.S., Dubrova, E.: An algorithm for constructing a fastest Galois NLFSR generating a given sequence. In: Carlet, C., Pott, A. (eds.) SETA 2010. LNCS, vol. 6338, pp. 41\u201354. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15874-2_3"},{"issue":"6","key":"5_CR17","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1109\/TIT.2010.2046250","volume":"56","author":"E Dubrova","year":"2010","unstructured":"Dubrova, E.: Finding matching initial states for equivalent NLFSRS in the fibonacci and the galois configurations. IEEE Trans. Inf. Theor. 56(6), 2961\u20132966 (2010)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Liu, M., Mansouri, S.S. Dubrova, E.: A faster shift register alternative to filter generators. In: Digital System Design (DSD) Euromicro Conference on 2013, pp. 713\u2013718. IEEE (2013)","DOI":"10.1109\/DSD.2013.81"},{"key":"5_CR19","first-page":"55","volume":"14","author":"A Castro Lechtaler","year":"2014","unstructured":"Castro Lechtaler, A., Cipriano, M., Garc\u00eda, E., Liporace, J., Maiorano, A., Malvacio, E.: Model design for a reduced variant of a trivium type stream cipher. J. Comput. Sci. Technol. 14, 55\u201358 (2014)","journal-title":"J. Comput. Sci. Technol."},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H Fredricksen","year":"1982","unstructured":"Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195\u2013221 (1982)","journal-title":"SIAM Rev."},{"key":"5_CR21","unstructured":"Dubrova, E.: A list of maximum-period NLFSRS (2012)"},{"key":"5_CR22","unstructured":"Mandal, K., Gong, G.: Probabilistic generation of good span n sequences from nonlinear feedback shift registers. University of Waterloo (2012)"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1112\/jlms\/s1-21.3.167","volume":"1","author":"IJ Good","year":"1946","unstructured":"Good, I.J.: Normal recurring decimals. J. London Math. Soc. 1(3), 167\u2013169 (1946)","journal-title":"J. London Math. Soc."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge international series on parallel computation (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-662-04166-6_10","volume-title":"Formal Power Series and Algebraic Combinatorics","author":"C Banderier","year":"2000","unstructured":"Banderier, C., Dobrow, R.P.: A generalized cover time for random walks on graphs. In: Krob, D., Mikhalev, A.A., Mikhalev, A.V. (eds.) Formal Power Series and Algebraic Combinatorics, pp. 113\u2013124. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-662-04166-6_10"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95162-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T04:09:23Z","timestamp":1571544563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-95162-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319951614","9783319951621"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95162-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}