Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 769108, 10 pages
http://dx.doi.org/10.1155/2013/769108
Research Article

Study of a New Chaotic Dynamical System and Its Usage in a Novel Pseudorandom Bit Generator

1IT&C Department, Lumina-The University of South-East Europe, 021187 Bucharest, Romania
2Faculty of Informatics, University “Titu Maiorescu”, 0400511 Bucharest, Romania
3ETTI Faculty, University Politehnica of Bucharest, 061071 Bucharest, Romania

Received 8 July 2013; Revised 14 September 2013; Accepted 16 September 2013

Academic Editor: Zhan Shu

Copyright © 2013 Ana-Cristina Dăscălescu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

A new chaotic discrete dynamical system, built on trigonometric functions, is proposed. With intent to use this system within cryptographic applications, we proved with the aid of specific tools from chaos theory (e.g., Lyapunov exponent, attractor’s fractal dimension, and Kolmogorov-Smirnov test) and statistics (e.g., NIST suite of tests) that the newly proposed dynamical system has a chaotic behavior, for a large parameter’s value space, and very good statistical properties, respectively. Further, the proposed chaotic dynamical system is used, in conjunction with a binary operation, in the designing of a new pseudorandom bit generator (PRBG) model. The PRBG is subjected, by turns, to an assessment of statistical properties. Theoretical and practical arguments, rounded by good statistical results, confirm viability of the proposed chaotic dynamical system and newly designed PRBG, recommending them for usage within cryptographic applications.

1. Introduction

Nowadays, more and more, it appears that skilful genesis of chaos turns out to be a key issue in many technological application fields such as engineering, medicine, communications, information storage, and, with particular importance, cryptography [16].

Designing of dynamical systems, intended to be used as base of cryptosystems, must be done so as to ensure the use of a set of associated control parameters’ values that leads to chaos [711]. Moreover, the ergodic [1215] and randomness properties [1619] must be confirmed, as a certainty of high security level of the chaotic dynamical system.

Since 1963, when Lorenz found the first chaotic attractor in a three-dimensional autonomous system while studying atmospheric convection [20], chaotification became a very attractive subject, leading to the development of new chaotic dynamic systems, for example, [2125], and new chaos-based PRBGs, for example, [2630], whose properties have been analyzed extensively and thoroughly in research or review articles and books, for example, [3136].

Motivated by the extent of previous work, the present paper aims to present a new chaotic discrete dynamical system which, furthermore, may be included in the wide family of PRBGs through a simple, interesting, and yet complex new PRBG model, based on binary operation.

The rest of this paper is organized as follows. Section 2 presents the design of newly proposed dynamical system, including its chaotic behavior assessment (as a first step in system’s evaluation process to establish its suitability within any cryptographic application). Section 3 showcases the detailed and comprehensive randomness’ testing process of sequences generated by the new chaotic dynamical system (as a second step in system’s evaluation process to establish its suitability within any cryptographic application). Section 4 presents the designing of a new PRBG scheme (based on binary operation, which uses previously designed and tested chaotic dynamical system), including the results of analysis performed using NIST suite in order to test the randomness and uniformity of values generated by the new PRBG. Finally, Section 5 concludes the work carried out.

2. Proposed Discrete Dynamical System and Its Basic Properties

Newly dynamical system introduced in paper uses (1) [37, 38] as model for chaos generation. Here, whilst represents a periodic real map (selected so as to ensure a large phase space), represents a bounded real map (which, by an appropriate selection, restricts the phase space to a closed interval in which the dynamical system has good chaotic properties):

Therefore, the newly proposed one-dimensional discreet dynamic system, which is defined with respect to form (1), is given by (2) or (and), in a more detailed design, by (3). Here, represents the control parameter of the resulted chaotic map, while arctg (i.e., arctangent function), and ctg (i.e., cotangent function), respectively, were chosen with respect to the above affirmations (i.e., the first one restricts the phase space to a close interval in which the dynamical system has good chaotic properties, while the second one ensures a large phase space):

In the following, dynamical behavior of newly proposed chaotic system is investigated, by both theoretical analysis and numerical simulation (e.g., by means of Lyapunov exponent, attractor’s geometric shape and fractal structure, and system’s ergodicity, i.e., Kolmogorov-Smirnov tests, etc.).

