{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:48:12Z","timestamp":1743140892379,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319298139"},{"type":"electronic","value":"9783319298146"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29814-6_14","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T09:04:46Z","timestamp":1457341486000},"page":"169-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences"],"prefix":"10.1007","author":[{"given":"Jianqin","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanquan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xifeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,5]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","first-page":"85","volume-title":"The Stability Theory of Stream Ciphers","year":"1991","unstructured":"Ding, C.S., Xiao, G.Z., Shan, W.J. (eds.): The Stability Theory of Stream Ciphers. LNCS, vol. 561, pp. 85\u201388. Springer, Heidelberg (1991)"},{"issue":"10","key":"14_CR2","doi-asserted-by":"publisher","first-page":"4681","DOI":"10.1109\/TIT.2009.2027495","volume":"55","author":"T Etzion","year":"2009","unstructured":"Etzion, T., Kalouptsidis, N., Kolokotronis, N., Limniotis, K., Paterson, K.G.: Properties of the error linear complexity spectrum. IEEE Trans. Inf. Theory 55(10), 4681\u20134686 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"RA Games","year":"1983","unstructured":"Games, R.A., Chan, A.H.: A fast algorithm for determining the complexity of a binary sequence with period $$2^n$$. IEEE Trans. Inf. Theory 29(1), 144\u2013146 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/11863854_8","volume-title":"Sequences and Their Applications \u2013 SETA 2006","author":"F-W Fu","year":"2006","unstructured":"Fu, F.-W., Niederreiter, H., Su, M.: The characterization of 2$$^{n}$$-periodic binary sequences with fixed 1-error linear complexity. In: Gong, G., Helleseth, T., Song, H.-Y., Yang, K. (eds.) SETA 2006. LNCS, vol. 4086, pp. 88\u2013103. Springer, Heidelberg (2006)"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TIT.2004.842709","volume":"51","author":"W Meidl","year":"2005","unstructured":"Meidl, W.: On the stablity of $$2^n$$-periodic binary sequences. IEEE Trans. Inf. Theory 51(3), 1151\u20131155 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Ciphers","author":"RA Rueppel","year":"1986","unstructured":"Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Berlin (1986). chapter 4"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/18.243455","volume":"39","author":"M Stamp","year":"1993","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, 1398\u20131401 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1007\/s11424-012-1101-6","volume":"25","author":"L Tan","year":"2012","unstructured":"Tan, L., Qi, W.F., Xu, H.: Distribution of one-error linear complexity of binary sequences for arbitrary prime period. J. Syst. Sci. Complex. 25(6), 1223\u20131233 (2012)","journal-title":"J. Syst. Sci. Complex."},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10623-013-9805-8","volume":"73","author":"JQ Zhou","year":"2014","unstructured":"Zhou, J.Q., Liu, W.Q.: The $$k$$-error linear complexity distribution for $$2^n$$-periodic binary sequences. Des. Codes Crypt. 73(1), 55\u201375 (2014)","journal-title":"Des. Codes Crypt."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-319-12087-4_5","volume-title":"Information Security and Cryptology","author":"J Zhou","year":"2014","unstructured":"Zhou, J., Liu, W., Zhou, G.: Cube theory and stable $$k$$-error linear complexity for periodic sequences. In: Lin, D., Xu, S., Yung, M. (eds.) Inscrypt 2013. LNCS, vol. 8567, pp. 70\u201385. Springer, Heidelberg (2014)"},{"key":"14_CR11","unstructured":"Zhou, J.Q., Wang, X.F., Liu, W.Q.: Structure Analysis on the $$k$$-error Linear Complexity for $$2^n$$-periodic Binary Sequences (2013). http:\/\/arxiv.org\/abs\/1312.6927"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/s11767-006-0005-9","volume":"24","author":"FX Zhu","year":"2007","unstructured":"Zhu, F.X., Qi, W.F.: The 2-error linear complexity of $$2^n$$-periodic binary sequences with linear complexity $$2^n$$-1. J. Electron. (China) 24(3), 390\u2013395 (2007). http:\/\/www.springerlink.com\/content\/3200vt810p232769\/","journal-title":"J. Electron. (China)"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29814-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T06:14:26Z","timestamp":1623824066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-29814-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319298139","9783319298146"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29814-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}