Search

Encryption of images is an important method that can effectively improve the security and privacy of crucial image data. Existing methods generally encrypt an image with a combination of scrambling and encoding operations. Currently, many applications require highly secure results for image encryption. New methods that can achieve improved randomness for both the scrambling and encoding processes in encryption are thus needed to further enhance the security of a cipher image. This paper proposes a new method that can securely encrypt color images. As the first step of the proposed method, a complete bit-level operation is utilized to scramble the binary bits in a color image to a full extent. For the second step, the bits in the scrambled image are processed with a sweeping operation to improve the encryption security. In the final step of encryption, a codebook that varies with evolutionary operations based on several chaotic systems is utilized to encrypt the partially encrypted image obtained in the second step. Experimental results on benchmark color images suggest that this new approach can securely encrypt color images and generate cipher images that remain secure under different types of attacks. The proposed approach is compared with several other state-of-the-art encryption approaches and the results show that it can achieve improved encryption security for cipher images. Experimental results thus suggest that this new approach can possibly be utilized practically in applications where color images need to be encrypted for content protection. [ABSTRACT FROM AUTHOR]

Encryption of images is an important method that can effectively improve the security and privacy of crucial image data. Existing methods generally encrypt an image with a combination of scrambling and encoding operations. Currently, many applications require highly secure results for image encryption. New methods that can achieve improved randomness for both the scrambling and encoding processes in encryption are thus needed to further enhance the security of a cipher image. This paper proposes a new method that can securely encrypt color images. As the first step of the proposed method, a complete bit-level operation is utilized to scramble the binary bits in a color image to a full extent. For the second step, the bits in the scrambled image are processed with a sweeping operation to improve the encryption security. In the final step of encryption, a codebook that varies with evolutionary operations based on several chaotic systems is utilized to encrypt the partially encrypted image obtained in the second step. Experimental results on benchmark color images suggest that this new approach can securely encrypt color images and generate cipher images that remain secure under different types of attacks. The proposed approach is compared with several other state-of-the-art encryption approaches and the results show that it can achieve improved encryption security for cipher images. Experimental results thus suggest that this new approach can possibly be utilized practically in applications where color images need to be encrypted for content protection.

In the past decade, a large amount of important digital data has been created and stored in the form of color images; the protection of such data from undesirable accesses has become an important problem in information security. In this paper, a new approach based on an evolutionary framework is proposed for the secure encryption of color images. The image contents in a color image are first fully scrambled with a sequence of bit-level operations determined by a number of integer keys. A scrambled image is then encrypted with keys generated from an evolutionary process controlled by a set of chaotic systems. Analysis and experiments show that the proposed approach can generate encrypted color images with high security. In addition, the performance of the proposed approach is compared with that of a few state-of-the-art approaches for color image encryption. The results of the comparison suggest that the proposed approach outperforms the other approaches in the overall security of encrypted images. The proposed approach is thus potentially useful for applications that require color image encryption. [ABSTRACT FROM AUTHOR]

The database of faces containing sensitive information is at risk of being targeted by unauthorized automatic recognition systems, which is a significant concern for privacy. Although there are existing methods that aim to conceal identifiable information by adding adversarial perturbations to faces, they suffer from noticeable distortions that significantly compromise visual perception, and therefore, offer limited protection to privacy. Furthermore, the increasing prevalence of appearance anxiety on social media has led to users preferring to beautify their faces before uploading images. In this paper, we design a novel face database protection scheme via beautification with chaotic systems. Specifically, we construct the adversarial face with better visual perception via beautification for each face in the database. In the training, the face matcher and the beautification discriminator are federated against the generator, prompting it to generate beauty-like perturbations on the face to confuse the face matcher. Namely, the pixel changes produced by face beautification mask the adversarial perturbations. Moreover, we use chaotic systems to disrupt the order of adversarial faces in the database, further mitigating the risk of privacy leakage. Our scheme has been extensively evaluated through experiments, which show that it effectively defends against unauthorized attacks while also yielding good visual results. [ABSTRACT FROM AUTHOR]

