{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:58:14Z","timestamp":1743047894652,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030718510"},{"type":"electronic","value":"9783030718527"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-71852-7_23","type":"book-chapter","created":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T07:02:45Z","timestamp":1615532565000},"page":"344-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the k-Error Linear Complexities of De Bruijn Sequences"],"prefix":"10.1007","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yupeng","family":"Jiang","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":[[2021,3,13]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10623-016-0314-4","volume":"85","author":"A Alhakim","year":"2017","unstructured":"Alhakim, A., Nouiehed, M.: Stretching de Bruijn sequences. Des. Codes Crypt. 85(2), 381\u2013394 (2017)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.disc.2018.09.024","volume":"342","author":"G Amram","year":"2019","unstructured":"Amram, G., Ashlagi, Y., Rubin, A., Svoray, Y., Schwartz, M., Weiss, G.: An efficient shift rule for the prefer-max de Bruijn sequence. Discret. Math. 342(1), 226\u2013232 (2019)","journal-title":"Discret. Math."},{"key":"23_CR3","unstructured":"Chan, A.H., Games, R.A., Key, E.L.: On the complexities of de Bruijn sequences. J. Comb. Theory Ser. A, 33(3), 233\u2013246 (1982)"},{"issue":"11","key":"23_CR4","doi-asserted-by":"publisher","first-page":"7166","DOI":"10.1109\/TIT.2017.2747557","volume":"63","author":"Z Chang","year":"2017","unstructured":"Chang, Z., Chrisnata, J., Ezerman, M.F., Kiah, H.M.: Rates of DNA sequence profiles for practical values of read lengths. IEEE Trans. Inf. Theory 63(11), 7166\u20137177 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR5","unstructured":"Coppersmith, D., Rhoades, R.C., VanderKam, J.M.: Counting de Bruijn sequences as perturbations of linear recursions. arXiv (2017)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"NT Courtois","year":"2003","unstructured":"Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345\u2013359. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_21"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BFb0030350","volume-title":"Advances in Cryptology \u2014 AUSCRYPT \u201990","author":"C Ding","year":"1990","unstructured":"Ding, C.: Lower bounds on the weight complexities of cascaded binary sequences. In: Seberry, J., Pieprzyk, J. (eds.) AUSCRYPT 1990. LNCS, vol. 453, pp. 39\u201343. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0030350"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54973-0","volume-title":"The Stability Theory of Stream Ciphers","year":"1991","unstructured":"Ding, C., Xiao, G., Shan, W. (eds.): The Stability Theory of Stream Ciphers. LNCS, vol. 561. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54973-0"},{"issue":"2","key":"23_CR9","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 Crypt. 85(2), 343\u2013358 (2017)","journal-title":"Des. Codes Crypt."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"101583","DOI":"10.1016\/j.ffa.2019.101583","volume":"60","author":"Y Dong","year":"2019","unstructured":"Dong, Y., Tian, T., Qi, W., Wang, Z.: New results on the minimal polynomials of modified de Bruijn sequences. Finite Fields Appl. 60, 101583 (2019)","journal-title":"Finite Fields Appl."},{"key":"23_CR11","unstructured":"Etzion, T.: On the distribution of de Nruijn CR-sequences (corresp.). IEEE Trans. Inf. Theory 32(3), 422\u2013423 (1986)"},{"issue":"2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1109\/18.749013","volume":"45","author":"T Etzion","year":"1999","unstructured":"Etzion, T.: Linear complexity of de Bruijn sequences-old and new results. IEEE Trans. Inf. Theory 45(2), 693\u2013698 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"23_CR13","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/TIT.1984.1056965","volume":"30","author":"T Etzion","year":"1984","unstructured":"Etzion, T., Lempel, A.: Construction of de Bruijn sequences of minimal complexity. IEEE Trans. Inf. Theory 30(5), 705\u2013709 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"23_CR14","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"},{"key":"23_CR15","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)"},{"key":"23_CR16","unstructured":"Games, R.A.: There are no de Bruijn sequences of span n with complexity $$2^{n-1}+n+1$$. J. Comb. Theory Ser. A 34(2), 248\u2013251 (1983)"},{"key":"23_CR17","unstructured":"Golomb, S.W.: Shift Register Sequences (1981)"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1049\/piee.1970.0134","volume":"117","author":"DH Green","year":"1970","unstructured":"Green, D.H., Dimond, K.R.: Nonlinear product-feedback shift registers. Proc. Inst. Electr. Eng. 117(4), 681\u2013686 (1970)","journal-title":"Proc. Inst. Electr. Eng."},{"issue":"12","key":"23_CR19","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/T-C.1970.222859","volume":"19","author":"A Lempel","year":"1970","unstructured":"Lempel, A.: On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers. IEEE Trans. Comput. 19(12), 1204\u20131209 (1970)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"23_CR20","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., Lei, H.: 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":"3","key":"23_CR21","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10623-016-0187-6","volume":"82","author":"M Li","year":"2017","unstructured":"Li, M., Jiang, Y., Lin, D.: The adjacency graphs of some feedback shift registers. Des. Codes Crypt. 82(3), 695\u2013713 (2017)","journal-title":"Des. Codes Crypt."},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-35999-6_8","volume-title":"Selected Areas in Cryptography","author":"K Mandal","year":"2013","unstructured":"Mandal, K., Gong, G.: Cryptographically strong de Bruijn sequences with large periods. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 104\u2013118. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35999-6_8"},{"issue":"9","key":"23_CR23","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1109\/TC.2015.2506557","volume":"65","author":"K Mandal","year":"2016","unstructured":"Mandal, K., Gong, G.: Feedback reconstruction and implementations of pseudorandom number generators from composited de Bruijn sequences. IEEE Trans. Comput. 65(9), 2725\u20132738 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"23_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jcom.2001.0621","volume":"18","author":"W Meidl","year":"2002","unstructured":"Meidl, W., Niederreiter, H.: Linear complexity, k-error linear complexity, and the discrete Fourier transform. J. Complex. 18(1), 87\u2013103 (2002)","journal-title":"J. Complex."},{"issue":"3","key":"23_CR25","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF02252874","volume":"1","author":"W Meier","year":"1989","unstructured":"Meier, W., Staffelbach, O.: Fast correlation attacks on certain stream ciphers. J. Cryptol. 1(3), 159\u2013176 (1989)","journal-title":"J. Cryptol."},{"key":"23_CR26","unstructured":"Mykkeltveit, J., Szmidt, J.: On cross joining de Bruijn sequences. IACR Cryptology ePrint Archive 2013, 760 (2013)"},{"issue":"3","key":"23_CR27","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s10623-016-0322-4","volume":"85","author":"A Rubin","year":"2017","unstructured":"Rubin, A., Weiss, G.: Mapping prefer-opposite to prefer-one de Bruijn sequences. Des. Codes Crypt. 85(3), 547\u2013555 (2017)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"23_CR28","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., Wong, D.: A surprisingly simple de Bruijn sequence construction. Discret. Math. 339(1), 127\u2013131 (2016)","journal-title":"Discret. Math."},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Trans. Comput. 34(1), 81\u201385 (1985)","DOI":"10.1109\/TC.1985.1676518"},{"key":"23_CR30","unstructured":"Stamp, M., Martin, C.F.: An algorithm for the k-error linear complexity of binary sequences with period $$2^n$$. IEEE Trans. Inf. Theory 39(4), 1398\u20131401 (1993)"},{"key":"23_CR31","unstructured":"Yang, B., Mandal, K., Aagaard, M.D., Gong, G.: Efficient composited de Bruijn sequence generators. IEEE Trans. Comput. 66(8), 1354\u20131368 (2017)"},{"issue":"3","key":"23_CR32","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF02011891","volume":"2","author":"Z Zhang","year":"1985","unstructured":"Zhang, Z.: Further results on correlation functions of de Bruijn sequences. Acta Mathematicae Applicatae Sinica 2(3), 257\u2013262 (1985)","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"23_CR33","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.dam.2018.06.032","volume":"254","author":"X Zhao","year":"2019","unstructured":"Zhao, X., Tian, T., Qi, W.: An interleaved method for constructing de Bruijn sequences. Discret. Appl. Math. 254, 234\u2013245 (2019)","journal-title":"Discret. Appl. Math."},{"key":"23_CR34","doi-asserted-by":"publisher","first-page":"101574","DOI":"10.1016\/j.ffa.2019.101574","volume":"60","author":"L Zhou","year":"2019","unstructured":"Zhou, L., Tian, T., Qi, W., Wang, Z.: Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR. Finite Fields Appl. 60, 101574 (2019)","journal-title":"Finite Fields Appl."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-71852-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T07:09:50Z","timestamp":1615532990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-71852-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030718510","9783030718527"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-71852-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}