Search

This work proposes a family of modulo-based one-dimensional maps with three control parameters. The input to the modulo function includes the addition of three terms, the map's previous value, a scalar, and a multiple of a chosen seed function. Under certain conditions, the proposed maps will have no equilibria, which brings them into the category of maps with hidden attractors. Moreover, the maps can showcase wide parametric regions of uninterrupted chaotic behavior, indicative of robust chaos. The above properties are studied for a collection of different seed functions, inspired by well-known chaotic maps. The results are demonstrated by a series of numerical tools, like phase diagrams, bifurcation diagrams, Lyapunov exponent diagrams, and the 0–1 test. Finally, the maps are successfully applied to the design of a pseudo-random bit generator. [ABSTRACT FROM AUTHOR]

This research paper introduces a family of one-dimensional S-unimodal maps based on the Gaussian function, designed to exhibit robust chaos across a wide range of parameters. These maps are developed to display robust chaos by avoiding multiple fixed points that are primarily responsible for the coexisting attractors in 1D maps. The parameter space analysis reveals that chaotic behaviour is sustained across the entire parameter space, except for a very narrow region. The study employs a comprehensive computational approach, including quantitative measures such as sample entropy, Lyapunov exponent, and invariant measures. The uniformly higher values of sample entropy, uniform positive values of the Lyapunov exponent, and the existence of invariant measures in a region of parameter space confirm the presence of robust chaos in these maps. Such a promising class of robust chaotic maps may be potentially used in diverse fields such as chaos-based cryptography, pseudorandom number generation, communication systems, and more. [ABSTRACT FROM AUTHOR]

In this paper, we present a lossless image encryption algorithm utilizing robust chaos based dynamic DNA coding and DNA operations (DNA XOR and DNA Complement). The entire process of encryption is controlled by the pseudo-random number sequences generated through a 1D robust chaos map that exhibits chaotic behaviour in a very large region of parameter space with no apparent periodic window and therefore possesses a fairly large key space. Due to peculiar feed-forward and feedback mechanisms, which modify the synthetic image (created to initiate the encryption process) at the encryption of each pixel, the proposed algorithm possesses extreme sensitivity to the plain image, cipher image and secret key. The performance analysis proves that the proposed algorithm exhibits excellent features (as expected from ideal image encryption algorithms) and is robust against various statistical and cryptanalytic attacks.

This research paper introduces a family of one-dimensional S-unimodal maps based on the Gaussian function, designed to exhibit robust chaos across a wide range of parameters. These maps are developed to display robust chaos by avoiding multiple fixed points that are primarily responsible for the coexisting attractors in 1D maps. The parameter space analysis reveals that chaotic behaviour is sustained across the entire parameter space, except for a very narrow region. The study employs a comprehensive computational approach, including quantitative measures such as sample entropy, Lyapunov exponent, and invariant measures. The uniformly higher values of sample entropy, uniform positive values of the Lyapunov exponent, and the existence of invariant measures in a region of parameter space confirm the presence of robust chaos in these maps. Such a promising class of robust chaotic maps may be potentially used in diverse fields such as chaos-based cryptography, pseudo-random number generation, communication systems, and more.

In diverse physical systems stable oscillatory solutions devolve into more complicated solutions through border-collision bifurcations. Mathematically these occur when a stable fixed point of a piecewise-smooth map collides with a switching manifold as parameters are varied. The purpose of this paper is to highlight the extreme complexity possible in the subsequent dynamics. By perturbing instances of the n-dimensional border-collision normal form for which the $ n^{\rm th} $ n th iterate is a direct product of chaotic skew tent maps, it is shown that many chaotic attractors can arise. Burnside's lemma is used to count the attractors; chaoticity is proved by demonstrating that some iterate of the map is piecewise-expanding. The resulting transition from a stable fixed point to many coexisting chaotic attractors occurs throughout open subsets of parameter space and is not destroyed by higher order terms, hence can be expected to occur generically in mathematical models. [ABSTRACT FROM AUTHOR]