In the past decade, a large amount of important digital data has been created and stored in the form of color images; the protection of such data from undesirable accesses has become an important problem in information security. In this paper, a new approach based on an evolutionary framework is proposed for the secure encryption of color images. The image contents in a color image are first fully scrambled with a sequence of bit-level operations determined by a number of integer keys. A scrambled image is then encrypted with keys generated from an evolutionary process controlled by a set of chaotic systems. Analysis and experiments show that the proposed approach can generate encrypted color images with high security. In addition, the performance of the proposed approach is compared with that of a few state-of-the-art approaches for color image encryption. The results of the comparison suggest that the proposed approach outperforms the other approaches in the overall security of encrypted images. The proposed approach is thus potentially useful for applications that require color image encryption.

The database of faces containing sensitive information is at risk of being targeted by unauthorized automatic recognition systems, which is a significant concern for privacy. Although there are existing methods that aim to conceal identifiable information by adding adversarial perturbations to faces, they suffer from noticeable distortions that significantly compromise visual perception, and therefore, offer limited protection to privacy. Furthermore, the increasing prevalence of appearance anxiety on social media has led to users preferring to beautify their faces before uploading images. In this paper, we design a novel face database protection scheme via beautification with chaotic systems. Specifically, we construct the adversarial face with better visual perception via beautification for each face in the database. In the training, the face matcher and the beautification discriminator are federated against the generator, prompting it to generate beauty-like perturbations on the face to confuse the face matcher. Namely, the pixel changes produced by face beautification mask the adversarial perturbations. Moreover, we use chaotic systems to disrupt the order of adversarial faces in the database, further mitigating the risk of privacy leakage. Our scheme has been extensively evaluated through experiments, which show that it effectively defends against unauthorized attacks while also yielding good visual results.

In chaotic entanglement, pairs of interacting classically-chaotic systems are induced into a state of mutual stabilization that can be maintained without external controls and that exhibits several properties consistent with quantum entanglement. In such a state, the chaotic behavior of each system is stabilized onto one of the system’s many unstable periodic orbits (generally located densely on the associated attractor), and the ensuing periodicity of each system is sustained by the symbolic dynamics of its partner system, and vice versa. Notably, chaotic entanglement is an entropy-reversing event: the entropy of each member of an entangled pair decreases to zero when each system collapses onto a given period orbit. In this paper, we discuss the role that entropy plays in chaotic entanglement. We also describe the geometry that arises when pairs of entangled chaotic systems organize into coherent structures that range in complexity from simple tripartite lattices to more involved patterns. We conclude with a discussion of future research directions.

To address the problems of the high complexity and low security of the existing image encryption algorithms, this paper proposes a dynamic key chaotic image encryption algorithm with low complexity and high security associated with plaintext. Firstly, the RGB components of the color image are read, and the RGB components are normalized to obtain the key that is closely related to the plaintext, and then the Arnold transform is used to stretch and fold the RGB components of the color image to change the position of the pixel points in space, so as to destroy the correlation between the adjacent pixel points of the image. Next, the generated sequences are independently encrypted with the Arnold-transformed RGB matrix. Finally, the three encrypted images are combined to obtain the final encrypted image. Since the key acquisition of this encryption algorithm is related to the plaintext, it is possible to achieve one key per image, so the key acquisition is dynamic. This encryption algorithm introduces chaotic mapping, so that the key space size is 10180. The key acquisition is closely related to the plaintext, which makes the ciphertext more random and resistant to differential attacks, and ensures that the ciphertext is more secure after encryption. The experiments show that the algorithm can encrypt the image effectively and can resist attack on the encrypted image.

