{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:39:52Z","timestamp":1649018392102},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s11424-014-2265-z","type":"journal-article","created":{"date-parts":[[2014,4,7]],"date-time":"2014-04-07T07:16:53Z","timestamp":1396855013000},"page":"370-381","source":"Crossref","is-referenced-by-count":0,"title":["FCSR periodic multisequences with maximal joint N-adic complexity and large k-error joint N-adic complexity over Z\/(N)"],"prefix":"10.1007","volume":"27","author":[{"given":"Fulin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honggang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,8]]},"reference":[{"key":"2265_CR1","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-58108-1_21","volume":"809","author":"A Klapper","year":"1994","unstructured":"Klapper A, Goresky M, 2-adic shift registers, ed. by Anderson R, Fast Software Encryption, Lecture Notes in Computer Science, Springer-Verlag, New York, 1994, 809: 174\u2013178.","journal-title":"Fast Software Encryption, Lecture Notes in Computer Science"},{"key":"2265_CR2","volume-title":"Applied Cryptography","author":"B Schneier","year":"1998","unstructured":"Schneier B, Applied Cryptography, Prentice Hall, 1998."},{"key":"2265_CR3","doi-asserted-by":"crossref","unstructured":"Ding C, Xiao G, and Shan W, The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science, Berlin Spinger-Verlag, Germany 1991, 561.","DOI":"10.1007\/3-540-54973-0"},{"issue":"2","key":"2265_CR4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TIT.2002.807308","volume":"49","author":"H Niederreiter","year":"2003","unstructured":"Niederreiter H, Periodic sequence with lager k-error linear complexity, IEEE Trans. Inform. Theory, 2003, 49(2): 501\u2013505.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2265_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s00200-003-0134-4","volume":"14","author":"H Meidl Wand Niederreiter","year":"2003","unstructured":"Meidl Wand Niederreiter H, Periodic sequences with maximal linear complexity and large k-error linear complexity, Appl. Algebra Eng. Commun. Comput., 2003, 14(4): 273\u2013286.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"10","key":"2265_CR6","doi-asserted-by":"crossref","first-page":"4687","DOI":"10.1109\/TIT.2009.2027566","volume":"55","author":"H G Hu","year":"2009","unstructured":"Hu H G, Gong G, and Feng D G, New results on periodic sequences with large k-error linear complexity, IEEE Trans. Inform. Theory, 2009, 55(10): 4687\u20134694.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2265_CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10623-008-9174-x","volume":"49","author":"H Niederreiter","year":"2008","unstructured":"Niederreiter H and Venkateswarlu A, Periodic multisequences with large error linear complexity, Designs, Codes, and Cryptography, 2008, 49: 33\u201345.","journal-title":"Designs, Codes, and Cryptography"},{"key":"2265_CR8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.ffa.2010.09.002","volume":"16","author":"A Venkateswarlu","year":"2010","unstructured":"Venkateswarlu A and Niederreiter H, Improved results on periodic multisequences with large error linear complexity, Finite Fields Appl., 2010, 16: 463\u2013476.","journal-title":"Finite Fields Appl."},{"key":"2265_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s001459900024","volume":"10","author":"A Klapper","year":"1997","unstructured":"Klapper A and Goresky M, Feedback shift registers, 2-adic span, and combiners with memory, J. Cryptology, 1997, 10: 111\u2013147.","journal-title":"J. Cryptology"},{"key":"2265_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/B:DESI.0000015886.71135.e1","volume":"31","author":"A Klapper","year":"2004","unstructured":"Klapper A and Xu J, Register synthesis for algebraic feedback shift registers based on nonprimes, Designs, Codes, and Cryptography, 2004, 31: 227\u2013250.","journal-title":"Designs, Codes, and Cryptography"},{"issue":"5","key":"2265_CR11","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TIT.2004.826651","volume":"50","author":"F Arnault","year":"2004","unstructured":"Arnault F, Berger T P, and Necer A, Feedback with carry shift registers synthesis with the Euclidean algorithm, IEEE Trans. Inform. Theory, 2004, 50(5): 910\u2013917.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2265_CR12","volume-title":"Fast Software Encryption, Lecture Notes in Compute Science","author":"F Arnault","year":"2005","unstructured":"Arnault F and Berger T P, F-FCSR: Design of a new class of streamcipher, Fast Software Encryption, Lecture Notes in Compute Science, Springer-Verlag, Berlin, 2005."},{"issue":"11","key":"2265_CR13","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1109\/TC.2005.181","volume":"54","author":"F Arnault","year":"2005","unstructured":"Arnault F and Berger T P, Design and properties of a new pseudorandom generator based on a filtered FCSR automaton, IEEE Transactions on Computers, 2005, 54(11): 1374\u20131383.","journal-title":"IEEE Transactions on Computers"},{"key":"2265_CR14","volume-title":"Proceedings of International Conference on Sequences and Their Application","author":"A Klapper","year":"1999","unstructured":"Klapper A and Xu J, Feedback with carry shift registers over Z\/(N), Proceedings of International Conference on Sequences and Their Application, Singapore, Springer-Verlag, 1999."},{"key":"2265_CR15","volume-title":"Stream Cipher Annalysis Based on FCSRs","author":"J Xu","year":"2000","unstructured":"Xu J, Stream Cipher Annalysis Based on FCSRs, The university of Kentucky, Lexington, 2000."},{"key":"2265_CR16","volume-title":"Algebraic shift register sequences","author":"M Goresky","year":"2009","unstructured":"Goresky M and Klapper A, Algebraic shift register sequences, www.cs.uky.edu\/klapper\/algebraic.html , 2009-2-11."},{"key":"2265_CR17","volume-title":"N-adic Summation-Shfinking generator","author":"Z Tacheva","year":"2005","unstructured":"Tacheva Z, Bedzhev B, and Stoyanov B, N-adic Summation-Shfinking generator, http:\/\/eprint.iacr.org\/2005\/o68.pdf , 2005."},{"key":"2265_CR18","volume-title":"Sequences and Theirs Applications, Lecture Notes in Compute Science","author":"A Klapper","year":"2005","unstructured":"Klapper A, A survey of feedback with carry shift registers, Sequences and Theirs Applications, Lecture Notes in Compute Science, Springer-Verlag, Berlin, 2005."},{"key":"2265_CR19","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/11863854_16","volume":"4086","author":"L H Dong","year":"2006","unstructured":"Dong L H, Hu Y P, and Zeng Y, Computing the k-error N-adic complexity of a sequence of period p n, Sequences and Theirs Applications, Lecture Notes in Compute Science, Springer-Verlag, Berlin, 2006, 4086: 190\u2013198.","journal-title":"Sequences and Theirs Applications, Lecture Notes in Compute Science"},{"issue":"2","key":"2265_CR20","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.jco.2011.10.006","volume":"28","author":"S X Zhu","year":"2012","unstructured":"Zhu S X and Li F L, Periodic seqences with maximal N-adic complexity and large k-error N-adic complexity over Z\/(N), J. Complexity, 2012, 28(2): 202\u2013208.","journal-title":"J. Complexity"},{"key":"2265_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s12095-008-0004-9","volume":"1","author":"R Kavuluru","year":"2009","unstructured":"Kavuluru R and Klapper A, Lower bounds on error complexity measures for periodic LFSR and FCSR sequences, Cryptogr. Commun., 2009, 1: 95\u2013116.","journal-title":"Cryptogr. Commun."},{"key":"2265_CR22","volume-title":"Algebraic Coding Theory","author":"E R Berlerkamp","year":"1968","unstructured":"Berlerkamp E R, Algebraic Coding Theory, McGraw-Hill, New York, 1968."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2265-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-014-2265-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2265-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:54:07Z","timestamp":1559386447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-014-2265-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["2265"],"URL":"https:\/\/doi.org\/10.1007\/s11424-014-2265-z","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4]]}}}