In this paper, we present a lossless image encryption algorithm utilizing robust chaos-based dynamic DNA coding and DNA operations (DNA XOR and DNA Complement). The entire process of encryption is controlled by the pseudo-random number sequences generated through a 1D robust chaos map that exhibits chaotic behaviour in a very large region of parameter space with no apparent periodic window and therefore possesses a fairly large key space. Due to peculiar feed-forward and feedback mechanisms, which modify the synthetic image (created to initiate the encryption process) at the encryption of each pixel, the proposed algorithm possesses extreme sensitivity to the plain image, cipher image and secret key. The performance analysis proves that the proposed algorithm exhibits excellent features (as expected from ideal image encryption algorithms) and is robust against various statistical and cryptanalytic attacks. [ABSTRACT FROM AUTHOR]

The paper is dedicated to the numerical and experimental study of nonlinear oscillations exhibited by the Vilnius chaotic generator. The motivation for the work is defined by the need for a comprehensive analysis of the dynamics of the oscillators being embedded into chaotic communication systems. These generators should provide low-power operation while ensuring the robustness of the chaotic oscillations, insusceptible to parameter variations and noise. The work focuses on the investigation of the dependence of nonlinear dynamics of the Vilnius oscillator on the operating voltage and component parameter changes. The paper shows that the application of the Method of Complete Bifurcation Groups reveals the complex smooth and non-smooth bifurcation structures, forming regions of robust chaotic oscillations. The novel tool—mode transition graph—is presented, allowing the comparison of experimental and numerical results. The paper demonstrates the applicability of the Vilnius oscillator for the generation of robust chaos, and highlights the need for further investigation of the inherent trade-off between energy efficiency and robustness of the obtained oscillations. [ABSTRACT FROM AUTHOR]

When chaotic systems are used for speech encryption, their chaotic performance largely determines the security of speech encryption. However, traditional chaotic systems have problems such as parameter discontinuity, easy occurrence of chaos degradation, low complexity, and the existence of periodic windows in chaotic intervals. In real applications, chaotic mappings may fall into periodic windows, which is extremely unfavorable for security. In this paper, a new chaotic mapping 2D-LMSM is proposed by improving the chaotic logistic and sine mappings, and applied to speech encryption. Performance evaluation shows that this map can effectively generate robust chaotic signals in a wide parameter range. The 2D-LMSM achieves better robustness and desired chaotic properties than several existing two-dimensional chaotic maps. We propose a novel speech encryption algorithm using this map. First, it performs Fast Fourier Transform (FFT) on the input speech signal to obtain real and imaginary values, which are encrypted by one-time scrambling encryption and XOR diffusion encryption with pseudorandom numbers generated by chaos; then, it performs secondary scrambling encryption by Discrete Wavelet Transform (DWT) and 2D-LMSM; finally, it obtains encrypted speech data by Discrete Wavelet Inverse Transform (IDWT) and Fast Fourier Inverse Transform (IFFT). Experimental results show that this algorithm has good encryption and decryption performances and ensures system security. [ABSTRACT FROM AUTHOR]

Chaotic systems are often considered to be a basis for various cryptographic methods due to their properties, which correspond to cryptographic properties like confusion, diffusion and algorithm (attack) complexity. In these kinds of applications, chaos robustness is desired. It can be defined by the absence of periodic windows and coexisting attractors in some neighborhoods of the parameter space. On the other hand, when used as a basis for neuromorphic modeling, chaos robustness is to be avoided, and the edge-of-chaos regime is needed. This paper analyses the robustness and edge-of-chaos for Chua's systems, comprising either a piecewise linear or a smooth function nonlinearity, using a novel figure of merit based on correlation coefficient and Lyapunov exponent. Calculation complexity, which is important when a chaotic system is implemented, is evaluated for double and decimal data types, where needed calculation time varies by a factor of about 1500, depending on the nonlinearity function and the data type. On the other hand, different data types result in different number precision, which has some practical advantages and drawbacks presented in the paper. [ABSTRACT FROM AUTHOR]

