{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T06:21:53Z","timestamp":1774851713601,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12271517"],"award-info":[{"award-number":["12271517"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10623-026-01823-z","type":"journal-article","created":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T15:33:37Z","timestamp":1773070417000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Possible values for the nonlinearity of de bruijn feedback functions"],"prefix":"10.1007","volume":"94","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yupeng","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,9]]},"reference":[{"key":"1823_CR1","unstructured":"Berndt M.G., Rainer G., Oliver K.: The Achterbahn stream cipher. Technical report, Submission to eSTREAM, ECRYPT Stream Cipher Project (2005)."},{"key":"1823_CR2","first-page":"107","volume":"1","author":"Camille Flye Sainte-Marie","year":"1894","unstructured":"Camille Flye Sainte-Marie: Solution to problem 48. L\u2019Interm\u00e9d. Math. 1, 107\u2013110 (1894).","journal-title":"L\u2019Interm\u00e9d. Math."},{"issue":"3","key":"1823_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0097-3165(82)90038-3","volume":"33","author":"AH Chan","year":"1982","unstructured":"Chan A.H., Games R.A., Key E.L.: On the complexities of de Bruijn sequences. J. Combin. Theory Ser. A 33(3), 233\u2013246 (1982).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"9","key":"1823_CR4","first-page":"1494","volume":"76","author":"T Chang","year":"1993","unstructured":"Chang T., Song I., Kim H., Cho S.H.: Cross-joins in de Bruijn sequences and maximum length linear sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 76(9), 1494\u20131501 (1993).","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"314","key":"1823_CR5","first-page":"1","volume":"2","author":"Z Chang","year":"2021","unstructured":"Chang Z., Ezerman M.F., Fahreza A.A., Ling S., Szmidt J., Wang H.: Binary de Bruijn sequences via Zech\u2019s logarithms. SN Comput. Sci. 2(314), 1 (2021).","journal-title":"SN Comput. Sci."},{"key":"1823_CR6","unstructured":"Coppersmith D., Rhoades R.C., Vanderkam J.M.: Counting de Bruijn sequences as perturbations of linear recursions. Preprint at http:\/\/arxiv.org\/abs\/1705.07835 (2017)."},{"key":"1823_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"D Dubhashi","year":"2009","unstructured":"Dubhashi D., Panconesi A.: Concentration of Measure for the Analysis of Randomized Algorithms, 1st edn Cambridge University Press, Cambridge (2009).","edition":"1"},{"key":"1823_CR8","unstructured":"Dubrova E.: A list of maximum period NLFSRs (2012)."},{"key":"1823_CR9","volume-title":"Sequences and the de Bruijn Graph","author":"T Etzion","year":"2024","unstructured":"Etzion T.: Sequences and the de Bruijn Graph, 1st edn Academic Press, Cambridge (2024).","edition":"1"},{"issue":"4","key":"1823_CR10","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/TIT.1984.1056933","volume":"30","author":"T Etzion","year":"1984","unstructured":"Etzion T., Lempel A.: On the distribution of de Bruijn sequences of given complexity. IEEE Trans. Inf. Theory 30(4), 611\u2013614 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1823_CR11","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."},{"issue":"1","key":"1823_CR12","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.2019.2928292","volume":"66","author":"D Gabric","year":"2020","unstructured":"Gabric D., Sawada J., Williams A., Wong D.: A successor rule framework for constructing $$k$$-ary de Bruijn sequences and universal cycles. IEEE Trans. Inf. Theory 66(1), 679\u2013687 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1823_CR13","first-page":"1","volume":"2022","author":"M Hamann","year":"2022","unstructured":"Hamann M., Moch A., Krause M., Mikhalev V.: The draco stream cipher. IACR Trans. Symm. Cryptol. 2022(2), 1\u201342 (2022).","journal-title":"IACR Trans. Symm. Cryptol."},{"issue":"1","key":"1823_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0012-365X(94)00057-P","volume":"145","author":"ER Hauge","year":"1995","unstructured":"Hauge E.R.: On the cycles and adjacencies in the complementary circulating register. Discret. Math. 145(1), 105\u2013132 (1995).","journal-title":"Discret. Math."},{"issue":"1","key":"1823_CR15","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), 143\u2013154 (1996).","journal-title":"Discret. Math."},{"key":"1823_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-68351-3_14","volume-title":"New Stream Cipher Designs: The eSTREAM Finalists","author":"M Hell","year":"2008","unstructured":"Hell M., Johansson T., Maximov A., Meier W.: The Grain family of stream ciphers. In: New Stream Cipher Designs: The eSTREAM Finalists, vol. 4986, pp. 179\u2013190. Lecture Notes in Computer Science. Springer, Cham (2008)."},{"issue":"5","key":"1823_CR17","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/18.133272","volume":"37","author":"CJA 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 37(5), 1475\u20131478 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1823_CR18","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1007\/s10623-020-00759-2","volume":"88","author":"Y Jiang","year":"2020","unstructured":"Jiang Y., Lin D.: Longest subsequences shared by two de Bruijn sequences. Des. Codes Cryptogr. 88(7), 1463\u20131475 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"1823_CR19","doi-asserted-by":"publisher","first-page":"5357","DOI":"10.1109\/TIT.2023.3263532","volume":"69","author":"Y Jiang","year":"2023","unstructured":"Jiang Y., Li M., Lin D.: Proofs of conjectures on extremal weight de Bruijn sequences. IEEE Trans. Inf. Theory 69(8), 5357\u20135363 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1823_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0095-8956(71)90009-8","volume":"11","author":"A Lempel","year":"1971","unstructured":"Lempel A.: On extremal factors of the de Bruijn graph. J. Combin. Theory Ser. B 11(1), 17\u201327 (1971).","journal-title":"J. Combin. Theory Ser. B"},{"key":"1823_CR21","first-page":"1","volume":"2011","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 2011, 1 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1823_CR22","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/TIT.2021.3120841","volume":"68","author":"M Li","year":"2022","unstructured":"Li M., Lin D.: The adjacency graphs of FSRs with affine characteristic functions. IEEE Trans. Inf. Theory 68(1), 649\u2013658 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1823_CR23","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes, 1st edn North-Holland Publishing Company (1977).","edition":"1"},{"issue":"12","key":"1823_CR24","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1109\/TC.2020.2979460","volume":"69","author":"K Mandal","year":"2020","unstructured":"Mandal K., Yang B., Gong G., Aagaard M.: Analysis and efficient implementations of a class of composited de Bruijn sequences. IEEE Trans. Comput. 69(12), 1835\u20131848 (2020).","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"1823_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s12095-012-0067-5","volume":"4","author":"Meltem S\u00f6nmez Turan","year":"2012","unstructured":"Meltem S\u00f6nmez Turan: On the nonlinearity of maximum-length NFSR feedbacks. Cryptogr. Commun. 4(3), 233\u2013243 (2012).","journal-title":"Cryptogr. Commun."},{"issue":"1","key":"1823_CR26","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/0095-8956(72)90006-8","volume":"13","author":"J Mykkeltveit","year":"1972","unstructured":"Mykkeltveit J.: A proof of Golomb\u2019s conjecture for the de Bruijn graph. J. Combin. Theory Ser. B 13(1), 40\u201345 (1972).","journal-title":"J. Combin. Theory Ser. B"},{"key":"1823_CR27","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."},{"issue":"7","key":"1823_CR28","first-page":"758","volume":"49","author":"Nicolaas Govert de Bruijn","year":"1946","unstructured":"Nicolaas Govert de Bruijn: A combinatorial problem. Proc. Sect. Sci. K. Ned. Akad. Wet. Amsterdam 49(7), 758\u2013764 (1946).","journal-title":"Proc. Sect. Sci. K. Ned. Akad. Wet. Amsterdam"},{"key":"1823_CR29","volume-title":"Shift Register Sequences","author":"WG Solomon","year":"2017","unstructured":"Solomon W.G.: Shift Register Sequences, 3rd edn World Scientific, Singapore (2017).","edition":"3"},{"key":"1823_CR30","doi-asserted-by":"crossref","unstructured":"Szmidt, J.: Nonlinear feedback shift registers and Zech\u2019s logarithms. In: 2019 International Conference on Military Communications and Information Systems (ICMCIS), pp. 1\u20134 (2019).","DOI":"10.1109\/ICMCIS.2019.8842713"},{"issue":"1","key":"1823_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12095-015-0133-x","volume":"8","author":"M Wang","year":"2016","unstructured":"Wang M., Jiang Y., Lin D.: Further results on the nonlinearity of maximum-length NFSR feedbacks. Cryptogr. Commun. 8(1), 1\u20136 (2016).","journal-title":"Cryptogr. Commun."},{"issue":"3","key":"1823_CR32","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1142\/S0129054120500094","volume":"31","author":"Z Wang","year":"2020","unstructured":"Wang Z., Wang X., Tian T.: Constructing de Bruijn sequences based on a new necessary condition. Int. J. Found. Comput. Sci. 31(3), 301\u2013312 (2020).","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1823_CR33","unstructured":"Zhou, C., Hu, B., Guan, J.: On the maximum nonlinearity of de Bruijn sequence feedback function. Cryptology ePrint Archive (2020)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01823-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01823-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01823-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T05:02:06Z","timestamp":1774846926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01823-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1823"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01823-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"8 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2026","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 declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"66"}}