In this paper, the stabilization and synchronization of a complex hidden chaotic attractor is shown. This article begins with the dynamic analysis of a complex Lorenz chaotic system considering the vector field properties of the analyzed system in the Cn domain. Then, considering first the original domain of attraction of the complex Lorenz chaotic system in the equilibrium point, by using the required set topology of this domain of attraction, one hidden chaotic attractor is found by finding the intersection of two sets in which two of the parameters, r and b, can be varied in order to find hidden chaotic attractors. Then, a backstepping controller is derived by selecting extra state variables and establishing the required Lyapunov functionals in a recursive methodology. For the control synchronization law, a similar procedure is implemented, but this time, taking into consideration the error variable which comprise the difference of the response system and drive system, to synchronize the response system with the original drive system which is the original complex Lorenz system.

In order to obtain chaos with a wider chaotic scope and better chaotic behavior, this paper combines the several existing one-dimensional chaos and forms a new one-dimensional chaotic map by using a modular operation which is named by LLS system and abbreviated as LLSS. To get a better encryption effect, a new image encryption method based on double chaos and DNA coding technology is proposed in this paper. A new one-dimensional chaotic map is combined with a hyperchaotic Qi system to encrypt by using DNA coding. The first stage involves three rounds of scrambling; a diffusion algorithm is applied to the plaintext image, and then the intermediate ciphertext image is partitioned. The final encrypted image is formed by using DNA operation. Experimental simulation and security analysis show that this algorithm increases the key space, has high sensitivity, and can resist several common attacks. At the same time, the algorithm in this paper can reduce the correlation between adjacent pixels, making it close to 0, and increase the information entropy, making it close to the ideal value and achieving a good encryption effect.

In this paper, a projective synchronization approach for a class of fractional-order chaotic systems with fractional-order 1 < q < 2 is demonstrated. The projective synchronization approach is established through precise theorization. To illustrate the effectiveness of the proposed scheme, we discuss two examples: (1) the fractional-order Lorenz chaotic system with fractional-order q = 1.1; (2) the fractional-order modified Chua’s chaotic system with fractional-order q = 1.02. The numerical simulations show the validity and feasibility of the proposed scheme.

In this paper, we introduce a new chaotic system that is used for an engineering application of the signal encryption. It has some interesting features, and its successful implementation and manufacturing were performed via a real circuit as a random number generator. In addition, we provide a parameter estimation method to extract chaotic model parameters from the real data of the chaotic circuit. The parameter estimation method is based on the attractor distribution modeling in the state space, which is compatible with the chaotic system characteristics. Here, a Gaussian mixture model (GMM) is used as a main part of cost function computations in the parameter estimation method. To optimize the cost function, we also apply two recent efficient optimization methods: WOA (Whale Optimization Algorithm), and MVO (Multi-Verse Optimizer) algorithms. The results show the success of the parameter estimation procedure. [ABSTRACT FROM AUTHOR]

The chaos-based optimization algorithm (COA) is a method to optimize possibly nonlinear complex functions of several variables by chaos search. The main innovation behind the chaos-based optimization algorithm is to generate chaotic trajectories by means of nonlinear, discrete-time dynamical systems to explore the search space while looking for the global minimum of a complex criterion function. The aim of the present research is to investigate the numerical properties of the COA, both on complex optimization test-functions from the literature and on a real-world problem, to contribute to the understanding of its global-search features. In addition, the present research suggests a refinement of the original COA algorithm to improve its optimization performances. In particular, the real-world optimization problem tackled within the paper is the estimation of six electro-mechanical parameters of a model of a direct-current (DC) electrical motor. A large number of test results prove that the algorithm achieves an excellent numerical precision at a little expense in the computational complexity, which appears as extremely limited, compared to the complexity of other benchmark optimization algorithms, namely, the genetic algorithm and the simulated annealing algorithm. [ABSTRACT FROM AUTHOR]

