# The Eigenvalue Complexity of Sequences in the Real Domain

^{1}

^{2}

^{*}

*Keywords:*eigenvalue; real number sequences; complexity

Previous Article in Journal

School of Software, Nanchang University, Nanchang 330031, China

School of Automation, Huazhong University of Science & Technique, Wuhan 430074, China

Author to whom correspondence should be addressed.

Received: 5 November 2019 / Revised: 27 November 2019 / Accepted: 3 December 2019 / Published: 5 December 2019

(This article belongs to the Section Complexity)

The eigenvalue is one of the important cryptographic complexity measures for sequences. However, the eigenvalue can only evaluate sequences with finite symbols—it is not applicable for real number sequences. Recently, chaos-based cryptography has received widespread attention for its perfect dynamical characteristics. However, dynamical complexity does not completely equate to cryptographic complexity. The security of the chaos-based cryptographic algorithm is not fully guaranteed unless it can be proven or measured by cryptographic standards. Therefore, in this paper, we extended the eigenvalue complexity measure from the finite field to the real number field to make it applicable for the complexity measurement of real number sequences. The probability distribution, expectation, and variance of the eigenvalue of real number sequences are discussed both theoretically and experimentally. With the extension of eigenvalue, we can evaluate the cryptographic complexity of real number sequences, which have a great advantage for cryptographic usage, especially for chaos-based cryptography.

Sequence complexity can be regarded as a series of measures that depicts the different characteristics of sequences. For cryptographic uses, the most important complexity measures of sequences are linear complexity, Lempel–Ziv (LZ) complexity, eigenvalue, and nonlinear complexity. The nonlinear complexity of a sequence y is an important measure, and it is defined as the length of the shortest Feedback Shift Register (FSR) that generates y. For the shortest Linear Feedback Shift Register (LFSR), it is referred to as the linear complexity. These two measures have been studied for many decades [1,2,3,4,5,6]. In addition, Lempel and Ziv proposed another well known complexity measure for a given sequence, which is called the LZ complexity [7]. The complexity is related to the number of distinct phrases and the rate of their occurrence along the sequence. In the same study, the eigenvalue was provided from a similar aspect as well, while the eigenvalue profile more closely reflected the rate of vocabulary growth than the LZ complexity. The relationship between LZ complexity and nonlinear complexity was studied in [8], which shows that these two complexity measures are converse in a sense.

For all these complexities, there exists a premise, which is that the measured sequences should be on the finite field. This implies that the cardinality of the state set of the sequences should be finite. For linear complexity and nonlinear complexity, the cardinality of the state set is always set to be two, which corresponds to a binary sequence. The Lempel–Ziv complexity and the eigenvalue can measure the sequences with N symbols, where N is finite. [9] studied the relationship between the eigenvalue and Shannon’s entropy of finite symbol sequences. The authors of [10] studied the relationship between the nonlinear complexity and Shannon’s entropy of random binary sequences. Moreover, the authors of [11] investigated a method to construct finite length sequences with the large nonlinear complexity on the finite field. In addition, the authors of [12] used the Lempel–Ziv complexity as a nonlinear analysis tool on the characterization of the effects of sleep deprivation on the electroencephalogram, etc. To the best of our knowledge, most of the studies in these complexity measures, including theoretical analyses and practical applications, were subjected to this constraint.

Nowadays, many physical systems can be used in cryptography for its complex dynamical properties, such as chaos-based cryptography [13,14,15,16,17,18,19,20]. However, chaotic systems are based on the real number field **R**^{n}, and the cardinality of the state variable is infinite. Currently, we always prove a chaos-based secure cryptographic algorithm based on its high dynamical complexity. However, the dynamical complexity is not completely equal to the cryptographic complexity. Thus, the security of chaos-based cryptographic algorithms is not guaranteed by cryptography researchers [21].

In order to overcome this weakness of chaos-based cryptography, we should evaluate the complexity of chaotic sequences in a cryptographic way. However, all the cryptographic complexity measures currently used are only available for finite symbol sequences. Thus, we should extend the cryptographic complexity from the finite field to the real number field. In this paper, we mainly focused on the eigenvalue complexity, extending this measure from the finite field to the real number field to evaluate the cryptographic properties of real number sequences. The probability distribution, expectation, and variance of the eigenvalue of real number sequences are discussed both theoretically and experimentally.

