Reduction of dimension for nonlinear dynamical systems

We consider reduction of dimension for nonlinear dynamical systems. We demonstrate that in some cases, one can reduce a nonlinear system of equations into a single equation for one of the state variables, and this can be useful for computing the solution when using a variety of analytical approaches. In the case where this reduction is possible, we employ differential elimination to obtain the reduced system. While analytical, the approach is algorithmic, and is implemented in symbolic software such as {\sc MAPLE} or {\sc SageMath}. In other cases, the reduction cannot be performed strictly in terms of differential operators, and one obtains integro-differential operators, which may still be useful. In either case, one can use the reduced equation to both approximate solutions for the state variables and perform chaos diagnostics more efficiently than could be done for the original higher-dimensional system, as well as to construct Lyapunov functions which help in the large-time study of the state variables. A number of chaotic and hyperchaotic dynamical systems are used as examples in order to motivate the approach.Comment: 16 pages, no figure

On new chaotic and hyperchaotic systems: A literature survey

This paper provides a thorough survey of new chaotic and hyperchaotic systems. An analysis of the dynamic behavior of these complex systems is presented by pointing out their originality and elementary characteristics. Recently, such systems have been increasingly used in various fields such as secure communication, encryption and finance and so on. In practice, each field requires specific performances with peculiar complexity. A particular classification is then proposed in this paper based on the Lyapunov exponent, the equilibriums points and the attractor forms

Theoretical Analysis and Circuit Verification for Fractional-Order Chaotic Behavior in a New Hyperchaotic System

A novel nonlinear four-dimensional hyperchaotic system and its fractional-order form are presented. Some dynamical behaviors of this system are further investigated, including Poincaré mapping, parameter phase portraits, equilibrium points, bifurcations, and calculated Lyapunov exponents. A simple fourth-channel block circuit diagram is designed for generating strange attractors of this dynamical system. Specifically, a novel network module fractance is introduced to achieve fractional-order circuit diagram for hardware implementation of the fractional attractors of this nonlinear hyperchaotic system with order as low as 0.9. Observation results have been observed by using oscilloscope which demonstrate that the fractional-order nonlinear hyperchaotic attractors exist indeed in this new system

Research on digital image watermark encryption based on hyperchaos

The digital watermarking technique embeds meaningful information into one or more watermark images hidden in one image, in which it is known as a secret carrier. It is difficult for a hacker to extract or remove any hidden watermark from an image, and especially to crack so called digital watermark. The combination of digital watermarking technique and traditional image encryption technique is able to greatly improve anti-hacking capability, which suggests it is a good method for keeping the integrity of the original image. The research works contained in this thesis include: (1)A literature review the hyperchaotic watermarking technique is relatively more advantageous, and becomes the main subject in this programme. (2)The theoretical foundation of watermarking technologies, including the human visual system (HVS), the colour space transform, discrete wavelet transform (DWT), the main watermark embedding algorithms, and the mainstream methods for improving watermark robustness and for evaluating watermark embedding performance. (3) The devised hyperchaotic scrambling technique it has been applied to colour image watermark that helps to improve the image encryption and anti-cracking capabilities. The experiments in this research prove the robustness and some other advantages of the invented technique. This thesis focuses on combining the chaotic scrambling and wavelet watermark embedding to achieve a hyperchaotic digital watermark to encrypt digital products, with the human visual system (HVS) and other factors taken into account. This research is of significant importance and has industrial application value

On the Application of PSpice for Localised Cloud Security