The ability to characterize and predict extreme events is a vital topic in fields ranging from finance to ocean engineering. Typically, the most-extreme events are also the most-rare, and it is this property that makes data collection and direct simulation challenging. We consider the problem of deriving optimal predictors of extremes directly from data characterizing a complex system, by formulating the problem in the context of binary classification. Specifically, we assume that a training dataset consists of: (i) indicator time series specifying on whether or not an extreme event occurs; and (ii) observables time series, which are employed to formulate efficient predictors. We employ and assess standard binary classification criteria for the selection of optimal predictors, such as total and balanced error and area under the curve, in the context of extreme event prediction. For physical systems for which there is sufficient separation between the extreme and regular events, i.e., extremes are distinguishably larger compared with regular events, we prove the existence of optimal extreme event thresholds that lead to efficient predictors. Moreover, motivated by the special character of extreme events, i.e., the very low rate of occurrence, we formulate a new objective function for the selection of predictors. This objective is constructed from the same principles as receiver operating characteristic curves, and exhibits a geometric connection to the regime separation property. We demonstrate the application of the new selection criterion to the advance prediction of intermittent extreme events in two challenging complex systems: the Majda–McLaughlin–Tabak model, a 1D nonlinear, dispersive wave model, and the 2D Kolmogorov flow model, which exhibits extreme dissipation events.

We examine the quantum-classical correspondence from a classical perspective by discussing the potential for chaotic systems to support behaviors normally associated with quantum mechanical systems. Our main analytical tool is a chaotic system’s set of cupolets, which are highly-accurate stabilizations of its unstable periodic orbits. Our discussion is motivated by the bound or entangled states that we have recently detected between interacting chaotic systems, wherein pairs of cupolets are induced into a state of mutually-sustaining stabilization that can be maintained without external controls. This state is known as chaotic entanglement as it has been shown to exhibit several properties consistent with quantum entanglement. For instance, should the interaction be disturbed, the chaotic entanglement would then be broken. In this paper, we further describe chaotic entanglement and go on to address the capacity for chaotic systems to exhibit other characteristics that are conventionally associated with quantum mechanics, namely analogs to wave function collapse, various entropy definitions, the superposition of states, and the measurement problem. In doing so, we argue that these characteristics need not be regarded exclusively as quantum mechanical. We also discuss several characteristics of quantum systems that are not fully compatible with chaotic entanglement and that make quantum entanglement unique.

In this research article, we propose a new structure namely inverse left almost semigroup (LA-semigroup) by adding confusion in our proposed image encryption scheme along with discrete and continuous chaotic systems in order to complement the diffusion characteristics. The performance analysis was conducted in terms of the correlation analysis, the pixels uniformity analysis, the sensitivity analysis, the information entropy analysis, and pixels difference based measurements. The results show that the proposed algorithm has better information security properties, which can provide strong security and a high performance.

The chaos-based optimization algorithm (COA) is a method to optimize possibly nonlinear complex functions of several variables by chaos search. The main innovation behind the chaos-based optimization algorithm is to generate chaotic trajectories by means of nonlinear, discrete-time dynamical systems to explore the search space while looking for the global minimum of a complex criterion function. The aim of the present research is to investigate the numerical properties of the COA, both on complex optimization test-functions from the literature and on a real-world problem, to contribute to the understanding of its global-search features. In addition, the present research suggests a refinement of the original COA algorithm to improve its optimization performances. In particular, the real-world optimization problem tackled within the paper is the estimation of six electro-mechanical parameters of a model of a direct-current (DC) electrical motor. A large number of test results prove that the algorithm achieves an excellent numerical precision at a little expense in the computational complexity, which appears as extremely limited, compared to the complexity of other benchmark optimization algorithms, namely, the genetic algorithm and the simulated annealing algorithm.