The rest of this paper is organized as follows. In Section 2, a brief introduction for the eigenvalue is presented and its extension to the real number field is proposed. The eigenvalue of two kinds of real number sequences are discussed in Section 3, including the uniformly distributed random sequence and the logistic chaotic sequence. In Section 4, four kinds of chaotic sequences are evaluated and compared by using the extended eigenvalue measure. Finally, Section 5 concludes the whole paper.

The eigenvalue was first proposed by Lempel and Ziv in [7], which described the number of words occurring from a particular parsing procedure of the sequence. Here, we simply summarized the definition of eigenvalue.

Let **F**_{2} denote the binary field and x^{N} = x_{0}x_{1}x_{2}…x_{N}_{−1} be s binary sequence with length N. x_{i}^{j} is denoted as the tuple x_{i}…x_{j} in the sequence, i ≤ j. The prefix and suffix of sequence x^{N} is defined as x_{0}^{j} and x_{j}^{N}^{−1}, respectively. When j < N-1, they refer to proper prefix and proper suffix, respectively. The vocabulary of a sequence x^{N} is the set consisting of all tuples. If a tuple x_{i}^{j} does not belong to the vocabulary of a proper prefix of x^{N}, it is called an eigenword. The eigenvalue of a sequence equals the total number of eigenwords. The eigenvalue profile of x^{N} is the integer-valued sequence determined by k(y^{i}), i = 1, 2,…, N.

Consider a binary sequence x^{6} = 010110. The vocabulary of this sequence is {0, 1, 01, 10, 11, 010, 101, 011, 110, 0101, 1011, 0110, 01011, 10110, 010110}. The eigenwords set is {110, 0110, 10110, 010110}. Hence, the eigenvalue of x^{6} is 4, and the eigenvalue profile of x^{6} is 122244.

Based on the definition of the eigenvalue that we have, the eigenvalue of x^{N} equals to k if, and only if, the following two conditions hold.

- (1)
- The tuple x
_{k}_{−1}x_{k}…x_{N}_{−1}does not belong to the vocabulary of a proper prefix of y^{N}. - (2)
- The tuple x
_{k}x_{k}_{+1}…x_{N}_{−1}belongs to the vocabulary of a proper prefix of y^{N}.

Obviously, the definition of the eigenvalue is available for binary sequences, and can be extended to finite symbol sequences at most. However, the chaotic signals are defined on the real number domain, which cannot be measured by this index. Therefore, extending the eigenvalue measure to the real number domain is beneficial to chaos-based cryptography and many other aspects as well.

As we know, the eigenvalue measures the rate of growth of its vocabulary of a sequence. However, strictly speaking, for a real random or chaotic sequence, there will not exist a tuple that occurs more than once. Thus, we cannot judge a tuple based on whether it belongs or does not belong to the vocabulary of a proper prefix.

In the real number field, the Euclidean distance is always used to judge whether two points are close or not. Furthermore, in the dynamics analysis, many measures are based on the Euclidean distance, such as the Lyapunov exponent, Kolmogorov entropy, and embedding dimension. Therefore, in this paper, we used the Euclidean distance d to judge whether the new generated signal was repeated or not. Assume that the sequence y^{N} = y_{0}y_{1}y_{2}…y_{N}_{−1} is a sequence in the real domain, y_{i}∈**R**. The state y_{j} is regarded to be identical with y_{i} if |y_{j} − y_{i}| < d, where i < j, x_{i} is a state in the prefix y_{0}^{j}. d is defined as the undifferentiated distance that is used to judge whether two real numbers can be regarded as the same. On this basis, we can judge whether the tuple in a sequence belongs to the vocabulary of a proper prefix or not, and whether the eigenvalue can be used in the real number sequences.

Consider a random real number sequence x^{N} = x_{0}x_{1}x_{2}…x_{N}_{−1}, where x_{i}∈(a, b). Assume that the distribution function of this sequence is p(x). The probability P(d) of the distance of two states x_{i} and x_{j}, being larger than d, can be calculated as

$$\begin{array}{c}P(d)=P(\left|x-y\right|>d)={\displaystyle {\int}_{a}^{a+d}p(x){\displaystyle \underset{x+d}{\overset{b}{\int}}p(y)dydx}+}{\displaystyle {\int}_{b-d}^{b}p(x){\displaystyle \underset{a}{\overset{x-d}{\int}}p(y)dydx}}\\ +{\displaystyle {\int}_{a+d}^{b-d}p(x)\left({\displaystyle \underset{a}{\overset{x-d}{\int}}p(y)dy+{\displaystyle \underset{x+d}{\overset{b}{\int}}p(y)dy}}\right)dx}\end{array}$$