This paper presents a general method, called "self-parameterization", for designing one-dimensional (1-D) chaotic maps that provide wider chaotic regions compared to existing 1-D maps. A wide chaotic region is a desirable property, as it helps to provide robust performance by enlarging the design space in many hardware-security applications, including reconfigurable logic and encryption. The proposed self-parameterization scheme uses only one existing chaotic map, referred to as the seed map, and a simple transformation block. The effective control parameter of the seed map is treated as an intermediate variable derived from the input and control parameter of the self-parameterized map, under some constraints, to achieve the desired functionality. The widening of the chaotic region after adding self-parameterization is first demonstrated on three ideal map functions: Logistic; Tent; and Sine. A digitized version of the scheme was developed and realized in a field-programmable gate array (FPGA) implementation. An analog version of the proposed scheme was developed with very low transistor-count analog topologies for hardware-constrained integrated circuit (IC) implementation. The chaotic performance of both digital and analog implementations was evaluated with bifurcation plots and four established chaotic entropy metrics: the Lyapunov Exponent; the Correlation Coefficient; the Correlation Dimension; and Approximate Entropy. An application of the proposed scheme was demonstrated in a random number generator design, and the statistical randomness of the generated sequence was verified with the NIST test. [ABSTRACT FROM AUTHOR]

This paper presents a novel discrete-time (DT) chaotic map-based random-number generator (RNG), namely the Siponi map, which is a modification of the Logistic map. The Logistic map is usually applied to cryptosystems, mainly for the purposes of generating random numbers. In addition to being easy to implement, it has a better security level than other nonlinear functions. However, it can only process positive real-number inputs. Our proposed map is a deterministic function that can process positive and negative real values. We explored the map comprehensively and investigated its characteristics and parameters. We calculated the optimum parameter values using empirical and theoretical mathematical models to yield the maximum randomness of a sequence of bits. The limit variation of the maximum parameter value was determined based on a practical information measure. Empirical verification was performed for the Siponi map to generate bit sequences unrelated to the previous bit with high entropy values, and we found the extractor function threshold value to be 0.5, while the parameter control was −2 or 2. Using our proposed map, a simple RNG without post-processing passed DieHard statistical tests and all the tests on the NIST SP 800-22. Finally, we have implemented a Siponi map-based RNG on the FPGA board and demonstrated that the sources used are LUT = 4086, DSP = 62, and register = 2206. [ABSTRACT FROM AUTHOR]

When used in engineering applications, most existing chaotic systems may have many disadvantages, including discontinuous chaotic parameter ranges, lack of robust chaos, and easy occurrence of chaos degradation. In this article, we propose a two-dimensional (2-D) parametric polynomial chaotic system (2D-PPCS) as a general system that can yield many 2-D chaotic maps with different exponent coefficient settings. The 2D-PPCS initializes two parametric polynomials and then applies modular chaotification to the polynomials. Setting different control parameters allows the 2D-PPCS to customize its Lyapunov exponents in order to obtain robust chaos and behaviors with desired complexity. Our theoretical analysis demonstrates the robust chaotic behavior of the 2D-PPCS. Two illustrative examples are provided and tested based on numeral experiments to verify the effectiveness of the 2D-PPCS. A chaos-based pseudorandom number generator is also developed to illustrate the applications of the 2D-PPCS. The experimental results demonstrate that these examples of the 2D-PPCS can achieve robust and desired chaos, have better performance, and generate higher randomness pseudorandom numbers than some representative 2-D chaotic maps. [ABSTRACT FROM AUTHOR]

Chaotic dynamics of various continuous and discrete-time mathematical models are used frequently in many practical applications. Many of these applications demand the chaotic behavior of the model to be robust. Therefore, it has been always a challenge to find mathematical models which exhibit robust chaotic dynamics. In the existing literature there exist a very few studies of robust chaos generators based on simple 1-D mathematical models. In this paper, we have proposed an infinite family consisting of simple one-dimensional piecewise smooth maps which can be effectively used to generate robust chaotic signals over a wide range of the parameter values.

