{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:41:58Z","timestamp":1740148918698,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T00:00:00Z","timestamp":1479686400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2015-05208"],"award-info":[{"award-number":["RGPIN-2015-05208"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s12095-016-0208-3","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T02:10:26Z","timestamp":1479694226000},"page":"665-682","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences"],"prefix":"10.1007","volume":"9","author":[{"given":"\u015eaban","family":"Alaca","sequence":"first","affiliation":[]},{"given":"Goldwyn","family":"Millar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,21]]},"reference":[{"issue":"2","key":"208_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.4064\/aa-75-2-97-104","volume":"75","author":"S Akiyama","year":"1996","unstructured":"Akiyama, S.: On the pure Jacobi sums. Acta Arith. 75(2), 97\u2013104 (1996)","journal-title":"Acta Arith."},{"key":"208_CR2","doi-asserted-by":"crossref","unstructured":"Alaca, S., Williams, K.: Introductory Algebraic Number Theory. Cambridge (2004)","DOI":"10.1017\/CBO9780511791260"},{"issue":"12","key":"208_CR3","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 \ud835\udd3d p of the d-ary Sidelnikov sequence. IEEE Trans. Inform. Theory 53(12), 4755\u20134761 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"208_CR4","doi-asserted-by":"crossref","unstructured":"Aly, H.,Winterhof, A.: On the k-error linear complexity over \ud835\udd3d p of Legendre and Sidelnikov sequences. Des. Codes Crypt. 40(3), 369\u2013374 (2006)","DOI":"10.1007\/s10623-006-0023-5"},{"issue":"7","key":"208_CR5","doi-asserted-by":"crossref","first-page":"2934","DOI":"10.1109\/18.959271","volume":"47","author":"KT Arasu","year":"2001","unstructured":"Arasu, K.T., Ding, C., Helleseth, T., Kumar, V., Martinsen, H.M.: Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 47(7), 2934\u20132943 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"208_CR6","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1215\/ijm\/1256048104","volume":"23","author":"BC Berndt","year":"1979","unstructured":"Berndt, B.C., Evans, R.J.: Sums of Gauss, Eisenstein, Jacobi, Jacobsthal, and Brewer. Ill. J. Math. 23(3), 374\u2013437 (1979)","journal-title":"Ill. J. Math."},{"key":"208_CR7","unstructured":"Berndt, B.C., Evans, R.J., Williams, K.S.: Gauss and Jacobi Sums. A Wiley-Interscience Publication (1998)"},{"key":"208_CR8","doi-asserted-by":"crossref","unstructured":"Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn, vol. 1. Cambridge (1999)","DOI":"10.1017\/CBO9780511549533"},{"key":"208_CR9","volume-title":"On the Linear Complexity of Sidelnikov Sequences over \ud835\udd3d d , Sequences and their Applications - SETA 2006, 47 - 60, Lecture Notes in Comput. Sci., vol. 4086","author":"N Brandst\u00e4tter","year":"2006","unstructured":"Brandst\u00e4tter, N., Meidl, W.: On the Linear Complexity of Sidelnikov Sequences over \ud835\udd3d d , Sequences and their Applications - SETA 2006, 47 - 60, Lecture Notes in Comput. Sci., vol. 4086. Springer, Berlin (2006)"},{"issue":"5\u20136","key":"208_CR10","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.jco.2008.04.002","volume":"24","author":"N Brandst\u00e4tter","year":"2008","unstructured":"Brandst\u00e4tter, N., Meidl, W.: On the linear complexity of Sidelnikov sequences over nonprime fields. J. Complexity 24(5\u20136), 648\u2013659 (2008)","journal-title":"J. Complexity"},{"key":"208_CR11","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.ipl.2013.02.008","volume":"113","author":"N Brandst\u00e4tter","year":"2013","unstructured":"Brandst\u00e4tter, N., Meidl, W., Winterhof, A.: Addendum to Sidel\u2019nikov sequences over nonprime fields. Inf. Process. Lett. 113, 332\u2013336 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"208_CR12","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 \ud835\udd3d p of subsequences of Sidelnikov sequences of period (p r \u2212 1)\/3. J. Math. Cryptol. 3(3), 215\u2013225 (2009)","journal-title":"J. Math. Cryptol."},{"key":"208_CR13","volume-title":"Bounds on the Linear Complexity and the 1-Error Linear Complexity over \ud835\udd3d p of M-ary Sidelnikov Sequences, Sequences and their Applications - SETA 2006, 74 - 87, Lecture Notes in Comput. Sci., vol. 4086","author":"JH Chung","year":"2006","unstructured":"Chung, J.H., Yang, K.: Bounds on the Linear Complexity and the 1-Error Linear Complexity over \ud835\udd3d p of M-ary Sidelnikov Sequences, Sequences and their Applications - SETA 2006, 74 - 87, Lecture Notes in Comput. Sci., vol. 4086. Springer, Berlin (2006)"},{"key":"208_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin (1993)"},{"key":"208_CR15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1006\/jcta.1998.2950","volume":"87","author":"R Evans","year":"1999","unstructured":"Evans, R., Hollmann, H.D.L., Krattenthaler, C., Xiang, Q.: Gauss sums, Jacobi Sums, and p-ranks of cyclic difference sets. J. Comb. Theory Ser. A 87, 74\u2013119 (1999)","journal-title":"J. Comb. Theory Ser. A"},{"key":"208_CR16","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.jcta.2011.08.007","volume":"119","author":"T Feng","year":"2012","unstructured":"Feng, T., Xiang, Q.: Cyclotomic constructions of skew Hadamard difference sets. J. Comb. Theory Ser. A 119, 245\u2013256 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"7","key":"208_CR17","doi-asserted-by":"crossref","first-page":"3299","DOI":"10.1109\/TIT.2006.876352","volume":"52","author":"MZ Garaev","year":"2006","unstructured":"Garaev, M.Z., Luca, F., Shparlinski, I.E., Winterhof, A.: On the lower bound of the linear complexity over \ud835\udd3d p of Sidelnikov sequences. IEEE Trans. Inform. Theory 52(7), 3299\u20133304 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"208_CR18","doi-asserted-by":"crossref","unstructured":"Golomb, S., Gong, G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar. Cambridge (2005)","DOI":"10.1017\/CBO9780511546907"},{"issue":"6","key":"208_CR19","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 \ud835\udd3d p and trace representation of Lempel-Cohn-Eastman sequences. IEEE Trans. Inform. Theory 49(6), 1548\u20131552 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"208_CR20","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., Segers, T.: Linear complexity over \ud835\udd3d p of Sidel\u2019nikov sequences. IEEE Trans. Inform. Theory 50(10), 2468\u20132472 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"208_CR21","doi-asserted-by":"crossref","unstructured":"Helleseth, T., Yang, K.: On binary sequences of period n = p m \u2212 1 with optimal autocorrelation. In: Helleseth, T., Kumar, P., Yang, K. (eds.) Proceedings of SETA01, pp 209\u2013217 (2002)","DOI":"10.1007\/978-1-4471-0673-9_15"},{"issue":"55","key":"208_CR22","first-page":"327","volume":"91","author":"K Hardy","year":"1990","unstructured":"Hardy, K., Muskat, J.B., Williams, K.S.: A deterministic algorithm for solving n = f u 2 + g v 2 in coprime integers u and v. Math. Comp. 91(55), 327\u2013343 (1990)","journal-title":"Math. Comp."},{"key":"208_CR23","doi-asserted-by":"crossref","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd edn. Springer-Verlag (1990)","DOI":"10.1007\/978-1-4757-2103-4"},{"key":"208_CR24","doi-asserted-by":"crossref","unstructured":"Kim, Y.S., Chung, J.S., No, J.S., Chung, H.: Linear complexity over \ud835\udd3d p of ternary Sidelnikov sequences. Sequences and their applications - SETA 2006, 61\u201373, Lecture Notes in Comput. Sci., vol. 4086. Springer, Berlin (2006)","DOI":"10.1007\/11863854_6"},{"key":"208_CR25","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1024156525801","volume":"29","author":"G Kyureghyan","year":"2003","unstructured":"Kyureghyan, G., Pott, A.: On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences. Des. Codes Crypt. 29, 149\u2013164 (2003)","journal-title":"Des. Codes Crypt."},{"key":"208_CR26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/jnth.1997.2078","volume":"63","author":"P Langevin","year":"1997","unstructured":"Langevin, P.: Calculs de Certaines Sommes de Gauss. J. Number Theory 63, 59\u201364 (1997)","journal-title":"J. Number Theory"},{"key":"208_CR27","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TIT.1977.1055672","volume":"IT-23","author":"A Lempel","year":"1977","unstructured":"Lempel, A., Cohn, M., Eastman, W.L.: A class of binary sequences with optimal autocorrelation properties. IEEE Trans. Inform. Theory IT-23, 38\u201342 (1977)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"208_CR28","doi-asserted-by":"crossref","unstructured":"Leung, K.H., Schmidt, B.: The field descent method. Des. Codes Crypt. 171\u2013188 (2005)","DOI":"10.1007\/s10623-004-1703-7"},{"key":"208_CR29","doi-asserted-by":"crossref","unstructured":"Ma, S.L.: A survey of partial difference sets. Des. Codes Crypt. 221\u2013261 (1994)","DOI":"10.1007\/BF01388454"},{"key":"208_CR30","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/S0019-9958(68)90534-2","volume":"12","author":"J MacWilliams","year":"1968","unstructured":"MacWilliams, J., Mann, H.B.: On the p-rank of the design matrix of a difference set. Inform. Control 12, 474\u2013488 (1968)","journal-title":"Inform. Control"},{"key":"208_CR31","volume-title":"Introduction to Algebraic Number Theory","author":"HB Mann","year":"1955","unstructured":"Mann, H.B.: Introduction to Algebraic Number Theory. Ohio State Press, Columbus (1955)"},{"key":"208_CR32","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10623-005-6340-2","volume":"8","author":"W Meidl","year":"2006","unstructured":"Meidl, W., Winterhof, A.: Some notes on the linear complexity of Sidel\u2019nikov-Lempel-Cohn-Eastman sequences. Des. Codes Crypt. 8, 159\u2013178 (2006)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"208_CR33","doi-asserted-by":"crossref","first-page":"251","DOI":"10.4064\/cm-73-2-251-260","volume":"73","author":"K Shiratani","year":"1997","unstructured":"Shiratani, K., Yamada, M.: On Rationality of Jacobi Sums. Colloq. Math. 73 (2), 251\u2013260 (1997)","journal-title":"Colloq. Math."},{"issue":"1","key":"208_CR34","first-page":"12","volume":"5","author":"VM Sidelnikov","year":"1969","unstructured":"Sidelnikov, V.M.: Some k-valued pseudo-random sequences and nearly equidistant codes. Probl. Inform. Trans. 5(1), 12\u201316 (1969)","journal-title":"Probl. Inform. Trans."},{"issue":"9","key":"208_CR35","doi-asserted-by":"crossref","first-page":"2525","DOI":"10.1007\/s11425-010-3155-z","volume":"53","author":"L Xia","year":"2010","unstructured":"Xia, L., Yang, J.: Complete solving of explicit evaluation of Gauss sums in the index 2 case. Sci. China Math. 53(9), 2525\u20132542 (2010)","journal-title":"Sci. China Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-016-0208-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-016-0208-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-016-0208-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T16:08:06Z","timestamp":1568563686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-016-0208-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,21]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["208"],"URL":"https:\/\/doi.org\/10.1007\/s12095-016-0208-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2016,11,21]]}}}