Next Article in Journal
Analysis of Entropy in a Hardware-Embedded Delay PUF
Previous Article in Journal
Garbled Quantum Computation
Open AccessArticle

Maximum-Order Complexity and Correlation Measures

1
Department of Mathematics, Salzburg University, Hellbrunner Str. 34, 5020 Salzburg, Austria
2
Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstr. 69, 4040 Linz, Austria
*
Author to whom correspondence should be addressed.
Academic Editor: Kwangjo Kim
Cryptography 2017, 1(1), 7; https://doi.org/10.3390/cryptography1010007
Received: 29 March 2017 / Revised: 9 May 2017 / Accepted: 10 May 2017 / Published: 13 May 2017
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. View Full-Text
Keywords: maximum-order complexity; correlation measure of order k; measures of pseudorandomness; cryptography maximum-order complexity; correlation measure of order k; measures of pseudorandomness; cryptography
MDPI and ACS Style

Işık, L.; Winterhof, A. Maximum-Order Complexity and Correlation Measures. Cryptography 2017, 1, 7.

AMA Style

Işık L, Winterhof A. Maximum-Order Complexity and Correlation Measures. Cryptography. 2017; 1(1):7.

Chicago/Turabian Style

Işık, Leyla; Winterhof, Arne. 2017. "Maximum-Order Complexity and Correlation Measures" Cryptography 1, no. 1: 7.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop