{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:46:18Z","timestamp":1649177178039},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,26]],"date-time":"2019-12-26T00:00:00Z","timestamp":1577318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,26]],"date-time":"2019-12-26T00:00:00Z","timestamp":1577318400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s11424-019-8072-9","type":"journal-article","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T06:14:55Z","timestamp":1578032095000},"page":"196-214","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Upper Bound on the Order of Affine Sub-families of NFSRs"],"prefix":"10.1007","volume":"33","author":[{"given":"Junying","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qunxiong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,26]]},"reference":[{"key":"8072_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-68351-3_14","volume":"4986","author":"M Hell","year":"2008","unstructured":"Hell M, Johansson T, Maximov A, et al., The Grain family of stream ciphers, Lecture Notes in Computer Science, 2008, 4986: 179\u2013190.","journal-title":"Lecture Notes in Computer Science"},{"key":"8072_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-68351-3_18","volume":"4986","author":"C D Cann\u00e8re","year":"2008","unstructured":"Cann\u00e8re C D and Preneel B, Trivium, Lecture Notes in Computer Science, 2008, 4986: 244\u2013266.","journal-title":"Lecture Notes in Computer Science"},{"key":"8072_CR3","unstructured":"Keeloq wikipedia article, http:\/\/en.wikipedia.org\/wiki\/KeeLoq."},{"issue":"2","key":"8072_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00145-012-9125-6","volume":"26","author":"J P Aumasson","year":"2013","unstructured":"Aumasson J P, Henzen L, Meier W, et al., Quark: A lightweight Hash, Journal of Cryptology, 2013, 26(2): 313\u2013339.","journal-title":"Journal of Cryptology"},{"key":"8072_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0097-3165(82)90038-3","volume":"33","author":"A H Chan","year":"1982","unstructured":"Chan A H, Games R A, and Key E L, On the complexities of de Bruijn sequences, Journal of Combinatorial Theory, 1982, 33: 233\u2013246.","journal-title":"Journal of Combinatorial Theory"},{"issue":"2","key":"8072_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/0097-3165(83)90060-2","volume":"34","author":"R A Games","year":"1983","unstructured":"Games R A, There are no de Bruijn sequences of span n with complexity 2n\u22121 + n + 1, Journal of Combinatorial Theory, Series A, 1983, 34(2): 248\u2013251.","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"2","key":"8072_CR7","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 Review, 1982, 24(2): 195\u2013221.","journal-title":"Siam Review"},{"issue":"2","key":"8072_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10623-016-0314-4","volume":"85","author":"A Alhakim","year":"2017","unstructured":"Alhakim A and Nouiehed M, Stretching de Bruijn sequences, Designs, Codes and Cryptography, 2017, 85(2): 381\u2013394.","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"8072_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s12095-017-0219-8","volume":"10","author":"Z Chang","year":"2018","unstructured":"Chang Z, Ezerman M F, Ling S, et al., Construction of de Bruijn sequences from product of two irreducible polynomials, Cryptography and Communications, 2018, 10(2): 251\u2013275.","journal-title":"Cryptography and Communications"},{"issue":"2","key":"8072_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10623-016-0309-1","volume":"85","author":"J Dong","year":"2017","unstructured":"Dong J and Pei D, Construction for de Bruijn sequences with large stage, Designs, Codes and Cryptography, 2017, 85(2): 343\u2013358.","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"8072_CR11","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TIT.2015.2496946","volume":"62","author":"C Li","year":"2016","unstructured":"Li C, Zeng X, Li C, et al., Construction of de Bruijn sequences from LFSRs with reducible characteristic polynomials, IEEE Transactions on Information Theory, 2016, 62(1): 610\u2013624.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"8072_CR12","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1109\/TIT.2017.2787742","volume":"64","author":"M Li","year":"2018","unstructured":"Li M and Lin D, De Bruijn sequences, adjacency graphs, and cyclotomy, IEEE Transactions on Information Theory, 2018, 64(4): 2941\u20132952.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"8072_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.disc.2015.08.002","volume":"339","author":"J Sawada","year":"2016","unstructured":"Sawada J, Williams A, and Wong D, A surprisingly simple de Bruijn sequence construction, Discrete Mathematics, 2016, 339(1): 127\u2013131.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"8072_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.jco.2012.09.003","volume":"29","author":"Z Ma","year":"2013","unstructured":"Ma Z, Qi W F, and Tian T, On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR, Journal of Complexity, 2013, 29(2): 173\u2013181.","journal-title":"Journal of Complexity"},{"issue":"6","key":"8072_CR15","doi-asserted-by":"publisher","first-page":"4006","DOI":"10.1109\/TIT.2013.2247093","volume":"59","author":"T Tian","year":"2013","unstructured":"Tian T and Qi W F, On the density of irreducible NFSRs, IEEE Transactions on Information Theory, 2013, 59(6): 4006\u20134012.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"8072_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-012-9723-1","volume":"71","author":"T Tian","year":"2014","unstructured":"Tian T and Qi W F, On the largest affine sub-families of a family of NFSR sequences, Designs Codes and Cryptography, 2014, 71(1): 163\u2013181.","journal-title":"Designs Codes and Cryptography"},{"issue":"1","key":"8072_CR17","first-page":"72","volume":"1","author":"T Tian","year":"2014","unstructured":"Tian T and Qi W F, Survey on sub-families of NFSR sequences, Journal of Cryptologic Research, 2014, 1(1): 72\u201382.","journal-title":"Journal of Cryptologic Research"},{"issue":"1","key":"8072_CR18","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TIT.2014.2371542","volume":"61","author":"J M Zhang","year":"2015","unstructured":"Zhang J M, Qi W F, Tian T, et al., Further results on the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR, IEEE Transactions on Information Theory, 2015, 61(1): 645\u2013654.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"8072_CR19","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10623-013-9901-9","volume":"75","author":"Z Ma","year":"2015","unstructured":"Ma Z, Qi W F, and Tian T, On affine sub-families of the NFSR in Grain, Designs Codes and Cryptography, 2015, 75(2): 199\u2013212.","journal-title":"Designs Codes and Cryptography"},{"key":"8072_CR20","unstructured":"Zhang J M, Research on linear structures of nonlinear feedback shift register sequences, Ph.D. thesis, PLA Information Engineering University, Zhengzhou, China, 2016."},{"issue":"3","key":"8072_CR21","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10623-016-0178-7","volume":"82","author":"Y P Jiang","year":"2017","unstructured":"Jiang Y P and Lin D D, On affine sub-families of Grain-like structures, Designs Codes and Cryptography, 2017, 82(3): 531\u2013542.","journal-title":"Designs Codes and Cryptography"},{"issue":"4","key":"8072_CR22","doi-asserted-by":"publisher","first-page":"2932","DOI":"10.1109\/TIT.2017.2714680","volume":"64","author":"J M Zhang","year":"2018","unstructured":"Zhang J M, Tian T, Qi W F, et al., On the affine sub-families of quadratic NFSRs, IEEE Transactions on Information Theory, 2018, 64(4): 2932\u20132940.","journal-title":"IEEE Transactions on Information Theory"},{"key":"8072_CR23","volume-title":"Shift Register Sequences","author":"S Golomb","year":"1967","unstructured":"Golomb S, Shift Register Sequences, Holden-Day, San Francisco, 1967."},{"issue":"2","key":"8072_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/S0019-9958(79)90708-3","volume":"43","author":"J Mykkeltveit","year":"1979","unstructured":"Mykkeltveit J, Siu M K, and Tong P, On the cycle structure of some nonlinear shift register sequences, Information and Control, 1979, 43(2): 202\u2013215.","journal-title":"Information and Control"},{"key":"8072_CR25","doi-asserted-by":"crossref","unstructured":"Hell M, Johansson T, Maximov A, et al., A stream cipher proposal: Grain-128, IEEE International Symposium on Information Theory, 2006, 1614\u20131618.","DOI":"10.1109\/ISIT.2006.261549"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-8072-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-019-8072-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-019-8072-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,25]],"date-time":"2020-12-25T00:17:31Z","timestamp":1608855451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-019-8072-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,26]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["8072"],"URL":"https:\/\/doi.org\/10.1007\/s11424-019-8072-9","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,26]]},"assertion":[{"value":"13 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}