This paper provides a new approach for the analysis and eventually the classification of dynamical systems. The objective is pursued by extending the concept of the entropy of plane curves, first introduced within the theory of the thermodynamics of plane curves, to Rn space. Such a generalised entropy of a curve is used to evaluate curves that are obtained by connecting several points in the phase space. As the points change their coordinates according to the equations of a dynamical system, the entropy of the curve connecting them is used to infer the behaviour of the underlying dynamics. According to the proposed method all linear dynamical systems evolve at constant zero entropy, while higher asymptotic values characterise nonlinear systems. The approach proves to be particularly efficient when applied to chaotic systems, in which case it has common features with other classic approaches. Performances of the proposed method are tested over several benchmark problems.

This paper provides a new approach for the analysis and eventually the classification of dynamical systems. The objective is pursued by extending the concept of the entropy of plane curves, first introduced within the theory of the thermodynamics of plane curves, to ℝn space. Such a generalised entropy of a curve is used to evaluate curves that are obtained by connecting several points in the phase space. As the points change their coordinates according to the equations of a dynamical system, the entropy of the curve connecting them is used to infer the behaviour of the underlying dynamics. According to the proposed method all linear dynamical systems evolve at constant zero entropy, while higher asymptotic values characterise nonlinear systems. The approach proves to be particularly efficient when applied to chaotic systems, in which case it has common features with other classic approaches. Performances of the proposed method are tested over several benchmark problems. [ABSTRACT FROM AUTHOR]

In chaotic entanglement, pairs of interacting classically-chaotic systems are induced into a state of mutual stabilization that can be maintained without external controls and that exhibits several properties consistent with quantum entanglement. In such a state, the chaotic behavior of each system is stabilized onto one of the system's many unstable periodic orbits (generally located densely on the associated attractor), and the ensuing periodicity of each system is sustained by the symbolic dynamics of its partner system, and vice versa. Notably, chaotic entanglement is an entropy-reversing event: the entropy of each member of an entangled pair decreases to zero when each system collapses onto a given period orbit. In this paper, we discuss the role that entropy plays in chaotic entanglement. We also describe the geometry that arises when pairs of entangled chaotic systems organize into coherent structures that range in complexity from simple tripartite lattices to more involved patterns. We conclude with a discussion of future research directions. [ABSTRACT FROM AUTHOR]

To address the problems of the high complexity and low security of the existing image encryption algorithms, this paper proposes a dynamic key chaotic image encryption algorithm with low complexity and high security associated with plaintext. Firstly, the RGB components of the color image are read, and the RGB components are normalized to obtain the key that is closely related to the plaintext, and then the Arnold transform is used to stretch and fold the RGB components of the color image to change the position of the pixel points in space, so as to destroy the correlation between the adjacent pixel points of the image. Next, the generated sequences are independently encrypted with the Arnold-transformed RGB matrix. Finally, the three encrypted images are combined to obtain the final encrypted image. Since the key acquisition of this encryption algorithm is related to the plaintext, it is possible to achieve one key per image, so the key acquisition is dynamic. This encryption algorithm introduces chaotic mapping, so that the key space size is 10 180 . The key acquisition is closely related to the plaintext, which makes the ciphertext more random and resistant to differential attacks, and ensures that the ciphertext is more secure after encryption. The experiments show that the algorithm can encrypt the image effectively and can resist attack on the encrypted image. [ABSTRACT FROM AUTHOR]

In this paper, the stabilization and synchronization of a complex hidden chaotic attractor is shown. This article begins with the dynamic analysis of a complex Lorenz chaotic system considering the vector field properties of the analyzed system in the C n domain. Then, considering first the original domain of attraction of the complex Lorenz chaotic system in the equilibrium point, by using the required set topology of this domain of attraction, one hidden chaotic attractor is found by finding the intersection of two sets in which two of the parameters, r and b, can be varied in order to find hidden chaotic attractors. Then, a backstepping controller is derived by selecting extra state variables and establishing the required Lyapunov functionals in a recursive methodology. For the control synchronization law, a similar procedure is implemented, but this time, taking into consideration the error variable which comprise the difference of the response system and drive system, to synchronize the response system with the original drive system which is the original complex Lorenz system. [ABSTRACT FROM AUTHOR]