The work reported in this thesis commenced with a review of methods for creating random binary sequences for encoding data locally by the client before storing in the Cloud. The first method reviewed investigated evolutionary computing software which generated noise-producing functions from natural noise, a highly-speculative novel idea since noise is stochastic. Nevertheless, a function was created which generated noise to seed chaos oscillators which produced random binary sequences and this research led to a circuit-based one-time pad key chaos encoder for encrypting data. Circuit-based delay chaos oscillators, initialised with sampled electronic noise, were simulated in a linear circuit simulator called PSpice. Many simulation problems were encountered because of the nonlinear nature of chaos but were solved by creating new simulation parts, tools and simulation paradigms. Simulation data from a range of chaos sources was exported and analysed using Lyapunov analysis and identified two sources which produced one-time pad sequences with maximum entropy. This led to an encoding system which generated unlimited, infinitely-long period, unique random one-time pad encryption keys for plaintext data length matching. The keys were studied for maximum entropy and passed a suite of stringent internationally-accepted statistical tests for randomness. A prototype containing two delay chaos sources initialised by electronic noise was produced on a double-sided printed circuit board and produced more than 200 Mbits of OTPs. According to Vladimir Kotelnikov in 1941 and Claude Shannon in 1945, one-time pad sequences are theoretically-perfect and unbreakable, provided specific rules are adhered to. Two other techniques for generating random binary sequences were researched; a new circuit element, memristance was incorporated in a Chua chaos oscillator, and a fractional-order Lorenz chaos system with order less than three. Quantum computing will present many problems to cryptographic system security when existing systems are upgraded in the near future. The only existing encoding system that will resist cryptanalysis by this system is the unconditionally-secure one-time pad encryption

A locally active discrete memristor model and its application in a hyperchaotic map

© 2022 Springer Nature Switzerland AG. Part of Springer Nature. This is the accepted manuscript version of an article which has been published in final form at https://doi.org/10.1007/s11071-021-07132-5The continuous memristor is a popular topic of research in recent years, however, there is rare discussion about the discrete memristor model, especially the locally active discrete memristor model. This paper proposes a locally active discrete memristor model for the first time and proves the three fingerprints characteristics of this model according to the definition of generalized memristor. A novel hyperchaotic map is constructed by coupling the discrete memristor with a two-dimensional generalized square map. The dynamical behaviors are analyzed with attractor phase diagram, bifurcation diagram, Lyapunov exponent spectrum, and dynamic behavior distribution diagram. Numerical simulation analysis shows that there is significant improvement in the hyperchaotic area, the quasi-periodic area and the chaotic complexity of the two-dimensional map when applying the locally active discrete memristor. In addition, antimonotonicity and transient chaos behaviors of system are reported. In particular, the coexisting attractors can be observed in this discrete memristive system, resulting from the different initial values of the memristor. Results of theoretical analysis are well verified with hardware experimental measurements. This paper lays a great foundation for future analysis and engineering application of the discrete memristor and relevant the study of other hyperchaotic maps.Peer reviewedFinal Accepted Versio

Computational Intelligence and Complexity Measures for Chaotic Information Processing

This dissertation investigates the application of computational intelligence methods in the analysis of nonlinear chaotic systems in the framework of many known and newly designed complex systems. Parallel comparisons are made between these methods. This provides insight into the difficult challenges facing nonlinear systems characterization and aids in developing a generalized algorithm in computing algorithmic complexity measures, Lyapunov exponents, information dimension and topological entropy. These metrics are implemented to characterize the dynamic patterns of discrete and continuous systems. These metrics make it possible to distinguish order from disorder in these systems. Steps required for computing Lyapunov exponents with a reorthonormalization method and a group theory approach are formalized. Procedures for implementing computational algorithms are designed and numerical results for each system are presented. The advance-time sampling technique is designed to overcome the scarcity of phase space samples and the buffer overflow problem in algorithmic complexity measure estimation in slow dynamics feedback-controlled systems. It is proved analytically and tested numerically that for a quasiperiodic system like a Fibonacci map, complexity grows logarithmically with the evolutionary length of the data block. It is concluded that a normalized algorithmic complexity measure can be used as a system classifier. This quantity turns out to be one for random sequences and a non-zero value less than one for chaotic sequences. For periodic and quasi-periodic responses, as data strings grow their normalized complexity approaches zero, while a faster deceasing rate is observed for periodic responses. Algorithmic complexity analysis is performed on a class of certain rate convolutional encoders. The degree of diffusion in random-like patterns is measured. Simulation evidence indicates that algorithmic complexity associated with a particular class of 1/n-rate code increases with the increase of the encoder constraint length. This occurs in parallel with the increase of error correcting capacity of the decoder. Comparing groups of rate-1/n convolutional encoders, it is observed that as the encoder rate decreases from 1/2 to 1/7, the encoded data sequence manifests smaller algorithmic complexity with a larger free distance value