{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:37:09Z","timestamp":1648784229261},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,8,8]],"date-time":"2008-08-08T00:00:00Z","timestamp":1218153600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s12095-008-0004-9","type":"journal-article","created":{"date-parts":[[2008,8,7]],"date-time":"2008-08-07T20:53:54Z","timestamp":1218142434000},"page":"95-116","source":"Crossref","is-referenced-by-count":1,"title":["Lower bounds on error complexity measures for periodic LFSR and FCSR sequences"],"prefix":"10.1007","volume":"1","author":[{"given":"Ramakanth","family":"Kavuluru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Klapper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1109\/18.669427","volume":"44","author":"S. Dai","year":"1998","unstructured":"Dai, S., Imamura, K.: Linear complexity for one-symbol substitution of a periodic sequence over GF(q). IEEE Trans. Inf. Theory 44, 1328\u20131331, May (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ding, C., Xiao, G., Shan, W.: The stability theory of stream ciphers. In: LNCS 561. Springer Verlag (1991)","DOI":"10.1007\/3-540-54973-0"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1016\/j.jco.2005.07.001","volume":"21","author":"F. Fu","year":"2005","unstructured":"Fu, F., Niederreiter, H., Su, M.: The expectation and variance of the joint linear complexity of random periodic multisequences. J. Complex. 21, 804\u2013822 (2005)","journal-title":"J. Complex."},{"issue":"6","key":"4_CR4","doi-asserted-by":"crossref","first-page":"2297","DOI":"10.1109\/TIT.2007.896863","volume":"53","author":"Y. Han","year":"2007","unstructured":"Han, Y., Chung, J., Yang, K.: On the k-error linear complexity of p m -periodic binary sequences. IEEE Trans. Inf. Theory 53(6), 2297\u20132304 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR5","first-page":"185","volume-title":"Proc. SETA 2004, LNCS, vol. 3486","author":"H. Hu","year":"2005","unstructured":"Hu, H., Feng, D.: On the 2-adic complexity and the k-Error 2-adic complexity of periodic binary sequences. In: Proc. SETA 2004, LNCS, vol. 3486, pp. 185\u2013196. Springer, Berlin, May (2005)"},{"issue":"3","key":"4_CR6","first-page":"1328","volume":"44","author":"S. Jiang","year":"2000","unstructured":"Jiang, S., Dai, Z., Imamura, K.: Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting or deleting k symbols within one period. IEEE Trans. Inf. Theory 44(3), 1328\u20131331, May (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s001459900024","volume":"10","author":"A. Klapper","year":"1997","unstructured":"Klapper, A., Goresky, M.: Feedback shift registers, combiners with memory, and 2-adic span. J. Cryptol. 10, 111\u2013147 (1997)","journal-title":"J. Cryptol."},{"issue":"2","key":"4_CR8","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/18.825845","volume":"46","author":"K. Kurosawa","year":"2000","unstructured":"Kurosawa, K., Sato, F., Sakata, T., Kishimoto, W.: A relationship between linear complexity and k-error linear complexity. IEEE Trans. Inf. Theory 46(2), 694\u2013698, March (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/ffta.2001.0326","volume":"8","author":"W. Meidl","year":"2002","unstructured":"Meidl, W., Niederreiter, H.: Counting functions and expected values for the k-error linear complexity. Finite Fields Appl. 8, 142\u2013154 (2002)","journal-title":"Finite Fields Appl."},{"issue":"11","key":"4_CR10","doi-asserted-by":"crossref","first-page":"2817","DOI":"10.1109\/TIT.2002.804050","volume":"48","author":"W. Meidl","year":"2002","unstructured":"Meidl, W., Niederreiter, H.: On the expected value of linear complexity and the k-error linear complexity of periodic sequences. IEEE Trans. Inf. Theory 48(11), 2817\u20132825 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0885-064X(02)00009-2","volume":"19","author":"W. Meidl","year":"2003","unstructured":"Meidl, W., Niederreiter, H.: The expected value of joint linear complexity of periodic multisequences. J. Complex. 19, 61\u201372 (2003)","journal-title":"J. Complex."},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/B:DESI.0000035466.28660.e9","volume":"33","author":"W. Meidl","year":"2004","unstructured":"Meidl, W.: How many bits have to be changed to decrease the linear complexity? Des. Codes. Cryptography 33, 109\u2013122 (2004)","journal-title":"Des. Codes. Cryptography"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.jco.2006.10.005","volume":"23","author":"W. Meidl","year":"2007","unstructured":"Meidl, W., Niederreiter, H., Venkateswarlu, A.: Error linear complexity measures for multisequences. J. Complex. 23, 169\u2013192 (2007)","journal-title":"J. Complex."},{"key":"4_CR14","first-page":"1739","volume":"E79-A","author":"S. Uehara","year":"1996","unstructured":"Uehara, S., Imamura, K.: Linear complexity of periodic sequences obtained from GF(q) sequences with period q n \u2009\u2212\u20091 by one-symbol insertion. IEICE Trans. Fundam. E79-A, 1739\u20131740, Oct (1996)","journal-title":"IEICE Trans. Fundam."},{"key":"4_CR15","unstructured":"Uehara, S., Imamura, K.: Linear complexities of periodic sequences obtained from an m-sequence by two-symbol substitution. In: Proc. 1998 Int. Symp. Inf. Theory and Its Appl., pp. 690\u2013692. Mexico City, Mexico, Oct (1998)"},{"key":"4_CR16","first-page":"1164","volume":"E80-A","author":"S. Uehara","year":"1997","unstructured":"Uehara, S., Imamura, K.: Linear complexity of periodic sequences obtained from a sequence over GF(p) with period p n \u2009\u2212\u20091 by one-symbol deletion. IEICE Trans. Fundam. E80-A, 1164\u20131166, June (1997)","journal-title":"IEICE Trans. Fundam."},{"key":"4_CR17","unstructured":"Xu, J.: Stream cipher analysis based on FCSRs. PhD Dissertation, University of Kentucky, May (2000)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-008-0004-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-008-0004-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-008-0004-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:51:50Z","timestamp":1559447510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-008-0004-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,8]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s12095-008-0004-9","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,8]]}}}