This paper presents a general method, called “self-parameterization”, for designing one-dimensional (1-D) chaotic maps that provide wider chaotic regions compared to existing 1-D maps. A wide chaotic region is a desirable property, as it helps to provide robust performance by enlarging the design space in many hardware-security applications, including reconfigurable logic and encryption. The proposed self-parameterization scheme uses only one existing chaotic map, referred to as the seed map, and a simple transformation block. The effective control parameter of the seed map is treated as an intermediate variable derived from the input and control parameter of the self-parameterized map, under some constraints, to achieve the desired functionality. The widening of the chaotic region after adding self-parameterization is first demonstrated on three ideal map functions: Logistic; Tent; and Sine. A digitized version of the scheme was developed and realized in a field-programmable gate array (FPGA) implementation. An analog version of the proposed scheme was developed with very low transistor-count analog topologies for hardware-constrained integrated circuit (IC) implementation. The chaotic performance of both digital and analog implementations was evaluated with bifurcation plots and four established chaotic entropy metrics: the Lyapunov Exponent; the Correlation Coefficient; the Correlation Dimension; and Approximate Entropy. An application of the proposed scheme was demonstrated in a random number generator design, and the statistical randomness of the generated sequence was verified with the NIST test.

In this paper, a novel third-order autonomous memristor-based chaotic circuit is proposed. The circuit has simple topology and contains only four elements including one linear negative impedance converter-based resistor, one linear capacitor, one linear inductor, and one nonlinear current-controlled memristor. Firstly, the voltage-current characteristic analysis of the memristor emulator for different driving amplitudes and frequencies are presented. With dimensionless system, the symmetry, equilibrium point and its stability are analysed. It is shown that the system has two unstable saddle-foci and one unstable saddle. A set of typical parameters are chosen for the generation of chaotic attractor. Differing from the common period-doubling bifurcation route in smooth dynamical systems, this memristive system shows abrupt transition from the coexisting period-1 limit cycles to robust chaos when varying system parameters. Various dynamical behaviors are analysed using the numerical simulations and circuit verifications. • A novel current-controlled memristor-based chaotic circuit is proposed. • Dynamical behaviors of robust chaos and coexisting attractors are investigated. • Both numerical analyses and circuit simulation validated the feasibility of the chaotic oscillator. [ABSTRACT FROM AUTHOR]

The dynamics near a border-collision bifurcation are approximated to leading order by a continuous, piecewise-linear map. The purpose of this paper is to consider the higher-order terms that are neglected when forming this approximation. For two-dimensional maps we establish conditions under which a chaotic attractor created in a border-collision bifurcation persists for an open interval of parameters beyond the bifurcation. We apply the results to a prototypical power converter model to prove the model exhibits robust chaos. • Under certain conditions chaotic attractors created in border-collision bifurcations are robust. • The robustness of an attractor is shown by constructing a trapping region in phase space. • The robustness of chaos is shown by constructing a contracting-invariant expanding cone in tangent space. • Such attractors occur in prototypical models of power converters. [ABSTRACT FROM AUTHOR]

Robust chaos is determined by the absence of periodic windows in bifurcation diagrams and coexisting attractors with parameter values taken from some regions of the parameter space of a dynamical system. Reliable chaos is an important characteristic of a dynamic system when it comes to its practical application. This property ensures that the chaotic behavior of the system will not deteriorate or be adversely affected by various factors. There are many methods for creating chaotic systems that are generated by adjusting the corresponding system parameters. However, most of the proposed systems are functions of well-known discrete mappings. In view of this, in this paper we consider a continuous system that illustrates some robust chaos properties.

