{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:53:41Z","timestamp":1761663221873},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11432-013-5058-4","type":"journal-article","created":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T05:21:59Z","timestamp":1389158519000},"page":"1-14","source":"Crossref","is-referenced-by-count":19,"title":["Novel way to research nonlinear feedback shift register"],"prefix":"10.1007","volume":"57","author":[{"given":"DaWei","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HaiPeng","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LiXiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SiLi","family":"Hui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YiXian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"5058_CR1","volume-title":"Shift Register Sequences","author":"S W Golomb","year":"1982","unstructured":"Golomb S W, Welch L R, Goldstein R M, et al. Shift Register Sequences. Laguna Hills: Aegean Park Press, 1982"},{"key":"5058_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/12.364534","volume":"44","author":"S Hellebrand","year":"1995","unstructured":"Hellebrand S, Rajski J, Tarnick S, et al. Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers. IEEE Trans Comput, 1995, 44: 223\u2013233","journal-title":"IEEE Trans Comput"},{"key":"5058_CR3","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1109\/12.805153","volume":"48","author":"C Paar","year":"1999","unstructured":"Paar C, Fleischmann P, Soria-Rodriguez P. Fast arithmetic for public-key algorithms in Galois fields with composite exponents. IEEE Trans Comput, 1999, 48: 1025\u20131034","journal-title":"IEEE Trans Comput"},{"key":"5058_CR4","doi-asserted-by":"crossref","first-page":"1919","DOI":"10.1049\/el:19991335","volume":"35","author":"T K Moon","year":"1999","unstructured":"Moon T K, Veeramachaneni S. Linear feedback shift registers as vector quantisation codebooks. Electron Lett, 1999, 35: 1919\u20131920","journal-title":"Electron Lett"},{"key":"5058_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.cose.2008.11.006","volume":"28","author":"P P Deepthi","year":"2009","unstructured":"Deepthi P P, Sathidevi P S. Design, implementation and analysis of hardware efficient stream ciphers using LFSR based hash functions. Comput Secur, 2009, 28: 229\u2013241","journal-title":"Comput Secur"},{"key":"5058_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-642-21802-6_40","volume-title":"Advanced Research on Computer Education, Simulation and Modeling","author":"A S Khashandarag","year":"2011","unstructured":"Khashandarag A S, Navin A H, Mirnia M K, et al. An optimized color image steganography using LFSR and DFT techniques. In: Lin S, Huang X, eds. Advanced Research on Computer Education, Simulation and Modeling. Berlin\/Heidelberg: Springer, 2011. 247\u2013253"},{"key":"5058_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s12095-011-0042-6","volume":"3","author":"J Choy","year":"2011","unstructured":"Choy J, Chew G, Khoo K, et al. Cryptographic properties and application of a generalized unbalanced Feistel network structure. Cryptogr Commun, 2011, 3: 141\u2013164","journal-title":"Cryptogr Commun"},{"key":"5058_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-1-4419-1530-6_6","volume-title":"Security in Embedded Devices","author":"C H Gebotys","year":"2010","unstructured":"Gebotys C H. Security in Embedded Devices. Springer US, 2010. 111\u2013142"},{"key":"5058_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10623-008-9206-6","volume":"48","author":"A Klein","year":"2008","unstructured":"Klein A. Attacks on the RC4 stream cipher. Designs Codes Cryptogr, 2008, 48: 269\u2013286","journal-title":"Designs Codes Cryptogr"},{"key":"5058_CR10","doi-asserted-by":"crossref","first-page":"1635","DOI":"10.1007\/s11432-011-4295-7","volume":"54","author":"B Zhang","year":"2011","unstructured":"Zhang B, Feng D G. Improved multi-pass fast correlation attacks with applications. Sci China Inf Sci, 2011, 54: 1635\u20131644","journal-title":"Sci China Inf Sci"},{"key":"5058_CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/18.42178","volume":"35","author":"J D Golic","year":"1989","unstructured":"Golic J D. On the linear complexity of functions of periodic GF(q) sequences. IEEE Trans Inf Theory, 1989, 35: 69\u201375","journal-title":"IEEE Trans Inf Theory"},{"key":"5058_CR12","first-page":"421","volume":"10","author":"N G Bruijn De","year":"1948","unstructured":"De Bruijn N G, Erdos P. A combinatorial problem. Indag Math, 10, 1948: 421\u2013423","journal-title":"Indag Math"},{"key":"5058_CR13","volume-title":"Nonlinear Feedback Shift Register","author":"Z X Wan","year":"1978","unstructured":"Wan Z X, Dai Z D, Liu M L, et al. Nonlinear Feedback Shift Register. Beijing: Science Press, 1978"},{"key":"5058_CR14","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1109\/TIT.2005.844090","volume":"51","author":"P Rizomiliotis","year":"2005","unstructured":"Rizomiliotis P, Kalouptsidis N. Results on the nonlinear span of binary sequences. IEEE Trans Inf Theory, 2005, 51: 1555\u20131563","journal-title":"IEEE Trans Inf Theory"},{"key":"5058_CR15","doi-asserted-by":"crossref","first-page":"1840","DOI":"10.1109\/TIT.2005.846428","volume":"51","author":"P Rizomiliotis","year":"2005","unstructured":"Rizomiliotis P, Kolokotronis N, Kalouptsidis N. On the quadratic span of binary sequences. IEEE Trans Inf Theory, 2005, 51: 1840\u20131848","journal-title":"IEEE Trans Inf Theory"},{"key":"5058_CR16","doi-asserted-by":"crossref","first-page":"4293","DOI":"10.1109\/TIT.2007.907442","volume":"53","author":"K Limniotis","year":"2007","unstructured":"Limniotis K, Kolokotronis N, Kalouptsidis N. On the nonlinear complexity and LempelCZiv complexity of finite length sequences. IEEE Trans Inf Theory, 2007, 53: 4293\u20134302","journal-title":"IEEE Trans Inf Theory"},{"key":"5058_CR17","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1109\/18.133272","volume":"37","author":"C J A Jansen","year":"1991","unstructured":"Jansen C J A, Franx W G, Boekee D E. An efficient algorithm for the generation of DeBruijn cycles. IEEE Trans Inf Theory, 1991, 37: 1475\u20131478","journal-title":"IEEE Trans Inf Theory"},{"key":"5058_CR18","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/12.565596","volume":"46","author":"F S Annexstein","year":"1997","unstructured":"Annexstein F S. Generating de Bruijn sequences: an efficient implementation. IEEE Trans Comput, 1997, 46: 198\u2013200","journal-title":"IEEE Trans Comput"},{"key":"5058_CR19","doi-asserted-by":"crossref","first-page":"565","DOI":"10.4310\/MAA.2003.v10.n4.a5","volume":"10","author":"D Cheng","year":"2003","unstructured":"Cheng D, Dong Y. Semi-tensor product of matrices and its some applications to physics. Meth Appl Anal, 2003, 10: 565\u2013588","journal-title":"Meth Appl Anal"},{"key":"5058_CR20","doi-asserted-by":"crossref","first-page":"2251","DOI":"10.1109\/TAC.2010.2043294","volume":"55","author":"D Cheng","year":"2010","unstructured":"Cheng D, Qi H. A linear representation of dynamics of Boolean networks. IEEE Trans Automat Contr, 2010, 55: 2251\u20132258","journal-title":"IEEE Trans Automat Contr"},{"key":"5058_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-85729-097-7","volume-title":"Analysis and Control of Boolean Networks: a Semi-Tensor Product Approach","author":"D Cheng","year":"2011","unstructured":"Cheng D, Qi H, Li Z. Analysis and Control of Boolean Networks: a Semi-Tensor Product Approach. London: Springer, 2011"},{"key":"5058_CR22","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TNN.2011.2106512","volume":"22","author":"D Cheng","year":"2011","unstructured":"Cheng D, Qi H, Li Z. Model construction of Boolean network via observed data. IEEE Trans Neural Netw, 2011, 22: 525\u2013536","journal-title":"IEEE Trans Neural Netw"},{"key":"5058_CR23","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TAC.2010.2050161","volume":"56","author":"D Cheng","year":"2011","unstructured":"Cheng D. Disturbance decoupling of Boolean control networks. IEEE Trans Automat Contr, 2011, 56: 2\u201310","journal-title":"IEEE Trans Automat Contr"},{"key":"5058_CR24","doi-asserted-by":"crossref","first-page":"1659","DOI":"10.1016\/j.automatica.2009.03.006","volume":"45","author":"D Cheng","year":"2009","unstructured":"Cheng D, Qi H. Controllability and observability of Boolean control networks. Automatica, 2009, 45: 1659\u20131667","journal-title":"Automatica"},{"key":"5058_CR25","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.automatica.2009.10.036","volume":"46","author":"D Cheng","year":"2010","unstructured":"Cheng D, Li Z, Qi H. Realization of Boolean control networks. Automatica, 2010, 46: 62\u201369","journal-title":"Automatica"},{"key":"5058_CR26","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"S A Kauffman","year":"1969","unstructured":"Kauffman S A. Metabolic stability and epigenesis in randomly constructed genetic nets. J theor biol, 1969, 22: 437\u2013467","journal-title":"J theor biol"},{"key":"5058_CR27","first-page":"12","volume":"21","author":"A Blumer","year":"1983","unstructured":"Blumer A, Blumer J, Ehrenfeucht A, et al. Linear size finite automata for the set of all subwords of a word-an outline of results. Bull EATCS, 1983, 21: 12\u201320","journal-title":"Bull EATCS"},{"key":"5058_CR28","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/0-387-34805-0_10","volume-title":"Proceedings of Advances in Cryptology","author":"C J A Jansen","year":"1990","unstructured":"Jansen C J A, Boekee D E. The shortest feedback shift register that can generate a given sequence. In: Proceedings of Advances in Cryptology. New York: Springer, 1990. 90\u201399"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-013-5058-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-013-5058-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-013-5058-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T21:09:24Z","timestamp":1647896964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-013-5058-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["5058"],"URL":"https:\/\/doi.org\/10.1007\/s11432-013-5058-4","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,8]]}}}