2.1. Sensitivity Level to Initial Conditions

The behavior of the proposed discrete dynamic system (3), in terms of its evolution over time domain, depends on both the control parameter and the initial condition . First of all, we propose stability analysis of fixed points in order to assess system’s sensitivity level to initial conditions.

map’s fixed points are given by (4), and, according to the theorem of fixed points [39], points are attractors if condition (5) is fulfilled, that is, if the control parameter meets condition (6). Thus, taking into account the fact that map is defined on the interval , there exists only one fixed point, that is, (7), which is also an attractor:

From the above equations, it can be noticed that for any , all trajectories that start at initial point converge, in time, to the attractor point ; for any , fixed point loses its stability, and other instable fixed points appear. The aforementioned statements are also substantiated by the bifurcation diagram, namely, the one showcased in Figure 1(a), which emphasizes the stability of s fixed points (i.e., for any values of parameter , close to , has an instable behavior, and for any values of the parameter , higher than , the map enters into a complete chaotic regime). The road to chaos of the map, with , is not achieved through doubling process of the period, specific to some chaotic maps, but is induced by existence of a dense set of periodic orbits, whose periods are in the interval. Another tool used to assess s sensitivity to the initial conditions is the Lyapunov exponent (8) and, taking into consideration the fact that orbit is chaotic if this exponent is positive, (9) is derived (which is equivalent to , meaning that for any s orbits are chaotic). Lyapunov exponent, numerically computed [40] with respect to the parameter within () interval, is shown in Figure 1(b). Consider

fig1
Figure 1: Bifurcation diagram of map (a) and Lyapunov exponent of map (b).
2.2. Attractor’s Geometric Shape and Fractal Structure

Analysis of dynamical system’s attractor’s shape can provide meaningful information about system behavior in time, for certain values of its parameters. The attractor of a dynamical system with a periodic behavior has a regular shape, while the one corresponding to a chaotic dynamical system has a complex structure, of fractal type, called strange attractor [39].

Figure 2 showcases ’s attractor, for , where it can be observed that its shape is irregular, of fractal type, and complex shaped, in comparison with ones of, for example, tent or logistic maps (i.e., whose attractors exhibit a regular shape, i.e., triangle, resp., hyperbola shaped).

769108.fig.002
Figure 2: Attractor of map, for .

Fractal structure of an attractor is indicated by a fractional value of its fractal dimension, which is a ratio that provides a statistical index of complexity comparing how in detail a pattern changes with the scale at which it is measured or, alternatively, by a measure of the space-filling capacity of a pattern, telling how a fractal scale is different than the space in which it is embedded. There are several types of fractal dimensions, which can be theoretically and empirically estimated, such as Hausdorff dimension, Minkowski-Bouligand dimension, box-counting dimension, information dimension, and correlation dimension [4144]. Using plots from Figure 3, we established that the attractor of the map has a box-counting dimension = 0.97863 and a correlation dimension = 0.97064. Fractional values, of fractal dimensions previously estimated, allow us to conclude that the proposed map has a strange attractor which, by turns, indicates a chaotic behavior.

fig3
Figure 3: ’s attractor’s fractal dimensions: box-counting dimension (a) and correlation dimension (b).
2.3. System’s Ergodicity

In this subsection, using Birkhoff’s theorem [5, 45] in conjunction with Kolmogorov-Smirnov test [46, 47], we intend to prove that the proposed dynamical system is ergodic for (i.e., long-term behavior of ’s orbits is independent from the initial condition, and thus it may be subjected to a battery of statistical tests).

The Kolmogorov-Smirnov test is applied on two amounts of independent data and , corresponding to the measurements of two random variables and . Random variable is obtained through an -times iteration of map, for a fixed parameter and for a fixed initial condition (namely, and ). Second random variable, that is, , is obtained by selecting, at time , the values generated by orbits of the map, arising from initial seeding points (belonging to interval) and same parameter (previously fixed). Moment is chosen from ’s stationary zone, previously established using Kolmogorov-Smirnov test, as described in [46, 47].