Robust chaos is defined as the inexistence of periodic windows and coexisting attractors in the neighborhood of parameter space. This characteristic is desired because a chaotic system with robust chaos can overcome the chaos disappearance caused by parameter disturbance in practical applications. However, many existing chaotic systems fail to consider the robust chaos. This article introduces an exponential chaotic model (ECM) to produce new one-dimensional (1-D) chaotic maps with robust chaos. ECM is a universal framework and can produce many new chaotic maps employing any two 1-D chaotic maps as base and exponent maps. As examples, we present nine chaotic maps produced by ECM, discuss their bifurcation diagrams and prove their robust chaos. Performance evaluations also show that these nine chaotic maps of ECM can obtain robust chaos in a large parameter space. To show the practical applications of ECM, we employ these nine chaotic maps of ECM in secure communication. Simulation results show their superior performance against various channel noise during data transmission. [ABSTRACT FROM AUTHOR]

This paper introduces an image encryption algorithm shorted as CITSPD, manipulated by circle index table scrambling and partition diffusion. Firstly, the circle index table is obtained through the generation, circle shift and transposition of the benchmark sequence. Secondly, the plain image is transformed into the wavelet coefficient and is then scrambled by the circle index table. Thirdly, the permutated image is disturbed by different noises and is further divided into four subsections. Finally, the forward and inverse partition diffusions are performed to the subsections for getting the cipher image. The main feature of this algorithm is that the robust chaos-based keystream and encryption process are highly sensitive to the plaintext, which will effectively resist against chosen-plaintext and known-plaintext attacks. In addition, the encryption scheme is free of noise attack since the inverse diffusion differs from the forward one. And the diffusion effect can be effectively enhanced by, as much as possible, increasing the small pixel value and decreasing the large pixel value. Experimental tests and security analyses are carried out to verify the advantages of the scheme. [ABSTRACT FROM AUTHOR]

In this work, we demonstrate numerically that two-frequency excitation is an effective method to produce chaotification over very large regions of the parameter space for the Duffing oscillator with single- and double-well potentials. It is also shown that chaos is robust in the last case. Robust chaos is characterized by the existence of a single chaotic attractor which is not altered by changes in the system parameters. It is generally required for practical applications of chaos to prevent the effects of fabrication tolerances, external influences, and aging that can destroy chaos. After showing that very large and continuous regions in the parameter space develop a chaotic dynamics under two-frequency excitation for the double-well Duffing oscillator, we demonstrate that chaos is robust over these regions. The proof is based upon the observation of the monotonic changes in the statistical properties of the chaotic attractor when the system parameters are varied and by its uniqueness, demonstrated by changing the initial conditions. The effects of a second frequency in the single-well Duffing oscillator is also investigated. While a quite significant chaotification is observed, chaos is generally not robust in this case. [ABSTRACT FROM AUTHOR]

Robust Chaos occurring in piecewise smooth dynamical systems is very important in practical applications. It is defined by the absence of periodic windows and coexisting attractors in some neighbourhood of the parameter space. In earlier works, the occurrence of robust chaos was reported in the context of piecewise linear 1D and 2D maps, and regions of occurrences have been investigated in 1D and 2D switching circuits. Here, it has been reported the first experimental observation of this phenomenon in a 3D electronic switching system and obtain the region of parameter space by constructing a discrete map of the system. [ABSTRACT FROM AUTHOR]

The search for generation approaches to robust chaos has received considerable attention due to potential applications in cryptography or secure communications. This paper is of interest regarding a 1-D sigmoidal chaotic map, which has never been distinctly investigated. This paper introduces a generic form of the sigmoidal chaotic map with three terms, i.e., xn+1 = ∓AfNL(Bxn) ± Cxn ± D, where A, B, C, and D are real constants. The unification of modified sigmoid and hyperbolic tangent (tanh) functions reveals the existence of a "unified sigmoidal chaotic map" generically fulfilling the three terms, with robust chaos partially appearing in some parameter ranges. A simplified generic form, i.e., xn+1 = ∓fNL(Bxn) ± Cxn, through various S-shaped functions, has recently led to the possibility of linearization using (i) hardtanh and (ii) signum functions. This study finds a linearized sigmoidal chaotic map that potentially offers robust chaos over an entire range of parameters. Chaos dynamics are described in terms of chaotic waveforms, histogram, cobweb plots, fixed point, Jacobian, and a bifurcation structure diagram based on Lyapunov exponents. As a practical example, a true random bit generator using the linearized sigmoidal chaotic map is demonstrated. The resulting output is evaluated using the NIST SP800-22 test suite and TestU01. [ABSTRACT FROM AUTHOR]

