{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:44:55Z","timestamp":1757313895341,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T00:00:00Z","timestamp":1727913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T00:00:00Z","timestamp":1727913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Stability Program of National Key Laboratory of Security Communication","award":["M3023Y327"],"award-info":[{"award-number":["M3023Y327"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172408","62372449"],"award-info":[{"award-number":["62172408","62372449"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10623-024-01500-z","type":"journal-article","created":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T10:02:07Z","timestamp":1727949727000},"page":"4287-4311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generalized cycle joining method and its application to the construction of long-period Galois NFSRs"],"prefix":"10.1007","volume":"92","author":[{"given":"Yingyin","family":"Pan","sequence":"first","affiliation":[]},{"given":"Jianghua","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,3]]},"reference":[{"key":"1500_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Springer, New York (1976)."},{"key":"1500_CR2","first-page":"244","volume":"4986","author":"CD Canni\u00e8re","year":"2005","unstructured":"Canni\u00e8re C.D., Preneel B.: Trivium specifications. LNCS 4986, 244\u2013266 (2005).","journal-title":"LNCS"},{"key":"1500_CR3","first-page":"41","volume":"6338","author":"J-M Chabloz","year":"2010","unstructured":"Chabloz J.-M., Mansouri S., Dubrova E.: An algorithm for constructing a fastest Galois NLFSR generating a given sequence. SETA 2010. LNCS 6338, 41\u201354 (2010).","journal-title":"LNCS"},{"issue":"5","key":"1500_CR4","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/s10623-018-0509-y","volume":"87","author":"Z Chang","year":"2019","unstructured":"Chang Z., Ezerman M., Ling S., Wang H.: On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials. Des. Codes Cryptogr. 87(5), 1137\u20131160 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1500_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10623-016-0309-1","volume":"85","author":"J Dong","year":"2017","unstructured":"Dong J., Pei D.: Construction for de Bruijn sequences with large stage. Des. Codes Cryptogr. 85(2), 343\u2013358 (2017).","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"1500_CR6","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. Theory 55(11), 5263\u20135271 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1500_CR7","unstructured":"Dubrova E.: A list of maximum-period NFSRs. Cyptology ePrint Archive. Report 2012\/166 (2012). http:\/\/eprint.iacr.org\/2012\/166"},{"issue":"1","key":"1500_CR8","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/TIT.2012.2214204","volume":"59","author":"E Dubrova","year":"2013","unstructured":"Dubrova E.: A scalable method for constructing Galois NLFSRs with period $$2^n-1$$ using cross-join pairs. IEEE Trans. Inf. Theory 59(1), 703\u2013709 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1500_CR9","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1109\/TIT.1984.1056919","volume":"30","author":"T Etzion","year":"1984","unstructured":"Etzion T., Lempel A.: Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inf. Theory 30(3), 480\u2013484 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1500_CR10","unstructured":"Gammel B.M., G$$\\ddot{o}$$ttfert R., Kniffer O.: Achterbahn-128\/80. eSTREAM: the ECRYPT Stream Cipher Project (2006). http:\/\/www.ecrypt.eu.org\/stream\/p2ciphers\/achterbahn\/achterbahn_p2.pdf"},{"key":"1500_CR11","doi-asserted-by":"publisher","DOI":"10.1142\/9361","volume-title":"Shift Register Sequences (3rd Revised Edition)","author":"SW Golomb","year":"2017","unstructured":"Golomb S.W.: Shift Register Sequences (3rd Revised Edition). World Scientific, Singapore (2017)."},{"key":"1500_CR12","doi-asserted-by":"crossref","unstructured":"Hamann M., Krause M., Meier M.: Lizard\u2014a lightweight stream cipher for power-constrained devices. In: IACR Transactions on Symmetric Cryptology, pp. 45\u201379 (2017).","DOI":"10.46586\/tosc.v2017.i1.45-79"},{"key":"1500_CR13","doi-asserted-by":"crossref","unstructured":"Hamann M., Krause M., Mikhalev V.: The DRACO stream cipher. In: IACR Transactions on Symmetric Cryptology, pp. 1\u201342 (2022).","DOI":"10.46586\/tosc.v2022.i2.1-42"},{"issue":"1\u20133","key":"1500_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0012-365X(96)00106-9","volume":"159","author":"ER Hauge","year":"1996","unstructured":"Hauge E.R., Helleseth T.: De Bruijn sequences, irreducible codes and cyclotomy. Discret. Math. 159(1\u20133), 143\u2013154 (1996).","journal-title":"Discret. Math."},{"key":"1500_CR15","first-page":"179","volume":"4986","author":"M Hell","year":"2005","unstructured":"Hell M., Johansson T., Meier W.: Grain\u2014a stream cipher for constrained environments. LNCS 4986, 179\u2013190 (2005).","journal-title":"LNCS"},{"issue":"6","key":"1500_CR16","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1142\/S0129054111008738","volume":"22","author":"H Hu","year":"2011","unstructured":"Hu H., Guang G.: Periods on two kinds of nonlinear feedback shift registers with time varying feedback functions. Int. J. Found. Comput. Sci. 22(6), 1317\u20131329 (2011).","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1500_CR17","unstructured":"Kalouptsidis N., Limniotis K.: Nonlinear span, minimal realizations of sequences over finite fields and De Brujin generators. In: International Symposium on Information Theory and Its Applications (ISITA 2004) Parma, Italy, pp. 794\u2013799 (2004)."},{"issue":"2","key":"1500_CR18","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TIT.2016.2634420","volume":"63","author":"M Li","year":"2017","unstructured":"Li M., Lin D.: The adjacency graphs of LFSRs with primitive-like characteristic polynomials. IEEE Trans. Inf. Theory 63(2), 1325\u20131335 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1500_CR19","doi-asserted-by":"publisher","first-page":"2941","DOI":"10.1109\/TIT.2017.2787742","volume":"64","author":"M Li","year":"2018","unstructured":"Li M., Lin D.: De Bruijn sequences, adjacency graphs, and cyclotomy. IEEE Trans. Inf. Theory 64(4), 2941\u20132952 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1500_CR20","doi-asserted-by":"publisher","first-page":"6940","DOI":"10.1109\/TIT.2021.3102523","volume":"67","author":"M Li","year":"2021","unstructured":"Li M., Lin D.: Efficient construction of cross-join pairs in a product of primitive polynomials of pairwise-coprime degrees. IEEE Trans. Inf. Theory 67(10), 6940\u20136951 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1500_CR21","doi-asserted-by":"publisher","first-page":"7955","DOI":"10.1109\/TIT.2014.2361522","volume":"60","author":"C Li","year":"2014","unstructured":"Li C., Zeng X., Li C., Helleseth T.: A class of de Bruijn sequences. IEEE Trans. Inf. Theory 60(12), 7955\u20137969 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1500_CR22","doi-asserted-by":"publisher","first-page":"3052","DOI":"10.1109\/TIT.2014.2310748","volume":"60","author":"C Li","year":"2014","unstructured":"Li C., Zeng X., Helleseth T., Li C., Hu L.: The properties of a class of linear FSRs and their applications to the construction of nonlinear FSRs. IEEE Trans. Inf. Theory 60(5), 3052\u20133061 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1500_CR23","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., Helleseth T., Li M.: Construction of de Bruijn sequences from LFSRs with reducible characteristic polynomials. IEEE Trans. Inf. Theory 62(1), 610\u2013624 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1500_CR24","doi-asserted-by":"crossref","unstructured":"Lu J., Li M., Liu Y., et al.: Nonsingularity of grain-like cascade FSRs via semi-tensor product. Sci. China Inf. Sci. 61(1), 010204:1\u2013010204:12 (2017).","DOI":"10.1007\/s11432-017-9269-6"},{"key":"1500_CR25","first-page":"333","volume":"632","author":"J Mykkeltveit","year":"2015","unstructured":"Mykkeltveit J., Szmidt J.: On cross joining de Bruijn sequences. Contemp. Math. 632, 333\u2013344 (2015).","journal-title":"Contemp. Math."},{"key":"1500_CR26","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., Tong P.: On the cylcle structure of some nonlinear shift register sequences. Inf. Control 43, 202\u2013215 (1979).","journal-title":"Inf. Control"},{"key":"1500_CR27","doi-asserted-by":"crossref","unstructured":"Pan Y., Zhong J., Lin D.: Nonsingularity of Galois nonlinear feedback shift registers. In: 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland, pp. 366-371 (2022).","DOI":"10.1109\/ISIT50566.2022.9834495"},{"key":"1500_CR28","doi-asserted-by":"crossref","unstructured":"Szmidt J.: Nonlinear feedback shift registers and Zech\u2019s logarithms. In: Proceedings Under International Conference on Military Communications and Information Systems (ICMCIS), pp. 1\u20134 (2019).","DOI":"10.1109\/ICMCIS.2019.8842713"},{"issue":"5","key":"1500_CR29","first-page":"519","volume":"14","author":"Q Wang","year":"2013","unstructured":"Wang Q., Jin C.: Nonsingularity decision of Trivium-like cascade connection of feedback shift registers. J. Inf. Eng. Univ. 14(5), 519\u2013523 (2013).","journal-title":"J. Inf. Eng. Univ."},{"issue":"3","key":"1500_CR30","first-page":"167","volume":"40","author":"Q Wang","year":"2014","unstructured":"Wang Q., Jin C.: Criteria for nonsingularity of Grain-like cascade feedback shift register. Comput. Eng. 40(3), 167\u2013170 (2014) (in Chinese).","journal-title":"Comput. Eng."},{"key":"1500_CR31","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s10623-020-00839-3","volume":"89","author":"Z Wang","year":"2021","unstructured":"Wang Z., Zheng Q., Zhao X., Feng X.: Grain-like structures with minimal and maximal period sequences. Des. Codes Cryptogr. 89, 679\u2013693 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1500_CR32","unstructured":"Wu H.: ACORN: a lightweight authenticated cipher (v3). Submission to CAESAR (2016). http:\/\/competitions.cr.yp.to\/round3\/acornv3.pdf"},{"key":"1500_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48865-2","volume-title":"Boolean Functions and Their Applications in Cryptography","author":"C-K Wu","year":"2016","unstructured":"Wu C.-K., Feng D.: Boolean Functions and Their Applications in Cryptography. Springer, Berlin (2016)."},{"issue":"1","key":"1500_CR34","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10623-019-00677-y","volume":"88","author":"X-X Zhao","year":"2020","unstructured":"Zhao X.-X., Qi W.-F., Zhang J.-M.: Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs. Des. Codes Cryptogr. 88(1), 153\u2013171 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1500_CR35","doi-asserted-by":"crossref","unstructured":"Zhong J., Lin D.: Decomposition of nonlinear feedback shift registers based on Boolean networks. Sci. China Inf. Sci. 62(3), 39110:1\u201339110:3 (2019).","DOI":"10.1007\/s11432-017-9460-4"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01500-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01500-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01500-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:24:46Z","timestamp":1732310686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01500-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,3]]},"references-count":35,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1500"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01500-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,10,3]]},"assertion":[{"value":"28 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. They have no Conflict of interest to declare that are relevant to the content of this article, either.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}