As shown in Equation (1), the probability P(d) can be calculated as the sum of three probabilities. One is the probability of x_{i}∈(a, a+d) and x_{j}∈(x_{i}+d, b); one is the probability of x_{i}∈(b-d, b) and x_{j}∈(a, x_{j}-d); and one is the probability of x_{i}∈(a+d, b-d) and x_{j}∈(a, x_{i}-d) or (x_{i}+d, b). Obviously, the probability P(d) is influenced by the undifferentiated distance d. The states x_{i} and x_{j} in the sequence are regarded to be identical with the probability 1-P(d). Thus, the probability of tuple x_{i}x_{i}_{+1}…x_{N}_{−1} belongs to the vocabulary M of its proper prefix, which can be written as

$$P\left({x}_{i}{x}_{i+1}\dots {x}_{N-1}\in M\right)=1-{\left(1-{\left(1-P\left(d\right)\right)}^{N-i}\right)}^{i}$$

According to conditions (1) and (2), the probability of k(x^{N}) = k can be written as

$$\begin{array}{ll}P\left(k({y}^{N})=k\right)& =P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\in M,{x}_{k-1}{x}_{k}\dots {x}_{N-1}\notin M\right)\\ & =1-P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\in M,{x}_{k-1}{x}_{k}\dots {x}_{N-1}\in M\right)\\ & \text{}-P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\notin M,{x}_{k-1}{x}_{k}\dots {x}_{N-1}\in M\right)\\ & \text{}-P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\notin M,{x}_{k-1}{x}_{k}\dots {x}_{N-1}\notin M\right)\end{array}$$

As we know, if the tuple x_{k}_{−1}x_{k}…x_{N}_{−1}∈M, the tuple x_{k}x_{k}_{+1}…x_{N}_{−1} must belong to M as well. Thus, we have

$$P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\in M,{x}_{k-1}{x}_{k}\dots {x}_{N-1}\in M\right)=P\left({x}_{k-1}{x}_{k}\dots {x}_{N-1}\in M\right)$$

$$P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\notin M,{x}_{k-1}{x}_{k}\dots {x}_{N-1}\in M\right)=0$$

Furthermore, once the tuple x_{k}x_{k}_{+1}…x_{N}_{−1} does not belong to M, the tuple x_{k}_{−1}x_{k}…x_{N}_{−1} will not belong to M either. Thus, we have

$$P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\notin M,{x}_{k-1}{x}_{k}\dots {x}_{N-1}\notin M\right)=P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\notin M\right)$$

According to Equations (4)–(6), Equation (3) can be simplified as

$$\begin{array}{ll}P\left(k({y}^{N})=k\right)& =1-P\left({x}_{k-1}{x}_{k}\dots {x}_{N-1}\in M\right)-0-P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\notin M\right)\\ & =P\left({x}_{k}{x}_{k+1}\dots {x}_{N-1}\in M\right)-P\left({x}_{k-1}{x}_{k}\dots {x}_{N-1}\in M\right)\end{array}$$

When Equation (2) is put into Equation (7), the probability of k(x^{N}) = k can be written as

$$P\left(k({y}^{N})=k,d\right)={\left(1-{\left(1-P\left(d\right)\right)}^{N-k+1}\right)}^{k-1}-{\left(1-{\left(1-P\left(d\right)\right)}^{N-k}\right)}^{k}$$

Based on Equation (8), the expectation and variance of the eigenvalue of the real number random sequence x^{N} can be written as
and
respectively.

$$\begin{array}{ll}E\left(k({x}^{N}),d\right)={\displaystyle \sum _{k=1}^{N}k\cdot P\left(k({x}^{N})=k\right)}=& {\displaystyle \sum _{k=1}^{N}k\left({\left(1-{\left(1-P\left(d\right)\right)}^{N-k+1}\right)}^{k-1}-{\left(1-{\left(1-P\left(d\right)\right)}^{N-k}\right)}^{k}\right)}\\ & =1+{\displaystyle \sum _{k=1}^{N-1}{\left(1-{\left(1-P(d)\right)}^{N-k}\right)}^{k}}\end{array}$$

