{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:15:12Z","timestamp":1769976912177,"version":"3.49.0"},"reference-count":21,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2017,5,13]],"date-time":"2017-05-13T00:00:00Z","timestamp":1494633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order k cannot have very small maximum-order complexity.<\/jats:p>","DOI":"10.3390\/cryptography1010007","type":"journal-article","created":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T12:16:12Z","timestamp":1494850572000},"page":"7","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Maximum-Order Complexity and Correlation Measures"],"prefix":"10.3390","volume":"1","author":[{"given":"Leyla","family":"I\u015f\u0131k","sequence":"first","affiliation":[{"name":"Department of Mathematics, Salzburg University, Hellbrunner Str. 34, 5020 Salzburg, Austria"}]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[{"name":"Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstr. 69, 4040 Linz, Austria"}]}],"member":"1968","published-online":{"date-parts":[[2017,5,13]]},"reference":[{"key":"ref_1","first-page":"43","article-title":"Measures of pseudorandomness. Finite Fields and Their Applications","volume":"Volume 11","author":"Gyarmati","year":"2013","journal-title":"Radon Series on Computational and Applied Mathematics"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Mullen, G.L., and Panario, D. (2013). Linear complexity of sequences and multisequences, Section 10.4 of the Handbook of Finite Fields. Discrete Mathematics and its Applications (Boca Raton), CRC Press.","DOI":"10.1201\/b15006"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Niederreiter, H. (2003). Linear complexity and related complexity measures for sequences. Progress in Cryptology-INDOCRYPT 2003, Springer. Lecture Notes in Computer Science, 2904.","DOI":"10.1007\/978-3-540-24582-7_1"},{"key":"ref_4","first-page":"123","article-title":"On finite pseudorandom binary sequences and their applications in cryptography","volume":"37","year":"2007","journal-title":"Tatra Mt. Math. Publ."},{"key":"ref_5","unstructured":"Topuzo\u011flu, A., and Winterhof, A. (2007). Pseudorandom sequences. Topics in Geometry, Coding Theory and Cryptography, Springer. Algebra Applications, 6."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Winterhof, A. (2010). Linear complexity and related complexity measures. Selected Topics in Information and Coding Theory, World Science Publishing.","DOI":"10.1142\/9789812837172_0001"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.4064\/aa-82-4-365-377","article-title":"On finite pseudorandom binary sequences. I. Measure of pseudorandomness, the Legendre symbol","volume":"82","author":"Mauduit","year":"1997","journal-title":"Acta Arith."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10998-006-0008-1","article-title":"Linear complexity profile of binary sequences with small correlation measure","volume":"52","author":"Winterhof","year":"2006","journal-title":"Period. Math. Hung."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Shparlinski, I. (2003). Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness, Birkh\u00e4user Verlag. Progress in Computer Science and Applied Logic, 22.","DOI":"10.1007\/978-3-0348-8037-4"},{"key":"ref_10","unstructured":"Jansen, C.J.A. (1989). Investigations on Nonlinear Streamcipher Systems: Construction and Evaluation Methods. [Ph.D. Thesis, Technische Universiteit Delft]."},{"key":"ref_11","unstructured":"Davies, D.W. (1991). The maximum order complexity of sequence ensembles. Advances in Cryptology\u2014 EUROCRYPT\u201991, LNCS 547, Springer."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"6696","DOI":"10.1109\/TIT.2014.2343225","article-title":"Sequences with high nonlinear complexity","volume":"60","author":"Niederreiter","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1112\/plms\/pdm027","article-title":"Measures of pseudorandomness for finite sequences: Typical values","volume":"95","author":"Alon","year":"2007","journal-title":"Proc. Lond. Math. Soc."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/S0019-3577(09)80030-X","article-title":"Linear complexity profile of m-ary pseudorandom sequences with small correlation measure","volume":"20","author":"Chen","year":"2009","journal-title":"Indag. Math."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0019-3577(02)90008-X","article-title":"On finite pseudorandom sequences of k symbols","volume":"13","author":"Mauduit","year":"2002","journal-title":"Indag. Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s12095-015-0131-z","article-title":"Linear complexity profile and correlation measure of interleaved sequences","volume":"7","author":"He","year":"2015","journal-title":"Cryptogr. Commun."},{"key":"ref_17","first-page":"3654","article-title":"Some notes on the two-prime generator of order 2","volume":"5","author":"Winterhof","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10998-005-0031-7","article-title":"Modular constructions of pseudorandom binary sequences with composite moduli","volume":"51","author":"Rivat","year":"2005","journal-title":"Period. Math. Hung."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.jnt.2003.12.002","article-title":"Construction of large families of pseudorandom binary sequences","volume":"106","author":"Goubin","year":"2004","journal-title":"J. Number Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2020","DOI":"10.1016\/j.disc.2015.04.015","article-title":"Improving results on the pseudorandomness of sequences generated via the additive order of a finite field","volume":"338","author":"Yayla","year":"2015","journal-title":"Discret. Math."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.1016\/j.disc.2008.01.056","article-title":"Measures of pseudorandomness for binary sequences constructed using finite fields","volume":"309","author":"Winterhof","year":"2009","journal-title":"Discret. Math."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/1\/1\/7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:35:42Z","timestamp":1760207742000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/1\/1\/7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,13]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,6]]}},"alternative-id":["cryptography1010007"],"URL":"https:\/\/doi.org\/10.3390\/cryptography1010007","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,13]]}}}