Due to the fact that the random values and correspond to time average of and space average, respectively, the purpose of the test is to establish if the two experimental data sets derive from populations with the same distribution or not, with respect to Birkhoff’s theorem. The analysis is based on distribution functions and , associated with the experimental independent data sets and .

Kolmogorov-Smirnov test is applied as follows:(1)the maximum absolute difference between the two distribution functions is computed: (2)for a significance level , is computed ( representing probability law’s quantile, for the random value ); that is, , (3)in case of , the hypothesis is accepted (i.e., the two random variables and have the same probability law; in other words, if the absolute maximum distance between the two distribution functions and is lower than a certain accepted value , then it will be decided that the two random variables and have the same probability law); otherwise the test rejects hypothesis (i.e., for the chosen level, the two sets of experimental data come from random values with different probability laws).

Kolmogorov-Smirnov test was performed over a sequence of samples, with a significance level set to ; the decision regarding system’s ergodicity is based on Monte Carlo analysis (i.e., evaluating Kolmogorov-Smirnov test’s ability to accept bad data as good data). The above experiment was repeated 500 times; at the end of each round, hypothesis’s acceptance proportion (which belongs to interval) was recorded.

Test’s overall results are summarized in Table 1. One can observe that in case of all values selected for parameter, with , the acceptance proportion of hypothesis lies within the confidence interval. Thus, ergodicity of the proposed dynamical system is confirmed (over the entire interval of interest, for parameter ).

tab1
Table 1: Results of ’s ergodicity property testing.

Based on numerical results previously obtained, using instruments from the chaos theory, we can conclude that map has a chaotic behavior, without intermittent scenarios, for any combination between the parameter and the initial seeding point .

The chaotic behavior is a necessary but not sufficient condition to allow usage of the proposed dynamic system within cryptographic applications. System’s security level, against some statistical cryptanalytic attacks, is assessed after a statistical analysis of the randomness of values generated. There are several options available for analyzing randomness of a newly developed pseudorandom bit generator (PRBG), as it will be revealed in the following section.

3. Randomness Analysis of the Proposed Chaotic Discrete Dynamical System

In order to assess PRBG’s statistical properties (i.e., its true randomness and implicit suitability within cryptographic applications; see e.g., [4852], etc.), different testing tools such as CrypTool and VRA (for basic statistical measures’ quantification), respectively NIST [53] and DIEHARD [54] standard tests batteries (for high end quantitative and qualitative assessment) were used. Operating methodology, for each of the above tests, and obtained results are presented and discussed in the following subsections.

Chaotic cryptography deals with real numbers, so, in order to proceed and apply the battery of the statistical tests aforementioned, we have to apply a computational method to transform a chaotic sequence of real numbers into a bitstream. The discretization method that we used consisted in the extraction of the fractional parts of the generated subunitary real numbers.

3.1. CrypTool Analysis

CrypTool was used to compute the occurrence frequencies of any binary substring, composed of symbols (i.e., the -grams), over the flow of bits generated with the proposed PRBG. For true random bitstreams, it is expected that each entry within the -gram has the same probability of occurrence. The -gram statistics were performed over 1.000 randomly chosen binary sequences, each sequence being generated using different initial seeding points and of bits in length; overall results are presented in Table 2.

tab2
Table 2: PRBG’s -gram reports.

It can be observed that the deviation from ideal value, of each -gram’s entry, is under 0.1%. Thus, PRBG’s -gram reports not only do not emphasize the dominant presence of any binary substring (i.e., in terms of frequency of use) [55, 56], but they also highlight a uniform system dynamics (i.e., in terms of the time evolution of ’s trajectories). Positive results obtained at this point guide us to perform the next statistical analysis.

3.2. Visual Recurrence Analysis

A RP (i.e., Recurrence Plot) holds important insights into the time evolution of ’s trajectories because typical patterns in RPs are linked to specific system behavior [57]. Yet, without proper settings of analysis’ parameters, any RP is just a simple image, completely devoid of information. Thus, to obtain as much information, suitable embedding dimension and adequate time delay must be chosen. With the aid of AMI (i.e., Average Mutual Information) and FNN (i.e., False Nearest Neighbors) toolboxes (included in VRA’s statistical test suite), these parameters can be correctly set to the optimal value [58]. AMI and FNN were performed on binary sequences, each of bits in length (generated with 100 randomly chosen seeds); corresponding graphs are presented in Figures 4(a) and 4(b), respectively. Analyzing the two graphs, first AMI minimum and Optimal Global Embedding Dimension (OGED) are found: time delay and embedding dimension . With these two parameters bitstream’s RPI (i.e., Recurrence Plot Image) is computed, as shown in Figure 4(c).