$$D\left(k\left({x}^{N}\right),d\right)={\displaystyle \sum _{k=1}^{N}{\left(k-E\left(k\left({x}^{N}\right),d\right)\right)}^{2}}\cdot P\left(k({x}^{N})=k,d\right)$$

Next, we use the extended eigenvalue to measure the complexity of uniformly distributed random sequences and logistic chaotic sequences.

Consider a uniformly distributed random sequence, whose distributed function is

$$f\left(x\right)=\frac{1}{b-a},\hspace{1em}a<x<b$$

Without loss of generality, we can limit the region from (a, b) into (0, 1). The corresponding distributed function is f(x) = 1, 0 < x < 1. When the distribution function is brought into Equation (1), we have

$$P(d)=P(\left|x-y\right|>d)={d}^{2}-2d+1$$

Therefore, the probability of k(x^{N}) = k can be depicted as

$$P\left(k({y}^{N})=k,d\right)={\left(1-{\left(2d-{d}^{2}\right)}^{N-k+1}\right)}^{k-1}-{\left(1-{\left(2d-{d}^{2}\right)}^{N-k}\right)}^{k}$$

In order to have a more intuitive understanding, the probability distribution of the eigenvalue is depicted in Figure 1 with different undifferentiated distances. The length N is set to be 1000.

In Figure 1, we can see that most of the sequences’ eigenvalue are located in a relatively narrow interval. Obviously, with different distances d, the probabilities of k(x^{N}) = k are different. The peak will move left with the growth of d, and the peak value will be gradually decreased. Thus, to evaluate the eigenvalue of a real number sequence, the choice of distance d is crucial. Consider that [9] has studied the eigenvalue probability of n-symbols’ random sequences with uniformly distributed sequences. In order to keep consistency, we should choose 2d − d^{2} = 1/n, and then the distance d should be chosen by

$$d=1-\sqrt{1-1/n}$$

Therefore, we can compare with the eigenvalue of binary random sequence by choosing d = 0.2929, and we can compare with the eigenvalue of 3-symbols random sequence by choosing d = 0.1835, and we can compare with the eigenvalue of 4-symbols random sequence by choosing d = 0.1340, etc.

Based on the distribution of eigenvalues, the expectation of the eigenvalue for random real number sequences can be approximately calculated as
for moderate–large N. Set N = 10,000, a uniformly distributed random sequence is randomly generated. Figure 2 shows the eigenvalue of this sequence. In Figure 2, we can see that all the numerical results are near the theoretical curve we derived in Equation (15), which indicates that the expectation of eigenvalue of random real number sequences is correct.

$$\begin{array}{ll}E\left(k({x}^{N}),d\right)& ={\displaystyle \sum _{k=1}^{N}k\cdot P\left(k({x}^{N})=k,d\right)}\\ & ={\displaystyle \sum _{k=1}^{N}k\left({\left(1-{\left(2d-{d}^{2}\right)}^{N-k+1}\right)}^{k-1}-{\left(1-{\left(2d-{d}^{2}\right)}^{N-k}\right)}^{k}\right)}\\ & =1+{\displaystyle \sum _{k=1}^{N-1}{\left(1-{\left(2d-{d}^{2}\right)}^{N-k}\right)}^{k}}\\ & \approx N{-\mathrm{log}}_{1/(2d-{d}^{2})}N\end{array}$$

Based on Equation (10), the variance of the eigenvalue of random real number sequences can be approximately written as

$$D\left(k\left({x}^{N}\right),d\right)={\displaystyle \sum _{k=1}^{N}{\left(k-N+{\mathrm{log}}_{1/(2d-{d}^{2})}N\right)}^{2}}\cdot P\left(k({x}^{N})=k,d\right)$$

Set length N from 1000 to 50,000. Figure 3 shows that for different distances d, the variances of the eigenvalue are all quite stable with the growth of length N.

Consider the following logistic chaotic map,
where y_{i}∈(−1, 1) is the state variable. For an initial condition y_{0}, we can generate a chaotic sequence y_{0}y_{1}…y_{n s} according to the iteration. The distribution function of Equation (17) is [22]

$${y}_{i+1}=1-2{y}_{i}^{2}$$

$$f(y)=\frac{1}{\pi \sqrt{1-{y}^{2}}},\hspace{1em}-1\le y\le 1$$

