{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:54:10Z","timestamp":1725562450249},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213246"},{"type":"electronic","value":"9783540246336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24633-6_1","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T08:38:22Z","timestamp":1280738302000},"page":"1-11","source":"Crossref","is-referenced-by-count":10,"title":["On the Autocorrelation of Cyclotomic Generators"],"prefix":"10.1007","author":[{"given":"Wilfried","family":"Meidl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Canadian Mathematical Society Series of Monographs and Advanced Texts","volume-title":"Gauss and Jacobi sums","author":"B.C. Berndt","year":"1998","unstructured":"Berndt, B.C., Evans, R.J., Williams, K.S.: Gauss and Jacobi sums. Canadian Mathematical Society Series of Monographs and Advanced Texts. A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York (1998)"},{"key":"1_CR2","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Elliptic curves in cryptography. Reprint of the 1999 original","author":"I.F. Blake","year":"2000","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic curves in cryptography. Reprint of the 1999 original. London Mathematical Society Lecture Note Series, vol.\u00a0265. Cambridge University Press, Cambridge (2000)"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1112\/plms\/s3-13.1.537","volume":"13","author":"D.A. Burgess","year":"1963","unstructured":"Burgess, D.A.: On Dirichlet characters of polynomials. Proc. London Math. Soc.\u00a013(3), 537\u2013548 (1963)","journal-title":"Proc. London Math. Soc."},{"key":"1_CR4","series-title":"North- Holland Mathematical Library","volume-title":"Stream ciphers and number theory","author":"T.W. Cusick","year":"1998","unstructured":"Cusick, T.W., Ding, C., Renvall, A.: Stream ciphers and number theory. North- Holland Mathematical Library, vol.\u00a055. North-Holland Publishing Co., Amsterdam (1998)"},{"key":"#cr-split#-1_CR5.1","doi-asserted-by":"crossref","unstructured":"Dai, Z., Yang, J., Gong, G., Wang, P.: On the linear complexity of generalized Legendre sequence. Sequences and their applications (Bergen), pp. 145???153 (2001);","DOI":"10.1007\/978-1-4471-0673-9_10"},{"key":"#cr-split#-1_CR5.2","unstructured":"Discrete Math. Theor. Comput. Sci. (Lond.). Springer, London (2002)"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02843959","volume":"12","author":"H. Davenport","year":"1963","unstructured":"Davenport, H., Lewis, D.J.: Character sums and primitive roots in finite fields. Rend. Circ. Mat. Palermo\u00a012(2), 129\u2013136 (1963)","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/18.669398","volume":"44","author":"C. Ding","year":"1998","unstructured":"Ding, C., Helleseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Transactions on Information Theory\u00a044, 1276\u20131278 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0020-0190(98)00025-8","volume":"66","author":"C. Ding","year":"1998","unstructured":"Ding, C., Helleseth, T.: On cyclotomic generator of order r. Inform. Process. Lett.\u00a066(1), 21\u201325 (1998)","journal-title":"Inform. Process. Lett."},{"key":"#cr-split#-1_CR9.1","doi-asserted-by":"crossref","unstructured":"Helleseth, T.: On the crosscorrelation of m-sequences and related sequences with ideal autocorrelation. Sequences and their applications (Bergen), pp. 34???45 (2001);","DOI":"10.1007\/978-1-4471-0673-9_3"},{"key":"#cr-split#-1_CR9.2","unstructured":"Discrete Math. Theor. Comput. Sci. (Lond.). Springer, London (2002)"},{"key":"#cr-split#-1_CR10.1","doi-asserted-by":"crossref","unstructured":"Helleseth, T., Yang, K.: On binary sequences of period n = pm ???1 with optimal autocorrelation. Sequences and their applications (Bergen), pp. 209???217 (2001);","DOI":"10.1007\/978-1-4471-0673-9_15"},{"key":"#cr-split#-1_CR10.2","unstructured":"Discrete Math. Theor. Comput. Sci. (Lond.). Springer, London (2002)"},{"key":"1_CR11","unstructured":"Jungnickel, D.: Finite fields. Structure and arithmetics. Bibliographisches Institut, Mannheim (1993)"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1022584306676","volume":"28","author":"S. Konyagin","year":"2003","unstructured":"Konyagin, S., Lange, T., Shparlinski, I.: Linear complexity of the discrete logarithm. Designs, Codes, and Cryptography\u00a028(2), 135\u2013146 (2003)","journal-title":"Designs, Codes, and Cryptography"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1024156525801","volume":"29","author":"G.M. Kyureghyan","year":"2003","unstructured":"Kyureghyan, G.M., Pott, A.: On the linear complexity of the Sidelnikov-Lempel- Cohn-Eastman sequences. Designs, Codes, and Cryptography\u00a029, 149\u2013164 (2003)","journal-title":"Designs, Codes, and Cryptography"},{"issue":"1","key":"1_CR14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TIT.1977.1055672","volume":"-23","author":"A. Lempel","year":"1977","unstructured":"Lempel, A., Cohn, M., Eastman, W.L.: A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Information Theory IT-23(1), 38\u201342 (1977)","journal-title":"IEEE Trans. Information Theory IT"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 1\u201319. Springer, Heidelberg (2000)"},{"key":"1_CR16","first-page":"151","volume-title":"Public-key cryptography and computational number theory","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: An overview of the XTR public key system. In: Public-key cryptography and computational number theory, Warsaw, 2000, pp. 151\u2013180. de Gruyter, Berlin (2001)"},{"issue":"6","key":"1_CR17","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1049\/el:20000427","volume":"36","author":"H.D. L\u00fcke","year":"2000","unstructured":"L\u00fcke, H.D., Schotten, H.D., Hadinejad-Mahram, H.: Generalized Sidelnikov sequences with optimal autocorrelation properties. Electronic Letters\u00a036(6), 525\u2013527 (2000)","journal-title":"Electronic Letters"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1109\/18.959261","volume":"47","author":"W. Meidl","year":"2001","unstructured":"Meidl, W., Winterhof, A.: Lower bounds on the linear complexity of the discrete logarithm in finite fields. IEEE Transactions on Information Theory\u00a047, 2807\u20132811 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR19","series-title":"The Kluwer International Series in Engineering and Computer Science","volume-title":"Communications and Information Theory","author":"A. Menezes","year":"1993","unstructured":"Menezes, A.: Elliptic curve public key cryptosystems. In: Communications and Information Theory. The Kluwer International Series in Engineering and Computer Science, vol.\u00a0234. Kluwer Academic Publishers, Boston (1993)"},{"key":"1_CR20","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. In: With a foreword by Rivest, R.L. (ed.). CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton (1997)"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.4064\/aa-43-3-245-251","volume":"43","author":"A.M. Naranjani","year":"1984","unstructured":"Naranjani, A.M.: On Dirichlet characters of polynomials. Acta Arith.\u00a043, 245\u2013251 (1984)","journal-title":"Acta Arith."},{"issue":"271","key":"1_CR22","first-page":"185","volume":"45","author":"G.I. Perelm\u0301uter","year":"1990","unstructured":"Perelm\u0301uter, G.I., Shparlinski\u012d, I.E.: Distribution of primitive roots in finite fields (Russian) Uspekhi Mat. Nauk.\u00a045(1)(271), 185\u2013186 (1990); translation in Russian Math. Surveys 45(1), 223\u2013224 (1990)","journal-title":"; translation in Russian Math. Surveys"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BF01175029","volume":"56","author":"O. Perron","year":"1952","unstructured":"Perron, O.: Bemerkungen \u00fcber die Verteilung der quadratischen. Reste. Math. Z\u00a056, 122\u2013130 (1952)","journal-title":"Reste. Math. Z"},{"key":"1_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8664-2","volume-title":"Number Theoretic Methods in Cryptography","author":"I.E. Shparlinski","year":"1999","unstructured":"Shparlinski, I.E.: Number Theoretic Methods in Cryptography. Birkh\u00e4user, Basel (1999)"},{"key":"1_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8037-4","volume-title":"Cryptographic Applications of Analytic Number Theory","author":"I.E. Shparlinski","year":"2003","unstructured":"Shparlinski, I.E.: Cryptographic Applications of Analytic Number Theory. Birkh\u00e4user, Basel (2003)"},{"key":"1_CR26","unstructured":"Sidel\u0144ikov, V.M.: Some k-valued pseudo-random sequences and nearly equidistant codes. Problems of Information Transmission\u00a05(1), 12\u201316 (1969); translated from Problemy Pereda\u010di Informacii 5(1), 16\u201322 (1969) (Russian)"},{"key":"1_CR27","series-title":"Lecture Notes in Pure and Appl. Math.","first-page":"261","volume-title":"Number theory and its applications","author":"A. Tiet\u00e4v\u00e4inen","year":"1999","unstructured":"Tiet\u00e4v\u00e4inen, A.: Vinogradov\u2019s method and some applications. In: Number theory and its applications, Ankara, 1996. Lecture Notes in Pure and Appl. Math., vol.\u00a0204, pp. 261\u2013282. Dekker, New York (1999)"},{"issue":"1","key":"1_CR28","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/ffta.1997.0199","volume":"4","author":"A. Winterhof","year":"1998","unstructured":"Winterhof, A.: On the distribution of powers in finite fields. Finite Fields Appl.\u00a04(1), 43\u201354 (1998)","journal-title":"Finite Fields Appl."},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1008300619004","volume":"22","author":"A. Winterhof","year":"2001","unstructured":"Winterhof, A.: Some estimates for character sums and applications. Des. Codes Cryptogr.\u00a022(2), 123\u2013131 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR30","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/978-3-642-56755-1_35","volume-title":"Incomplete additive character sums and applications. Finite fields and applications","author":"A. Winterhof","year":"2001","unstructured":"Winterhof, A.: Incomplete additive character sums and applications. Finite fields and applications, Augsburg 1999, pp. 462\u2013476. Springer, Berlin (2001)"},{"issue":"1","key":"1_CR31","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/jnth.2001.2675","volume":"91","author":"A. Winterhof","year":"2001","unstructured":"Winterhof, A.: Character sums, primitive elements, and powers in finite fields. J. Number Theory\u00a091(1), 153\u2013163 (2001)","journal-title":"J. Number Theory"},{"key":"1_CR32","unstructured":"Winterhof, A.: A note on the linear complexity profile of the discrete logarithm in finite fields (preprint)"}],"container-title":["Lecture Notes in Computer Science","Finite Fields and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24633-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T22:54:59Z","timestamp":1559343299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24633-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213246","9783540246336"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24633-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}