The search for generation approaches to robust chaos has received considerable attention due to potential applications in cryptography or secure communications. This paper is of interest regarding a 1-D sigmoidal chaotic map, which has never been distinctly investigated. This paper introduces a generic form of the sigmoidal chaotic map with three terms, i.e., xn+1 = ∓AfNL(Bxn) ± Cxn ± D, where A, B, C, and D are real constants. The unification of modified sigmoid and hyperbolic tangent (tanh) functions reveals the existence of a “unified sigmoidal chaotic map” generically fulfilling the three terms, with robust chaos partially appearing in some parameter ranges. A simplified generic form, i.e., xn+1 = ∓fNL(Bxn) ± Cxn, through various S-shaped functions, has recently led to the possibility of linearization using (i) hardtanh and (ii) signum functions. This study finds a linearized sigmoidal chaotic map that potentially offers robust chaos over an entire range of parameters. Chaos dynamics are described in terms of chaotic waveforms, histogram, cobweb plots, fixed point, Jacobian, and a bifurcation structure diagram based on Lyapunov exponents. As a practical example, a true random bit generator using the linearized sigmoidal chaotic map is demonstrated. The resulting output is evaluated using the NIST SP800-22 test suite and TestU01.

• Trapping regions and invariant expanding cones are constructed for planar piecewise-linear maps. • Induced maps are used to accommodate dynamics with rotational characteristics. • Chaos is verified by proving positivity of a Lyapunov exponent. • These properties are formulated as an algorithm for establishing the presence of a chaotic attractor. In some maps the existence of an attractor with a positive Lyapunov exponent can be proved by constructing a trapping region in phase space and an invariant expanding cone in tangent space. If this approach fails it may be possible to adapt the strategy by considering an induced map (a first return map for a well-chosen subset of phase space). In this paper we show that such a construction can be applied to the two-dimensional border-collision normal form (a continuous piecewise-linear map) if a certain set of conditions are satisfied and develop an algorithm for checking these conditions. The algorithm requires relatively few computations, so it is a more efficient method than, for example, estimating the Lyapunov exponent from a single orbit in terms of speed, numerical accuracy, and rigor. The algorithm is used to prove the existence of an attractor with a positive Lyapunov exponent numerically in an area of parameter space where the map has strong rotational characteristics and the consideration of an induced map is critical for the proof of robust chaos. [ABSTRACT FROM AUTHOR]

We investigate the spatiotemporal behaviour of a network where the local dynamics at the nodes (sites) is governed by piecewise linear maps. The local maps we consider exhibit the interesting and potentially useful property of robust chaos. We study the coupled system of such maps with varying fraction of random non-local connections, where the random links may be static, or may change over time. While this system is always unsynchronized under regular connections, synchronized chaos emerges when some of the links are rewired randomly. Further, increasing the frequency of link changes and fraction of random links significantly enhances the range of synchronization. Additionally, dynamic random links are also found to suppress unbounded dynamics in parameter regimes where blow-ups occurred under regular coupling. [ABSTRACT FROM AUTHOR]

In this work we investigate bifurcation structures in the chaotic domain of a piecewise linear bimodal map. The map represents a model of a circuit proposed to generate chaotic signals. For practical purposes it is necessary that the map generates robust broad-band chaos. However, experiments show that this requirement is fulfilled not everywhere. We show that the chaotic domain in the parameter space of this map contains regions in which the map has multi-band chaotic attractors. These regions are confined by bifurcation curves associated with homoclinic bifurcations of unstable cycles, and form a so-called bandcount adding structure previously reported to occur in discontinuous maps. Additionally, it is shown that inside each of these regions chaotic attractors collapse to particular cycles existing on a domain of zero measure in the parameter space and organized in a period adding structure in the form known for circle maps. [ABSTRACT FROM AUTHOR]