fig4
Figure 4: PRBG’s visual recurrence analysis: AMI graph (a), FNN graph (b), and recurrence plot (c).

Lack in clear patterns, within the RPI, indicates that consecutive samples in bitstream’s structure are much far apart and uncorrelated. More than that, RPI’s homogeneity along the major diagonal and its irregular distribution emphasizes a stationary, mostly stochastic behavior (i.e., intrinsically nondeterministic, nonintermittent, and sporadic), of the system that has generated the bitstream and, namely, a true random process (i.e., random binary strings).

VRA, through its embedded RQA (i.e., Recurrence Quantification Analysis) tool, also provides other additional measures (e.g., entropy, mean, percentage of recurrence and of determinism, etc.); some of them, the most important ones, are quantified in Table 3. One can notice that all the measures have values close to ideal [59].

tab3
Table 3: PRBG’s general statistics.

Despite the fact that skewness has a negative value (i.e., indicating that the tail on the left side of the probability density function is longer than the right side and the bulk of the values lie to the right of the mean), being close to zero indicates that the values are relatively evenly distributed on both sides of the mean, typically (but not necessarily) implying a symmetric distribution [60]. At the same time, Kurtosis’s high-level and negative value denotes a platykurtic distribution (i.e., data set with flatter peak around its mean, which causes thin tails within the distribution and low level of data fluctuation) [61].

Good general statistical properties revealed with the aid of VRA (either visually—evaluation of RPI’s structural properties or through different specific measures evaluation—RQA), highlights randomness of bitstreams generated using the proposed PRBG function, thus allowing advancement to other statistical test suites.

3.3. NIST Statistical Testing

For the numerical experimentations of the proposed pseudorandom bit generator, we have generated different binary sequences from 500 randomly chosen seeds, each sequence having a length of  bits, and we have computed the -value corresponding to each sequence for all the 15 tests of the NIST suite. The significance level of each test in NIST is set to , which means that of test samples pass the tests if the random numbers are truly random. The acceptance region of the passing ratio is given by (12), where represents the number of samples tested and is the probability of passing each test:

For and the probability (corresponding to the significance level ), we obtained the confidence interval . In the second column of Table 4, we have summarized the results obtained after applying nonparameterized and parameterized tests of the NIST suite on the binary sequences produced by the proposed pseudorandom bit generator. The computed proportion for each test lies inside the confidence interval. Hence, the tested binary sequences generated by the proposed PRBG are random with respect to all tests of NIST suite. If tested sequences are truly random, then -values are expected to appear uniform in the interval . NIST recommends to apply the -test in which the interval is divided into subintervals. Defining as number of occurrences of the -value in th interval, then the statistic is (13). NIST recommends setting its significance level to , so the acceptance region of statistics has the value. A -value that corresponds to uniformity of -values is calculated as in (14), so it must be greater than 0.0001 to ensure that the -values could be considered uniformly distributed. The results from the third column of Table 4 lead us to the conclusion that -values, for each statistical test, are uniformly distributed:

tab4
Table 4: NIST tests’ results.

The method to calculate the passing ratio of total test and the uniformity -value of total test samples follows the same methodology described above. In this case, we considered the number of samples , so the acceptance region is . For the passing ratio of the total test we obtained the value 0.988, and the -value corresponding to the uniformity of -values from the total test was 0.294808, so the proposed map has perfect cryptographic properties.

4. Proposed PRBG and Its Statistical Testing

Most chaos-based PRNGs (and, implicitly, their subsequent PRBGs) are based on a single chaotic system (e.g., [2529, 52]) and generate the random numbers (resp., the bitstreams) directly from its orbit. These types of PRNGs/PRBGs are potentially insecure, since the output values may expose some information about their underlying chaotic system [62]. To overcome this difficulty, a series of pseudorandom number (bit) generators based on a couple of chaotic system have been proposed (e.g., [6367]). In the following, we present a novel PRNG/PRBG model, based on two chaotic maps coupled using a binary operation.

