{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T23:23:15Z","timestamp":1772839395719,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2015,6,27]],"date-time":"2015-06-27T00:00:00Z","timestamp":1435363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s11432-014-5220-7","type":"journal-article","created":{"date-parts":[[2015,6,27]],"date-time":"2015-06-27T17:03:58Z","timestamp":1435424638000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["On the k-error linear complexity of binary sequences derived from polynomial quotients","\u591a\u9879\u5f0f\u5546\u6784\u9020\u7684\u4e8c\u5143\u5e8f\u5217\u7684k-\u9519\u7ebf\u6027\u590d\u6742\u5ea6"],"prefix":"10.1007","volume":"58","author":[{"given":"ZhiXiong","family":"Chen","sequence":"first","affiliation":[]},{"given":"ZhiHua","family":"Niu","sequence":"additional","affiliation":[]},{"given":"ChenHuang","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,27]]},"reference":[{"key":"5220_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1090\/conm\/579\/11519","volume":"579","author":"Z X Chen","year":"2012","unstructured":"Chen Z X, Winterhof A. Additive character sums of polynomial quotients. Contemp Math, 2012, 579: 67\u201373","journal-title":"Contemp Math"},{"key":"5220_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1006\/jnth.1997.2162","volume":"66","author":"T Agoh","year":"1997","unstructured":"Agoh T, Dilcher K, Skula L. Fermat quotients for composite moduli. J Number Theory, 1997, 66: 29\u201350","journal-title":"J Number Theory"},{"key":"5220_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12095-011-0043-5","volume":"3","author":"H Aly","year":"2011","unstructured":"Aly H, Winterhof A. Boolean functions derived from Fermat quotients. Cryptogr Commun, 2011, 3: 165\u2013174","journal-title":"Cryptogr Commun"},{"key":"5220_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1307\/mmj\/1281531459","volume":"59","author":"J Bourgain","year":"2010","unstructured":"Bourgain J, Ford K, Konyagin S, et al. On the divisibility of Fermat quotients. Michigan Math J, 2010, 59: 313\u2013328","journal-title":"Michigan Math J"},{"key":"5220_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.4064\/aa152-1-3","volume":"152","author":"M C Chang","year":"2012","unstructured":"Chang M C. Short character sums with Fermat quotients. Acta Arith, 2012, 152: 23\u201338","journal-title":"Acta Arith"},{"key":"5220_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10623-012-9608-3","volume":"67","author":"Z X Chen","year":"2013","unstructured":"Chen Z X, Du X N. On the linear complexity of binary threshold sequences derived from Fermat quotients. Des Codes Cryptogr, 2013, 67: 317\u2013323","journal-title":"Des Codes Cryptogr"},{"key":"5220_CR7","first-page":"181","volume-title":"Proceedings of the 7th International Conference on Sequences and Their Application","author":"ZX Chen","year":"2012","unstructured":"Chen ZX, G\u00f3mez-P\u00e9rez D. Linear complexity of binary sequences derived from polynomial quotients. In: Proceedings of the 7th International Conference on Sequences and Their Application. Berlin: Springer-Verlag, 2012. 181\u2013189"},{"key":"5220_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-642-13797-6_6","volume-title":"Proceedings of the 3rd International Conference on Arithmetic of Finite Fields","author":"Z X Chen","year":"2010","unstructured":"Chen Z X, Ostafe A, Winterhof A. Structure of pseudorandom numbers derived from Fermat quotients. In: Proceedings of the 3rd International Conference on Arithmetic of Finite Fields. Berlin: Springer-Verlag, 2010. 73\u201385"},{"key":"5220_CR9","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1142\/S1793042112500352","volume":"8","author":"Z X Chen","year":"2012","unstructured":"Chen Z X, Winterhof A. On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients. Int J Number Theory, 2012, 8: 631\u2013641","journal-title":"Int J Number Theory"},{"key":"5220_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/130907951","volume":"28","author":"Z X Chen","year":"2014","unstructured":"Chen Z X, Winterhof A. Interpolation of Fermat quotients. SIAM J Discr Math, 2014, 28: 1\u20137","journal-title":"SIAM J Discr Math"},{"key":"5220_CR11","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.ipl.2012.04.011","volume":"112","author":"X N Du","year":"2012","unstructured":"Du X N, Chen Z X, Hu L. Linear complexity of binary sequences derived from Euler quotients with prime-power modulus. Inf Process Lett, 2012, 112: 604\u2013609","journal-title":"Inf Process Lett"},{"key":"5220_CR12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.ipl.2011.11.017","volume":"112","author":"X N Du","year":"2012","unstructured":"Du X N, Klapper A, Chen Z X. Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. Inf Process Lett, 2012, 112: 233\u2013237","journal-title":"Inf Process Lett"},{"key":"5220_CR13","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1090\/S0025-5718-97-00843-0","volume":"66","author":"R Ernvall","year":"1997","unstructured":"Ernvall R, Mets\u00e4nkyl\u00e4 T. On the p-divisibility of Fermat quotients. Math Comp, 1997, 66: 1353\u20131365","journal-title":"Math Comp"},{"key":"5220_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10998-012-3747-1","volume":"64","author":"D G\u00f3mez-P\u00e9rez","year":"2012","unstructured":"G\u00f3mez-P\u00e9rez D, Winterhof A. Multiplicative character sums of Fermat quotients and pseudorandom sequences. Period Math Hungar, 2012, 64: 161\u2013168","journal-title":"Period Math Hungar"},{"key":"5220_CR15","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1137\/100798466","volume":"25","author":"A Ostafe","year":"2011","unstructured":"Ostafe A, Shparlinski I E. Pseudorandomness and dynamics of Fermat quotients. SIAM J Discr Math, 2011, 25: 50\u201371","journal-title":"SIAM J Discr Math"},{"key":"5220_CR16","volume-title":"The arithmetic of Carmichael quotients","author":"M Sha","year":"2011","unstructured":"Sha M. The arithmetic of Carmichael quotients. arXiv:1108.2579, 2011"},{"key":"5220_CR17","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1093\/qmath\/haq028","volume":"62","author":"I E Shparlinski","year":"2011","unstructured":"Shparlinski I E. Character sums with Fermat quotients. Quart J Math, 2011, 62: 1031\u20131043","journal-title":"Quart J Math"},{"key":"5220_CR18","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1017\/S000497271000198X","volume":"83","author":"I E Shparlinski","year":"2011","unstructured":"Shparlinski I E. Bounds of multiplicative character sums with Fermat quotients of primes. Bull Aust Math Soc, 2011, 83: 456\u2013462","journal-title":"Bull Aust Math Soc"},{"key":"5220_CR19","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1090\/S0002-9939-2011-11203-6","volume":"140","author":"I E Shparlinski","year":"2012","unstructured":"Shparlinski I E. On the value set of Fermat quotients. Proc Amer Math Soc, 2012, 140: 1199\u20131206","journal-title":"Proc Amer Math Soc"},{"key":"5220_CR20","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1112\/blms\/bdr058","volume":"43","author":"I E Shparlinski","year":"2011","unstructured":"Shparlinski I E. Fermat quotients: exponential sums, value set and primitive roots. Bull Lond Math Soc, 2011, 43: 1228\u20131238","journal-title":"Bull Lond Math Soc"},{"key":"5220_CR21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ffa.2012.10.004","volume":"19","author":"I E Shparlinski","year":"2013","unstructured":"Shparlinski I E, Winterhof A. Distribution of values of polynomial Fermat quotients. Finite Fields Appl, 2013, 19: 93\u2013104","journal-title":"Finite Fields Appl"},{"key":"5220_CR22","first-page":"112109","volume":"57","author":"Z X Chen","year":"2014","unstructured":"Chen Z X. Trace representation and linear complexity of binary sequences derived from Fermat quotients. Sci China Inf Sci, 2014, 57: 112109","journal-title":"Sci China Inf Sci"},{"key":"5220_CR23","first-page":"105","volume":"9","author":"Z X Chen","year":"2012","unstructured":"Chen Z X, Hu L, Du X N. Linear complexity of some binary sequences derived from Fermat quotients. China Commun, 2012, 9: 105\u2013108","journal-title":"China Commun"},{"key":"5220_CR24","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R, Niederreiter H. Finite Fields. 2nd Ed. Cambridge: Cambridge University Press, 1997","edition":"2nd Ed."},{"key":"5220_CR25","doi-asserted-by":"crossref","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 2n. IEEE Trans Inf Theory, 1993, 39: 1398\u20131401","journal-title":"IEEE Trans Inf Theory"},{"key":"5220_CR26","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 Cryptogr, 2004, 33: 109\u2013122","journal-title":"Des Codes Cryptogr"},{"key":"5220_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54973-0","volume-title":"The Stability Theory of Stream Ciphers","author":"C S Ding","year":"1991","unstructured":"Ding C S, Xiao G Z, Shan W J. The Stability Theory of Stream Ciphers. Berlin: Springer-Verlag, 1991"},{"key":"5220_CR28","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J L Massey","year":"1969","unstructured":"Massey J L. Shift register synthesis and BCH decoding. IEEE Trans Inf Theory, 1969, 15: 122\u2013127","journal-title":"IEEE Trans Inf Theory"},{"key":"5220_CR29","first-page":"283","volume":"1","author":"H Aly","year":"2007","unstructured":"Aly H, Meidl W, Winterhof A. On the k-error linear complexity of cyclotomic sequences. J Math Cryptol, 2007, 1: 283\u2013296","journal-title":"J Math Cryptol"},{"key":"5220_CR30","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10623-006-0023-5","volume":"40","author":"H Aly","year":"2006","unstructured":"Aly H, Winterhof A. On the k-error linear complexity over $$\\mathbb{F}_p$$ of Legendre and Sidel\u2019nikov sequences. Des Codes Cryptogr, 2006, 40: 369\u2013374","journal-title":"Des Codes Cryptogr"},{"key":"5220_CR31","doi-asserted-by":"crossref","first-page":"4755","DOI":"10.1109\/TIT.2007.909129","volume":"53","author":"H Aly","year":"2007","unstructured":"Aly H, Meidl W. On the linear complexity and k-error linear complexity over $$\\mathbb{F}_p$$ of the d-ary Sidel\u2019nikov sequence. IEEE Trans Inf Theory, 2007, 53: 4755\u20134761","journal-title":"IEEE Trans Inf Theory"},{"key":"5220_CR32","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1515\/JMC.2009.012","volume":"3","author":"N Brandst\u00e4tter","year":"2009","unstructured":"Brandst\u00e4tter N, Winterhof A. k-error linear complexity over $$\\mathbb{F}_p$$ of subsequences of Sidel\u2019nikov sequences of period (p r \u2212 1)\/3. J Math Cryptol, 2009, 3: 215\u2013225","journal-title":"J Math Cryptol"},{"key":"5220_CR33","series-title":"Lecture Notes in Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/11863854_7","volume-title":"Proc Int\u2019l Conf on Sequences and Their Applications-SETA 2006","author":"J H Chung","year":"2006","unstructured":"Chung J H, Yang K. Bounds on the linear complexity and the 1-error linear complexity over $$\\mathbb{F}_p$$ of M-ary Sidel\u2019nikov sequences. In: Proc Int\u2019l Conf on Sequences and Their Applications-SETA 2006, Lecture Notes in Comput Sci, vol. 4086. Berlin: Springer-Verlag, 2006. 74\u201387"},{"key":"5220_CR34","first-page":"154","volume-title":"Proceedings of the 4th International Conference on Sequences and Their Applications","author":"Y C Eun","year":"2005","unstructured":"Eun Y C, Song H Y, Kyureghyan G M. One-error linear complexity over $$\\mathbb{F}_p$$ of Sidel\u2019nikov sequences. In: Proceedings of the 4th International Conference on Sequences and Their Applications. Berlin: Springer-Verlag, 2005. 154\u2013165"},{"key":"5220_CR35","doi-asserted-by":"crossref","first-page":"3299","DOI":"10.1109\/TIT.2006.876352","volume":"52","author":"M Z Garaev","year":"2006","unstructured":"Garaev M Z, Luca F, Shparlinski I E, et al. On the lower bound of the linear complexity over $$\\mathbb{F}_p$$ of Sidel\u2019nikov sequences. IEEE Trans Inf Theory, 2006, 52: 3299\u20133304","journal-title":"IEEE Trans Inf Theory"},{"key":"5220_CR36","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2003.811924","volume":"49","author":"T Helleseth","year":"2003","unstructured":"Helleseth T, Kim S H, No J S. Linear complexity over $$\\mathbb{F}_p$$ and trace representation of Lempel-Cohn-Eastman sequences. IEEE Trans Inf Theory, 2003, 49: 1548\u20131552","journal-title":"IEEE Trans Inf Theory"},{"key":"5220_CR37","doi-asserted-by":"crossref","first-page":"2468","DOI":"10.1109\/TIT.2004.834854","volume":"50","author":"T Helleseth","year":"2004","unstructured":"Helleseth T, Maas M, Mathiassen J E, et al. Linear complexity over $$\\mathbb{F}_p$$ of Sidel\u2019nikov sequences. IEEE Trans Inf Theory, 2004, 50: 2468\u20132472","journal-title":"IEEE Trans Inf Theory"},{"key":"5220_CR38","volume-title":"Solved and Unsolved Problems in Number Theory","author":"D Shanks","year":"1978","unstructured":"Shanks D. Solved and Unsolved Problems in Number Theory. New York: Chelsea Publishing Company, 1978"},{"key":"5220_CR39","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1090\/S0025-5718-97-00791-6","volume":"66","author":"R Crandall","year":"1997","unstructured":"Crandall R, Dilcher K, Pomerance C. A search for Wieferich and Wilson primes. Math Comp, 1997, 66: 433\u2013449","journal-title":"Math Comp"},{"key":"5220_CR40","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jcta.1996.0088","volume":"76","author":"S R Blackburn","year":"1996","unstructured":"Blackburn S R, Etzion T, Paterson K G. Permutation polynomials, de Bruijn sequences, and linear complexity. J Combin Theory Ser A, 1996, 76: 55\u201382","journal-title":"J Combin Theory Ser A"},{"key":"5220_CR41","doi-asserted-by":"crossref","first-page":"4681","DOI":"10.1109\/TIT.2009.2027495","volume":"55","author":"T Etzion","year":"2009","unstructured":"Etzion T, Kalouptsidis N, Kolokotronis N, et al. Properties of the error linear complexity spectrum. IEEE Trans Inf Theory, 2009, 55: 4681\u20134686","journal-title":"IEEE Trans Inf Theory"},{"key":"5220_CR42","volume-title":"Stream Ciphers and Number Theory","author":"T W Cusick","year":"1998","unstructured":"Cusick T W, Ding C S, Renvall A. Stream Ciphers and Number Theory. Amsterdam: North-Holland Publishing Co., 1998"},{"key":"5220_CR43","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/ffta.1997.0181","volume":"3","author":"C S Ding","year":"1997","unstructured":"Ding C S. Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields Appl, 1997, 3: 159\u2013174","journal-title":"Finite Fields Appl"},{"key":"5220_CR44","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1109\/18.681354","volume":"44","author":"C S Ding","year":"1998","unstructured":"Ding C S. Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Trans Inf Theory, 1998, 44: 1699\u20131702","journal-title":"IEEE Trans Inf Theory"},{"key":"5220_CR45","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1109\/18.669398","volume":"44","author":"C S Ding","year":"1998","unstructured":"Ding C S, Helleseth T, Shan W J. On the linear complexity of Legendre sequences. IEEE Trans Inf Theory, 1998, 44: 1276\u20131278","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5220-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-014-5220-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5220-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:37:59Z","timestamp":1559403479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-014-5220-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,27]]},"references-count":45,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["5220"],"URL":"https:\/\/doi.org\/10.1007\/s11432-014-5220-7","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,27]]}}}