According to Equation (1), the probability P(d) of the distance of two states, y_{i} and y_{j}, is larger than d and can be calculated as

$$\begin{array}{ll}P(d)={\int}_{-1}^{-1+d}f({y}_{i})& {\displaystyle \underset{x+d}{\overset{1}{\int}}f({y}_{j})d{y}_{j}d{y}_{i}}+{\displaystyle {\int}_{1-d}^{1}f({y}_{i}){\displaystyle \underset{-1}{\overset{x-d}{\int}}f({y}_{j})d{y}_{j}d{y}_{i}}}\\ & +{\displaystyle {\int}_{-1+d}^{1-d}f({y}_{i})\left({\displaystyle \underset{-1}{\overset{x-d}{\int}}f({y}_{j})d{y}_{j}+{\displaystyle \underset{x+d}{\overset{1}{\int}}f({y}_{j})d{y}_{j}}}\right)d{y}_{i}}\\ & =\frac{1}{4}+\frac{\mathrm{arcsin}(1-d)}{\pi}+\frac{{\mathrm{arcsin}}^{2}(1-d)}{{\pi}^{2}}\end{array}$$

When Equation (19) is brought into Equation (8), the probability of k(x^{N}) = k for the logistic chaotic sequence can be easily calculated. Figure 4 depicts the probability distribution of the eigenvalue of logistic chaotic sequences with different d values. In Figure 4, we can see that, as with random sequences, the eigenvalue are also located in a relatively narrow interval, and the peak will move left with the growth of d. The peak value will gradually be decreased as well.

Based on Equation (9), the expectation of the eigenvalue of the logistic chaotic sequence can be written as
for moderate–large N. When we randomly select an initial condition, Figure 5 shows the eigenvalue of this generated logistic sequence. Obviously, the eigenvalues of this sequence are all around the theoretical curve we derived in Equation (20).

$$\begin{array}{ll}E\left(k({x}^{N}),d\right)& ={\displaystyle \sum _{k=1}^{N}k\cdot P\left(k({x}^{N})=k,d\right)}\\ & ={\displaystyle \sum _{k=1}^{N}k\left(\begin{array}{l}{\left(1-{\left(\frac{3}{4}-\frac{\mathrm{arcsin}(1-d)}{\pi}-\frac{{\mathrm{arcsin}}^{2}(1-d)}{{\pi}^{2}}\right)}^{N-k+1}\right)}^{k-1}\\ -{\left(1-{\left(\frac{3}{4}-\frac{\mathrm{arcsin}(1-d)}{\pi}-\frac{{\mathrm{arcsin}}^{2}(1-d)}{{\pi}^{2}}\right)}^{N-k}\right)}^{k}\end{array}\right)}\\ & =1+{\displaystyle \sum _{k=1}^{N-1}{\left(1-{\left(\frac{3}{4}-\frac{\mathrm{arcsin}(1-d)}{\pi}-\frac{{\mathrm{arcsin}}^{2}(1-d)}{{\pi}^{2}}\right)}^{N-k}\right)}^{k}}\\ & \approx N{-\mathrm{log}}_{4{\pi}^{2}/(3{\pi}^{2}-4\pi \mathrm{arcsin}(1-d)-4{\mathrm{arcsin}}^{2}(1-d))}N\end{array}$$

Figure 6 depicts the comparison of the expectation of the eigenvalue of logistic sequences and uniformly distributed random sequences under the same undifferentiated distance d = 0.1. In Figure 6, we can see that there are almost no differences among the expectation eigenvalue of the logistic sequences and random sequences. After enlarging, we can see that the eigenvalue of logistic sequences is just a little lower than the random sequence, which implies that the logistic sequence cannot be regarded as a perfect random sequence in this sense. For other undifferentiated distances, the results are similar. Therefore, we omit them here to avoid redundancy.

Correspondingly, the variance of the eigenvalue of logistic sequences can be approximately written as

$$D\left(k\left({x}^{N}\right),d\right)={\displaystyle \sum _{k=1}^{N}{\left(k-N+{\mathrm{log}}_{4{\pi}^{2}/(3{\pi}^{2}-4\pi \mathrm{arcsin}(1-d)-4{\mathrm{arcsin}}^{2}(1-d))}N\right)}^{2}}\cdot P\left(k({x}^{N})=k,d\right)$$