We consider two one-dimensional chaotic maps (e.g., as the previously designed model, i.e., (3)) defined as follows: where , are the initial conditions, , are the control parameters, and , are the two orbits obtained by recurrences , , for any .

Also, we consider the binary operation given by the formula where .

The output of the proposed PRNG is obtained applying the binary operation (16) to the chaotic maps and defined by (15); thus, for any and is the seed of the proposed PRNG.

The real numbers obtained using the proposed PRNG were discretized extracting their fractional parts in order to apply the NIST statistical tests. For the numerical experimentations on the proposed pseudorandom numbers generator, we have generated 2.000 different binary sequences (sample size ). Each sequence, with one million bits in length, has been generated from a randomly chosen seed , and for each we computed the -value corresponding to the NIST tests. In Table 5 we have summarized the results obtained after implementing nonparameterized and parameterized tests of NIST suite on the binary sequences produced by the proposed pseudorandom numbers generator.

tab5
Table 5: NIST tests’ results.

It can be seen that the computed proportion for each test lies inside the confidence interval; hence, the tested binary sequences generated by the proposed PRBG are random with respect to all the 16 tests of NIST suite.

5. Conclusions

Development of new chaotic dynamic systems, which meet the current demands of security, is a present research direction in the field of cryptography. The main objective is to obtain a large key space, induced by the control parameter and (or) initial conditions, for which the dynamic system is in chaotic regime, is ergodic, and has a uniform distribution of the values generated.

With respect to the aforementioned ideas, in this paper we have designed a new one-dimensional chaotic dynamic system that meets these requirements.

Moreover, a larger key space than the one of the known chaotic maps (e.g., logistic, tent, Hénon, etc.) was achieved, and, despite the fact that the implementation of trigonometric maps is little slower than the ones of other kinds of maps (e.g., polynomial, exponential, etc.), we consider that the advantage of a larger key space induced by their usage is a good compromise (i.e., a win-win situation).

Using specific mathematical and numerical tools from chaos theory and statistics, we proved that the proposed chaotic dynamic system has very good cryptographic properties. The proposed map was used in a new innovative way to design a new PRNG/PRBG model, based on a well-known binary operation.