In order to obtain chaos with a wider chaotic scope and better chaotic behavior, this paper combines the several existing one-dimensional chaos and forms a new one-dimensional chaotic map by using a modular operation which is named by LLS system and abbreviated as LLSS. To get a better encryption effect, a new image encryption method based on double chaos and DNA coding technology is proposed in this paper. A new one-dimensional chaotic map is combined with a hyperchaotic Qi system to encrypt by using DNA coding. The first stage involves three rounds of scrambling; a diffusion algorithm is applied to the plaintext image, and then the intermediate ciphertext image is partitioned. The final encrypted image is formed by using DNA operation. Experimental simulation and security analysis show that this algorithm increases the key space, has high sensitivity, and can resist several common attacks. At the same time, the algorithm in this paper can reduce the correlation between adjacent pixels, making it close to 0, and increase the information entropy, making it close to the ideal value and achieving a good encryption effect. [ABSTRACT FROM AUTHOR]

The ability to characterize and predict extreme events is a vital topic in fields ranging from finance to ocean engineering. Typically, the most-extreme events are also the most-rare, and it is this property that makes data collection and direct simulation challenging. We consider the problem of deriving optimal predictors of extremes directly from data characterizing a complex system, by formulating the problem in the context of binary classification. Specifically, we assume that a training dataset consists of: (i) indicator time series specifying on whether or not an extreme event occurs; and (ii) observables time series, which are employed to formulate efficient predictors. We employ and assess standard binary classification criteria for the selection of optimal predictors, such as total and balanced error and area under the curve, in the context of extreme event prediction. For physical systems for which there is sufficient separation between the extreme and regular events, i.e., extremes are distinguishably larger compared with regular events, we prove the existence of optimal extreme event thresholds that lead to efficient predictors. Moreover, motivated by the special character of extreme events, i.e., the very low rate of occurrence, we formulate a new objective function for the selection of predictors. This objective is constructed from the same principles as receiver operating characteristic curves, and exhibits a geometric connection to the regime separation property. We demonstrate the application of the new selection criterion to the advance prediction of intermittent extreme events in two challenging complex systems: the Majda–McLaughlin–Tabak model, a 1D nonlinear, dispersive wave model, and the 2D Kolmogorov flow model, which exhibits extreme dissipation events. [ABSTRACT FROM AUTHOR]

We examine the quantum-classical correspondence from a classical perspective by discussing the potential for chaotic systems to support behaviors normally associated with quantum mechanical systems. Our main analytical tool is a chaotic system's set of cupolets, which are highly-accurate stabilizations of its unstable periodic orbits. Our discussion is motivated by the bound or entangled states that we have recently detected between interacting chaotic systems, wherein pairs of cupolets are induced into a state of mutually-sustaining stabilization that can be maintained without external controls. This state is known as chaotic entanglement as it has been shown to exhibit several properties consistent with quantum entanglement. For instance, should the interaction be disturbed, the chaotic entanglement would then be broken. In this paper, we further describe chaotic entanglement and go on to address the capacity for chaotic systems to exhibit other characteristics that are conventionally associated with quantum mechanics, namely analogs to wave function collapse, various entropy definitions, the superposition of states, and the measurement problem. In doing so, we argue that these characteristics need not be regarded exclusively as quantum mechanical. We also discuss several characteristics of quantum systems that are not fully compatible with chaotic entanglement and that make quantum entanglement unique. [ABSTRACT FROM AUTHOR]

In this research article, we propose a new structure namely inverse left almost semigroup (LA-semigroup) by adding confusion in our proposed image encryption scheme along with discrete and continuous chaotic systems in order to complement the diffusion characteristics. The performance analysis was conducted in terms of the correlation analysis, the pixels uniformity analysis, the sensitivity analysis, the information entropy analysis, and pixels difference based measurements. The results show that the proposed algorithm has better information security properties, which can provide strong security and a high performance. [ABSTRACT FROM AUTHOR]