The variances of the eigenvalue of logistic sequences with different distances d are depicted in Figure 7. This figure indicates that for every distance, the eigenvalue of logistic sequences are all stable with the growth of length N.

With the extension of eigenvalue, we can use this complexity measure to evaluate the cryptographic characteristics of different chaotic sequences. Here, the following four kinds of 1-D chaotic sequences are generated and compared.

- Chebyshev mapChebyshev map can be written as$${x}_{i+1}=\mathrm{cos}(a\cdot \mathrm{arccos}({x}_{i}))$$
_{i}∈(−1, 1) is the state variable, a is the control coefficient. The Chebyshev map will be chaotic since a≧2. In this test, we always set a = 3. - Sine mapSine map can be mathematically described as$${x}_{i+1}=r\mathrm{sin}(\pi {x}_{i})$$
- Tent mapTent map is a kind of piece-wise function, which can be described as$${x}_{i+1}=\{\begin{array}{ll}{x}_{i}/p,& {x}_{i}\in [0,p)\text{}\\ (1-{x}_{i})/(1-p),& {x}_{i}\in [p,1]\end{array}$$
- Logistic mapThe Logistic map has already been described in Equation (17), which we omitted here to avoid redundancy.

Since the state variables of these four maps are in different domains, for consistency, we first compressed them to the identical interval (0, 1). When d = 0.1, the eigenvalue of these four kinds of chaotic sequences are depicted in Figure 8. Figure 8 shows that the chaotic sequences generated by the sine map have the largest eigenvalue, whereas the chaotic sequences generated by the Tent map have the lowest eigenvalue. For other distances d, the results are similar.

Thus, it can be seen that with the extended eigenvalue, we can evaluate the cryptographic complexity of real number sequences effectively. However, it should be noted that this result does not imply that the Sine map is better than other chaotic maps in cryptographic application. On the one hand, the eigenvalue is only one of the cryptographic complexity measures; on the other hand, the eigenvalue value is influenced by the control parameter of chaotic maps. For example, the eigenvalue of the Sine chaotic sequence will be lower than the eigenvalue of the Chebyshev chaotic sequence when r = 1.

In order to evaluate the cryptographic complexity of real number sequences, in this paper, we extended the so-called eigenvalue from the binary field to the real number field. The extended eigenvalue was influenced by the undifferentiated distance, and we gave an exact value of this distance corresponding to the N-symbol sequences. Both uniformly distributed random sequences and logistic sequences were used as examples. The probability distribution, expectation and variance of these two kinds of real number sequences were discussed both theoretically and experimentally. With the extension of eigenvalue, we could evaluate the cryptographic complexity of real number sequences, which has a great advantage for cryptographic usage, especially for chaos-based cryptography. Furthermore, four kinds of chaotic sequences were evaluated by this extended complexity measure, which indicates that our study is effective and of great interest.

Conceptualization, L.L.; Data curation, R.L.; Formal analysis, L.L. and H.X.; Funding acquisition, H.H., L.L.; Investigation, H.H.; Methodology, L.L.; Resources, L.L.; Supervision, L.L.

This research was funded by National Key R&D Program of China: 2017YFB0802000; National Natural Science Foundation of China: 61862042; 61601215; Postgraduate Innovation Project of Jiangxi Province: YC2019S101; Cryptography Theoretical Research of National Cryptography Development Fund: MMJJ20170109.

This work is supported by the National Natural Science Foundation of China (61862042, 61601215); Postgraduate Innovation Project of Jiangxi Province (YC2019S101); Cryptography Theoretical Research of National Cryptography Development Fund (MMJJ20170109).

The authors declare no conflict of interest.

- Massey, J.L.; Serconek, S. A Fourier transform approach to the linear complexity of nonlinearly filtered sequences. In Annual International Cryptology Conference; Springer: Berlin/Heidelberg, Germany, 1994; pp. 332–340. [Google Scholar]
- Kolokotronis, N.; Kalouptsidis, N. On the linear complexity of nonlinearly filtered PN-sequences. IEEE Trans. Inf. Theory
**2003**, 49, 3047–3059. [Google Scholar] [CrossRef] - Limniotis, K.; Kolokotronis, N.; Kalouptsidis, N. New results on the linear complexity of binary sequences. In 2006 IEEE International Symposium on Information Theory; IEEE: New York, NY, USA, 2006; pp. 2003–2007. [Google Scholar]
- Erdmann, D.; Murphy, S. An approximate distribution for the maximum order complexity. Des. Codes. Cryptogr.
**1997**, 10, 325–339. [Google Scholar] [CrossRef] - Rizomiliotis, P. Constructing periodic binary sequences of maximum nonlinear span. IEEE Trans. Inf. Theory
**2006**, 52, 4257–4261. [Google Scholar] [CrossRef] - Rizomiliotis, P.; Kolokotronis, N.; Kalouptsidis, N. On the quadratic span of binary sequences. IEEE Trans. Inf. Theory
**2005**, 51, 1840–1848. [Google Scholar] [CrossRef] - Lempel, A.; Ziv, J. On the complexity of finite sequences. IEEE Trans. Inf. Theory
**1976**, 22, 75–81. [Google Scholar] [CrossRef] - Limniotis, K.; Kolokotronis, N.; Kalouptsidis, N. On the nonlinear complexity and Lempel-Ziv complexity of finite length sequences. IEEE Trans. Inf. Theory
**2007**, 53, 4293–4302. [Google Scholar] [CrossRef] - Liu, L.; Miao, S.; Hu, H.; Deng, Y. On the Eigenvlaue and Shannon’s Entropy of Finite Length Random Sequences. Complexity
**2015**, 21, 154–161. [Google Scholar] [CrossRef] - Liu, L.; Miao, S.; Liu, B. On nonlinear complexity and Shannon’s entropy of finite length random sequences. Entropy
**2015**, 17, 1936–1945. [Google Scholar] [CrossRef] - Tosun, P.; Abásolo, D.; Stenson, G.; Winsky-Sommerer, R. Characterisation of the effects of sleep deprivation on the electroencephalogram using permutation Lempel-Ziv complexity, a non-linear analysis tool. Entropy
**2017**, 19, 673. [Google Scholar] [CrossRef] - Peng, J.; Zeng, X.; Sun, Z. Finite length sequences with large nonlinear complexity. Adv. Math. Commun.
**2018**, 12, 215–230. [Google Scholar] [CrossRef] - Li, P.; Wang, Y.C.; Wang, A.B.; Wang, B.J. Fast and tunable all-optical physical random number generator based on direct quantization of chaotic self-pulsations in two-section. IEEE J. Sel. Top. Quantum Electron.
**2013**, 19, 0600208. [Google Scholar] - Li, R.; Liu, Q.; Liu, L. Novel image encryption algorithm based on improved logistic map. IET Image Process.
**2019**, 13, 125–134. [Google Scholar] [CrossRef] - Huang, X.; Liu, L.; Li, X.; Yu, M.; Wu, Z. A new pseudorandom bit generator based on mixing three-dimensional Chen chaotic system with a chaotic tactics. Complexity
**2019**, 2019, 6567198. [Google Scholar] [CrossRef] - Kanso, A.; Smaoui, N. Logistic chaotic maps for binary numbers generations. Chaos Solitons Fract.
**2009**, 40, 2557–2568. [Google Scholar] [CrossRef] - Larger, L.; Dudley, J.M. Optoelectronic chaos. Nature
**2010**, 465, 41–42. [Google Scholar] [CrossRef] [PubMed] - Bahi, J.M.; Fang, X.; Guyeux, C.; Wang, Q. On the design of a family of CI pseudo-random number generators. In Proceedings of the 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing, Wuhan, China, 23–25 September 2011; pp. 1–4. [Google Scholar]
- Masuda, N.; Aihara, K. Cryptosystems with discretized chaotic maps. IEEE Trans Circuits Syst. I
**2002**, 49, 28–40. [Google Scholar] [CrossRef] - Li, P.; Wang, Y.C.; Wang, A.B.; Yang, L.Z.; Zhang, M.J.; Zhang, J.Z. Direct generation of all-optical random numbers from optical pulse amplitude chaos. Opt. Express
**2012**, 20, 4297–4308. [Google Scholar] [CrossRef] [PubMed] - Kocarev, L. Chaos-based cryptography: A brief overview. IEEE Circ. Syst. Mag.
**2001**, 1, 6–21. [Google Scholar] [CrossRef] - Liu, L.; Miao, S.; Hu, H.; Cheng, M. N-phase Logistic chaotic sequence and its application for image encryption. IET Signal Process.
**2016**, 10, 1096–1104. [Google Scholar] [CrossRef]

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).