We have performed an exhaustive testing process of the randomness of the generated binary sequences using the NIST suite to prove the viability of the proposed PRNG/PRBG.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  1. M. S. Baptista, “Cryptography with chaos,” Physics Letters A, vol. 240, no. 1-2, pp. 50–54, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. L. Kocarev, G. Jakimoski, G. Stojanovski, and U. Parlitz, “From chaotic maps to encryption schemes,” in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS '98), vol. 4, pp. 514–517, Monterey, Calif, USA, May-June 1998.
  3. L. Kocarev, “Chaos-based cryptography: a brief overview,” IEEE Circuits and Systems Magazine, vol. 1, no. 3, pp. 6–21, 2001. View at Google Scholar
  4. F. Huang and Z. H. Guan, “Cryptosystem using chaotic keys,” Chaos, Solitons & Fractals, vol. 23, no. 3, pp. 851–855, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. A. Şerbănescu and C. I. Râncu, Systèmes et Signaux Face au Chaos: Applications aux Communications, Military Technical Academy Publishing House, Bucharest, Romania, 2008.
  6. L. Kocarev and S. Lian, Eds., Chaos-Based Cryptography: Theory, Algorithms and Applications, vol. 354 of Studies in Computational Intelligence, Springer, Berlin, Germany, 2011.
  7. D. Arroyo, G. Alvarez, S. Li, C. Li, and J. Nunez, “Cryptanalysis of a discrete-time synchronous chaotic encryption system,” Physics Letters A, vol. 372, no. 7, pp. 1034–1039, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. D. Arroyo, J. M. Amigó, S. Li, and G. Alvarez, “On the inadequacy of unimodal maps for cryptographic applications,” in 11 Reunión Española sobre Criptología y Securidad de la Información (RECSI '10), J. D. Ferrer, A. M. Ballesté, J. C. Roca, and A. S. Gómez, Eds., pp. 37–42, Universitat Rovira I Virgili, Tarragona, Spain, 2010.
  9. S. Li, X. Mou, B. L. Yang, Z. Ji, and J. Zhang, “Problems with a probabilistic encryption scheme based on chaotic systems,” International Journal of Bifurcation and Chaos, vol. 13, no. 10, pp. 3063–3077, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. S. Li, X. Mou, Y. Cai, Z. Ji, and J. Zhang, “On the security of a chaotic encryption scheme: problems with computerized chaos in finite computing precision,” Computer Physics Communications, vol. 153, no. 1, pp. 52–58, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. G. Alvarez and S. Li, “Some basic cryptographic requirements for chaos-based cryptosystems,” International Journal of Bifurcation and Chaos, vol. 16, no. 8, pp. 2129–2151, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. J.-P. Eckmann and D. Ruelle, “Ergodic theory of chaos and strange attractors,” Reviews of Modern Physics, vol. 57, no. 3, part 1, pp. 617–656, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. L.-S. Young, “Ergodic theory of chaotic dynamical systems,” in From Topology to Computation: Proceedings of the Smalefest, pp. 201–226, Springer, New York, NY, USA, 1993. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. G. Álvarez, F. Montoya, M. Romera, and G. Pastor, “Cryptanalysis of an ergodic chaotic cipher,” Physics Letters A, vol. 311, no. 2-3, pp. 172–179, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. R. M. Gray, Probability, Random Processes, and Ergodic Properties, Springer, New York, NY, USA, 2010. View at MathSciNet
  16. L. M. Berliner, “Statistics, probability and chaos,” Statistical Science, vol. 7, no. 1, pp. 69–90, 1992. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. F. James, “Chaos and randomness,” Chaos, Solitons & Fractals, vol. 6, pp. 221–226, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. J. A. González, L. I. Reyes, J. J. Suárez, L. E. Guerrero, and G. Gutiérrez, “Chaos-induced true randomness,” Physica A, vol. 316, pp. 259–288, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. R. Lozi, “Emergence of randomness from chaos,” International Journal of Bifurcation and Chaos, vol. 22, no. 2, Article ID 1250021, 15 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. E. N. Lorenz, “Deterministic nonperiodic flow,” Journal of the Atmospheric Science, vol. 20, no. 2, pp. 130–141, 1963. View at Publisher · View at Google Scholar
  21. C. Zhang, W. K. S. Tang, and S. Yu, “A new chaotic system based on multiple-angle sinusoidal function: design and implementation,” International Journal of Bifurcation and Chaos, vol. 19, no. 6, pp. 2073–2084, 2009. View at Publisher · View at Google Scholar
  22. J. Lü and G. Chen, “A new chaotic attractor coined,” International Journal of Bifurcation and Chaos, vol. 12, no. 3, pp. 659–661, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. C. Liu, T. Liu, L. Liu, and K. Liu, “A new chaotic attractor,” Chaos, Solitons & Fractals, vol. 22, no. 5, pp. 1031–1038, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. G. Qi, G. Chen, S. Du, Z. Chen, and Z. Yuan, “Analysis of a new chaotic system,” Physica A, vol. 352, no. 2, pp. 295–308, 2005. View at Publisher · View at Google Scholar
  25. X. Zhao, F. Jiang, Z. Zhang, and J. Hu, “A new series of three-dimensional chaotic systems with cross-product nonlinearities and their switching,” Journal of Applied Mathematics, vol. 2013, Article ID 590421, 14 pages, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. A. Luca, A. Ilyas, and A. Vlad, “Generating random binary sequences using tent map,” in Proceedings of the 10th International Symposium on Signals, Circuits and Systems (ISSCS ’11), pp. 1–4, Iaşi, Romania, June-July 2011.
  27. N. K. Pareek, V. Patidar, and K. K. Sud, “A random bit generator using chaotic maps,” International Journal of Network Security, vol. 10, no. 1, pp. 32–38, 2010. View at Google Scholar
  28. Q. Zhou, X. Liao, K. W. Wong, Y. Hu, and D. Xiao, “True random number generator based on mouse movement and chaotic hash function,” Information Sciences, vol. 179, no. 19, pp. 3442–3450, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  29. X. Y. Wang and Y. X. Xie, “A design of pseudo-random bit generator based on single chaotic system,” International Journal of Modern Physics, vol. 23, no. 3, 2012. View at Google Scholar
  30. A. Kanso and N. Smaoui, “Logistic chaotic maps for binary numbers generation,” Chaos, Solitons & Fractals, vol. 40, no. 5, pp. 2557–2568, 2009. View at Publisher · View at Google Scholar
  31. R. Gilmore, “Topological analysis of chaotic dynamical systems,” Reviews of Modern Physics, vol. 70, no. 4, pp. 1455–1529, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. Y.-C. Lai and N. Ye, “Recent developments in chaotic time series analysis,” International Journal of Bifurcation and Chaos, vol. 13, no. 6, pp. 1383–1422, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  33. W. Ditto and T. Munakata, “Principles and applications of chaotic systems,” Communication of the ACM, vol. 38, no. 11, pp. 96–102, 1995. View at Google Scholar
  34. J. C. Sprott, Chaos and Time-Series Analysis, Oxford University Press, New York, NY, USA, 2003. View at MathSciNet
  35. Z. Liu, “Chaotic time series analysis,” Mathematical Problems in Engineering, vol. 2010, Article ID 720190, 31 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  36. M. Li, “Fractal time series—a tutorial review,” Mathematical Problems in Engineering, vol. 2010, Article ID 157264, 26 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  37. Z. Kotulski, J. Szczepanski, K. Górski, A. Górska, and A. Paszkiewicz, “On constructive approach to chaotic pseudorandom number generators,” in Proceedings of the Regional Conference on Military Communication and Information Systems, vol. 1, pp. 191–203, 2000.
  38. Q. Z. Xu, S. B. Dai, W. J. Pei, L. X. Yang, and Z. Y. He, “A chaotic map based on scaling transformation of nonlinear function,” Neural Information Processing, vol. 3, no. 2, pp. 21–29, 2004. View at Google Scholar
  39. K. T. Alligood, T. D. Sauer, and J. A. Yorke, Chaos: An Introduction to Dynamical Systems, Springer, New York, NY, USA, 1st edition, 1996. View at MathSciNet
  40. A. Wolf, J. B. Swift, H. L. Swinney, and J. A. Vastano, “Determining Lyapunov exponents from a time series,” Physica D, vol. 16, no. 3, pp. 285–317, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  41. P. Grassberger and I. Procaccia, “Measuring the strangeness of strange attractors,” Physica D, vol. 9, no. 1-2, pp. 189–208, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  42. J. D. Farmer, E. Ott, and J. A. Yorke, “The dimension of chaotic attractors,” Physica D, vol. 7, no. 1–3, pp. 153–180, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  43. J. Theiler, “Efficient algorithm for estimating the correlation dimension from a set of discrete points,” Physical Review A, vol. 36, no. 9, pp. 4456–4462, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  44. J. Theiler, “Estimating fractal dimension,” Journal of the Optical Society of America A, vol. 7, no. 6, pp. 1055–1073, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  45. M. Ciuc and C. Vertan, Prelucrarea Statistică a Semnalelor, Matrix Rom Publishing House, Bucharest, Romania, 2005.
  46. A. Luca and A. Vlad, “On the statistical independence of two discrete random variables sampled from some chaotic signals,” in Proceedings of the 31st International Conference on Modern Technologies in the 21st Century, pp. 163–166, Military Technical Academy, Bucharest, Romania, November 2005.
  47. W. J. Conover, Practical Nonparametric Statistics, John Wiley & Sons, New York, NY, USA, 1999.
  48. M. I. Mihăilescu and M. Pîrloagă, “New framework for biometric face recognition using visual cryptography,” in Proceedings of the 23rd DAAAM International Symposium, vol. 23, pp. 163–166, Vienna, Austria, 2012.
  49. J. He, H. Qian, Y. Zhou, and Z. Li, “Cryptanalysis and improvement of a block cipher based on multiple chaotic systems,” Mathematical Problems in Engineering, vol. 2010, Article ID 590590, 14 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  50. Z. G. Xu, Q. Tian, and L. Tian, “Theorem to generate independently and uniformly distributed chaotic key stream via topologically conjugated maps of tent map,” Mathematical Problems in Engineering, vol. 2012, Article ID 619257, 12 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  51. W. Xingyuan, Q. Xue, and T. Lin, “A novel true random number generator based on mouse movement and a one-dimensional chaotic map,” Mathematical Problems in Engineering, vol. 2012, Article ID 931802, 9 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  52. J. Chen, J. Zhou, K.-W. Wong, and Z. Ji, “Enhanced cryptography by multiple chaotic dynamics,” Mathematical Problems in Engineering, vol. 2011, Article ID 938454, 12 pages, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  53. A. Rukhin, J. Soto, J. Nechvatal et al., A Statistical Test Suite for the Validation of Random Number Generators and Pseudorandom Number Generators for Cryptographic Applications, Special Publication SP800-22, National Institute of Standards and Technology, 2010.
  54. http://www.stat.fsu.edu/pub/diehard/.
  55. S. Banerjee and T. Pedersen, “Design, implementation and use of n-gram statistics package,” in Proceedings of the 4th International Conference on Computational Linguistics and Intelligent Text Processing (CICLing ’03), pp. 370–381, Mexico City, Mexico, February 2003.
  56. C. Muise, S. McIlraith, J. A. Baier, and M. Reimer, “Exploiting n-gram analysis to predict operator sequences,” in Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS ’09), pp. 374–377, Thessaloniki, Greece, September 2009.
  57. N. Marwan, M. C. Romano, M. Thiel, and J. Kurths, “Recurrence plots for the analysis of complex systems,” Physics Reports, vol. 438, no. 5-6, pp. 237–329, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  58. B. F. Jorge and C. Dulce, “Recurrence plots in nonlinear time series analysis: free software,” Journal of Statistical Software, vol. 7, no. 9, pp. 1–18, 2002. View at Google Scholar
  59. C. E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal, vol. 27, no. 3, pp. 379–423, 1948. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  60. D. P. Doane and L. E. Seward, “Measuring skewness: a forgotten statistics?” Journal of Statistics Education, vol. 19, no. 2, pp. 45–63, 2011. View at Google Scholar
  61. L. T. DeCarlo, “On the meaning and use of kurtosis,” Psychological Methods, vol. 2, no. 3, pp. 292–307, 1997. View at Publisher · View at Google Scholar
  62. S. Li, X. Mou, and Y. Cai, “Pseudo-random bit generator based on couple chaotic systems and its applications in stream-cipher cryptography,” in Progress in Cryptology—INDOCRYPT 2001, vol. 2247 of Lecture Notes in Computer Science, pp. 316–329, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  63. D. Li and S. H. Wang, “Security analysis of a multiple pseudorandom-bit generator based on a spatiotemporal chaotic map,” Chinese Physics B, vol. 19, no. 8, Article ID 080505, 2010. View at Publisher · View at Google Scholar
  64. S. Ahadpour and Y. Sadra, “A pseudorandom bit generator based on chaotic coupled map lattices,” Journal of Theoretical Physics & Cryptography, vol. 1, pp. 1–5, 2012. View at Google Scholar
  65. B. O. L. Amalia, A. M. Gonzalo, G. E. Alberto, P. D. Gerardo, R. G. Miguel, and M. V. Fausto, “Trident, a new pseudo random number generator based on coupled chaotic maps,” in Proceedings of the 3rd International Conference on Computational Intelligence in Security for Information Systems (CISIS ’10), pp. 183–190, 2010.
  66. R. S. Katti, R. G. Kavasseri, and V. Sai, “Pseudorandom bit generation using coupled congruential generators,” IEEE Transactions on Circuits and Systems II, vol. 57, no. 3, pp. 203–207, 2010. View at Google Scholar
  67. X. Wang, J. Zhang, and W. Zhang, “Chaotic keystream generator using coupled NDFs with parameter perturbing,” in Cryptology and Network Security, pp. 270–285, Springer, Berlin, Germany, 2006. View at Google Scholar