We examine and assess deterministic chaos as an observable. First, we present the development of model ecological systems. We illustrate how to apply the Kolmogorov theorem to obtain limits on the parameters in the system, which assure the existence of either stable equilibrium point or stable limit cycle behavior in the phase space of two-dimensional (2D) dynamical systems. We also illustrate the method of deriving conditions using the linear stability analysis. We apply these procedures on some basic existing model ecological systems. Then, we propose four model ecological systems to study the dynamical chaos (chaos and intermittent chaos) and cycles. Dynamics of two predation and two competition models have been explored. The predation models have been designed by linking two predator–prey communities, which differ from one another in one essential way: the predator in the first is specialist and that in the second is generalist. The two competition models pertain to two distinct competition processes: interference and exploitative competition. The first competition model was designed by linking two predator–prey communities through inter-specific competition. The other competition model assumes that a cycling predator–prey community is successfully invaded by a predator with linear functional response and coexists with the community as a result of differences in the functional responses of the two predators. The main criterion behind the selection of these two model systems for the present study was that they represent diversity of ecological interactions in the real world in a manner which preserves mathematical tractability. For investigating the dynamic behavior of the model systems, the following tools are used: (i) calculation of the basin boundary structures, (ii) performing two-dimensional parameter scans using two of the parameters in the system as base variables, (iii) drawing the bifurcation diagrams, and (iv) performing time series analysis and drawing the phase space diagrams. The results of numerical simulation are used to distinguish between chaotic and cyclic behaviors of the systems. The conclusion that we obtain from the first two model systems (predation models) is that it would be difficult to capture chaos in the wild because ecological systems appear to change their attractors in response to changes in the system parameters quite frequently. The detection of chaos in the real data does not seem to be a possibility as what is present in ecological systems is not robust chaos but short-term recurrent chaos. The first competition model (interference competition) shares this conclusion with those of predation ones. The model with exploitative competition suggests that deterministic chaos may be robust in certain systems, but it would not be observed as the constituent populations frequently execute excursions to extinction-sized densities. Thus, no matter how good the data characteristics and analysis techniques are, dynamical chaos may continue to elude ecologists. On the other hand, the models suggest that the observation of cyclical dynamics in nature is the most likely outcome. [ABSTRACT FROM AUTHOR]

This paper offers an overview of some important issues concerning the robustness of chaos in dynamical systems and their applications to the real world. [ABSTRACT FROM AUTHOR]

Abstract: We study the dynamical complexity of five non-linear deterministic predator–prey model systems. These simple systems were selected to represent a diversity of trophic structures and ecological interactions in the real world while still preserving reasonable tractability. We find that these systems can dramatically change attractor types, and the switching among different attractors is dependent on system parameters. While dynamical complexity depends on the nature (e.g., inter-specific competition versus predation) and degree (e.g., number of interacting components) of trophic structure present in the system, these systems all evolve principally on intrinsically noisy limit cycles. Our results support the common observation of cycling and rare observation of chaos in natural populations. Our study also allows us to speculate on the functional role of specialist versus generalist predators in food web modeling. [Copyright &y& Elsevier]

Simple polynomial unimodal maps which show robust chaos, that is, a unique chaotic attractor and no periodic windows in their bifurcation diagrams, are constructed. Their invariant distributions and Lyapunov exponents are examined. [ABSTRACT FROM AUTHOR]

Robust chaotic systems, due to their inherent properties of mixing, ergodicity, and larger chaotic parameter space, constitute a perfect candidate for cryptography. This paper reports a novel method to generate random numbers using modified robust logistic map (MRLM). The non-smooth probability distribution function of robust logistic map (RLM) trajectories gives an un-even binary distribution in randomness test. To overcome this disadvantage in RLM, control of chaos (CoC) is proposed for smooth probability distribution function of RLM. For testing the proposed design, cryptographic random numbers generated by MRLM were vetted with National Institute of Standards and Technology statistical test suite (NIST 800-22). The results showed that proposed MRLM generates cryptographically secure random numbers (CSPRNG). [ABSTRACT FROM AUTHOR]