{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:28Z","timestamp":1740148948747,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T00:00:00Z","timestamp":1728604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T00:00:00Z","timestamp":1728604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["1232013"],"award-info":[{"award-number":["1232013"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271517"],"award-info":[{"award-number":["12271517"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s12095-024-00747-6","type":"journal-article","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T05:01:54Z","timestamp":1728622914000},"page":"121-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distribution of linear and second-highest degree parts of maximum-length feedback functions"],"prefix":"10.1007","volume":"17","author":[{"given":"Yupeng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,11]]},"reference":[{"issue":"4","key":"747_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.36244\/ICJ.2019.4.3","volume":"11","author":"P Augustynowicz","year":"2019","unstructured":"Augustynowicz, P., Kanciak, K.: The search of square m-sequences with maximum period via GPU and CPU. Infocommunications Journal 11(4), 17\u201322 (2019)","journal-title":"Infocommunications Journal"},{"key":"747_CR2","doi-asserted-by":"crossref","unstructured":"\u00c7alik, \u00c7., Turan, M. S., \u00d6zbudak, F.: On feedback functions of maximum length nonlinear feedback shift registers. Ieice Transactions on Fundamentals of Electronics, Communications and Computer, E93-A(6):1226\u2013 1231 (2010)","DOI":"10.1587\/transfun.E93.A.1226"},{"key":"747_CR3","doi-asserted-by":"crossref","unstructured":"Chan, A.H., Games, R.A., Rushanan, J.J.: On quadratic m-sequences. In: Ross Anderson (ed.) Fast Software Encryption, pp 166\u2013173, Berlin, Heidelberg. Springer Berlin Heidelberg (1993)","DOI":"10.1007\/3-540-58108-1_20"},{"issue":"5","key":"747_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.F., Ling, S., Wang, H.: On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials. Des. Codes Crypt. 87(5), 1137\u20131160 (2019)","journal-title":"Des. Codes Crypt."},{"issue":"5","key":"747_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.ipl.2013.12.002","volume":"114","author":"P Dabrowski","year":"2014","unstructured":"Dabrowski, P., Labuzek, G., Rachwalik, T., Szmidt, J.: Searching for nonlinear feedback shift registers with parallel computing. Inf. Process. Lett. 114(5), 268\u2013272 (2014)","journal-title":"Inf. Process. Lett."},{"key":"747_CR6","first-page":"758","volume":"49","author":"NG de Bruijn","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie van Wetenschappen 49, 758\u2013764 (1946)","journal-title":"Koninklijke Nederlandse Akademie van Wetenschappen"},{"key":"747_CR7","unstructured":"de Bruijn, N.G.: Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of $$2^{n}$$ zeros and ones that show each n-letter word exactly once. EUT report. WSK, Dept. of Mathematics and Computing Science. Technische Hogeschool Eindhoven (1975)"},{"key":"747_CR8","first-page":"19","volume":"1","author":"A de Rivi\u00e9re","year":"1894","unstructured":"de Rivi\u00e9re, A.: Question nr. 48. l\u2019Interm\u00e9diaire des Math\u00e9maticiens 1, 19\u201320 (1894)","journal-title":"l\u2019Interm\u00e9diaire des Math\u00e9maticiens"},{"issue":"2","key":"747_CR9","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":"747_CR10","volume-title":"Golomb","author":"W Solomon","year":"1967","unstructured":"Solomon, W.: Golomb. Shift Register Sequences. Holden-Day, San Francisco, California (1967)"},{"issue":"4","key":"747_CR11","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":"1","key":"747_CR12","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1109\/TIT.2022.3201519","volume":"69","author":"M Li","year":"2023","unstructured":"Li, M., Lin, D.: Partial cycle structure of fsrs and its applications in searching de Bruijn sequences. IEEE Trans. Inf. Theory 69(1), 598\u2013609 (2023)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"747_CR13","first-page":"107","volume":"1","author":"C Flye Sainte-Marie","year":"1894","unstructured":"Flye Sainte-Marie, C.: Solution to question nr. 48. l\u2019Interm\u00e9diaire des Math\u00e9maticiens 1, 107\u2013110 (1894)","journal-title":"l\u2019Interm\u00e9diaire des Math\u00e9maticiens"},{"issue":"3","key":"747_CR14","first-page":"263","volume":"16","author":"Z Tang","year":"2015","unstructured":"Tang, Z., Qi, W., Tian, T.: Necessary conditions for characteristic functions of de Bruijn sequences. Journal of Information Engineering University 16(3), 263\u2013266 (2015)","journal-title":"Journal of Information Engineering University"},{"key":"747_CR15","volume-title":"Nonlinear Shift Registers","author":"Z-X Wan","year":"1978","unstructured":"Wan, Z.-X., Dai, Z., Liu, M., Feng, X.: Nonlinear Shift Registers. Science Press, Beijing (1978)"},{"issue":"1","key":"747_CR16","first-page":"152","volume":"E97\u2013A","author":"Z Wang","year":"2014","unstructured":"Wang, Z., Qi, W., Chen, H.: A new necessary condition for feedback functions of de Bruijn sequences. IEICE Transactions on Fundamentals of Electronics, Communications and Computer E97\u2013A(1), 152\u2013156 (2014)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer"},{"issue":"03","key":"747_CR17","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(03), 301\u2013312 (2020)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00747-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00747-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00747-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T11:51:59Z","timestamp":1738065119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00747-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,11]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["747"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00747-6","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,10,11]]},"assertion":[{"value":"11 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2024","order":3,"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 competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}