•We present a two-dimensional (2D) Logistic-Sine-coupling map (2D-LSCM). Performance estimations demonstrate that it has better ergodicity, more complex chaotic behavior and larger chaotic range than ...several newly developed 2D chaotic maps.•Using 2D-LSCM, we further propose a 2D-LSCM-based image encryption algorithm (LSCM-IEA).•A novel permutation algorithm is designed to fast permutate image pixels while a diffusion algorithm is developed to spread little change of plain-image to the whole encrypted result.•Security analysis demonstrates that LSCM-IEA has a high security level and can outperform several advanced image encryption algorithms.
Image encryption is a straightforward strategy to protect digital images by transforming images into unrecognized ones. The chaos theory is a widely used technology for image encryption as it has many significant properties such as ergodicity and initial state sensitivity. When chaotic systems are used in image encryption, their chaos performance highly determines the security level. This paper presents a two-dimensional (2D) Logistic-Sine-coupling map (LSCM). Performance estimations demonstrate that it has better ergodicity, more complex behavior and larger chaotic range than several newly developed 2D chaotic maps. Utilizing the proposed 2D-LSCM, we further propose a 2D-LSCM-based image encryption algorithm (LSCM-IEA), which adopts the classical confusion-diffusion structure. A permutation algorithm is designed to permutate image pixels to different rows and columns while a diffusion algorithm is developed to spread few changes of plain-image to the whole encrypted result. We compare the efficiency of LSCM-IEA with several advanced algorithms and the results show that it has higher encryption efficiency. To show the superiority of LSCM-IEA, we also analyze the security of LSCM-IEA in terms of key security, ability of defending differential attack, local Shannon entropy and contrast analysis. The analysis results demonstrate that LSCM-IEA has better security performance than several existing algorithms.
Recently, many image encryption schemes have been developed using Latin squares. When encrypting a color image, these algorithms treat the color image as three greyscale images and encrypt these ...greyscale images one by one using the Latin squares. Obviously, these algorithms do not sufficiently consider the inner connections between the color image and Latin square and thus result in many redundant operations and low efficiency. To address this issue, in this paper, we propose a new color image encryption algorithm (CIEA) that sufficiently considers the properties of the color image and Latin square. First, we propose a two-dimensional chaotic system called 2D-LSM to address the weaknesses of existing chaotic systems. Then, we design a new CIEA using orthogonal Latin squares and 2D-LSM. The proposed CIEA can make full use of the inherent connections of the orthogonal Latin squares and color image and executes the encryption process in the pixel level. Simulation and security analysis results show that the proposed CIEA has a high level of security and can outperform some representative image encryption algorithms.
Since a substitution box (
S
-box) is the nonlinearity part of a symmetric key encryption scheme, it directly determines the performance and security level of the encryption scheme. Thus, generating
...S
-box with high performance and efficiency is attracting. This paper proposes a novel method to construct
S
-box using the complete Latin square and chaotic system. First, a complete Latin square is generated using the chaotic sequences produced by a chaotic system. Then an
S
-box is constructed using the complete Latin square. Performance analyses show that the
S
-box generated by our proposed method has a high performance and can achieve strong ability to resist many security attacks such as the linear attack, differential attack and so on. To show the efficiency of the constructed
S
-box, this paper further applies the
S
-box to image encryption application. Security analyses show that the developed image encryption algorithm is able to encrypt different kinds of images into cipher images with uniformly distributed histograms. Performance evaluations demonstrate that it has a high security level and can outperform several state-of-the-art encryption algorithms.
As chaotic dynamics is widely used in nonlinear control, synchronization communication, and many other applications, designing chaotic maps with complex chaotic behaviors is attractive. This paper ...proposes a sine-transform-based chaotic system (STBCS) of generating one-dimensional (1-D) chaotic maps. It performs a sine transform to the combination of the outputs of two existing chaotic maps (seed maps). Users have the flexibility to choose any existing 1-D chaotic maps as seed maps in STBCS to generate a large number of new chaotic maps. The complex chaotic behavior of STBCS is verified using the principle of Lypunov exponent. To show the usability and effectiveness of STBCS, we provide three new chaotic maps as examples. Theoretical analysis shows that these chaotic maps have complex dynamics properties and robust chaos. Performance evaluations demonstrate that they have much larger chaotic ranges, better complexity, and unpredictability, compared with chaotic maps generated by other methods and the corresponding seed maps. Moreover, to show the simplicity of STBCS in hardware implementation, we simulate the three new chaotic maps using the field-programmable gate array (FPGA).
This paper proposes a general framework of 1-D chaotic maps called the dynamic parameter-control chaotic system (DPCCS). It has a simple but effective structure that uses the outputs of a chaotic map ...(control map) to dynamically control the parameter of another chaotic map (seed map). Using any existing 1-D chaotic map as the control/seed map (or both), DPCCS is able to produce a huge number of new chaotic maps. Evaluations and comparisons show that chaotic maps generated by DPCCS are very sensitive to their initial states, and have wider chaotic ranges, better unpredictability and more complex chaotic behaviors than their seed maps. Using a chaotic map of DPCCS as an example, we provide a field-programmable gate array design of this chaotic map to show the simplicity of DPCCS in hardware implementation, and introduce a new pseudo-random number generator (PRNG) to investigate the applications of DPCCS. Analysis and testing results demonstrate the excellent randomness of the proposed PRNG.
Because of the excellent properties of unpredictability, ergodicity and sensitivity to their parameters and initial values, chaotic maps are widely used in security applications. In this paper, we ...introduce a new two-dimensional Sine Logistic modulation map (2D-SLMM) which is derived from the Logistic and Sine maps. Compared with existing chaotic maps, it has the wider chaotic range, better ergodicity, hyperchaotic property and relatively low implementation cost. To investigate its applications, we propose a chaotic magic transform (CMT) to efficiently change the image pixel positions. Combining 2D-SLMM with CMT, we further introduce a new image encryption algorithm. Simulation results and security analysis demonstrate that the proposed algorithm is able to protect images with low time complexity and a high security level as well as to resist various attacks.
Image encryption is an efficient technique to protect the contents of an image. However, many existing image encryption algorithms have low efficiency and are weak to resist many commonly used ...security attacks such as the chosen-plaintext attack. To address these issues, in this paper, we propose a new image encryption scheme using value-differencing transformation (VDT) and modified ZigZag transformation. First, we propose a new transform called VDT. It can split a plain image into four subbands based on value-differencing and this can greatly help to diffuse the image pixels. Second, we develop a modified ZigZag transformation that can separate the image pixels with a much higher efficiency. Besides, to improve the ability to defense the chosen-plaintext attack, we extract part information of plain image as parameters to encrypt the image. Notice that these information don’t need when decrypting the image so that the proposed image encryption scheme is a symmetric key encryption algorithm. Simulation results and security analysis show that the proposed image encryption scheme can encrypt different kinds of plain images into unrecognized cipher images with a high security level, and it can outperform several existing image encryption schemes.
Image encryption is an efficient visual technology to protect private images. This paper develops an image encryption algorithm utilizing the principles of the Josephus problem and the filtering ...technology. The encryption algorithm follows the classical diffusion and confusion structure. The principle of Josephus problem is used to shuffle the image pixels to different positions to achieve the confusion property. Using a randomly generated filter, the filtering technology can spread slight changes of the original image to all pixels of the cipher image to obtain diffusion property. The simulation results show that the developed image encryption algorithm is able to encrypt different kinds of images into cipher images with uniform distribution. The security analysis demonstrates that it has an extremely sensitive secret key, can resist various security attacks, and has a better performance than several advanced image encryption algorithms.
The Hindmarsh–Rose (HR) neuron model is built to describe the neuron electrical activities. Due to the polynomial nonlinearities, multipliers are required to implement the HR neuron model in analog. ...In order to avoid the multipliers, this brief presents a novel smooth nonlinear fitting scheme. We first construct two nonlinear fitting functions using the composite hyperbolic tangent functions and then implement an analog multiplierless circuit for the two-dimensional (2D) and three-dimensional (3D) HR neuron models. To exhibit the nonlinear fitting effects, numerical simulations and hardware experiments for the fitted HR neuron model are provided successively. The results show that the fitted HR neuron model with analog multiplierless circuit can display different operation patterns of resting, periodic spiking, and periodic/chaotic bursting, entirely behaving like the original HR neuron model. The analog multiplierless circuit has the advantage of low implementation cost and thereby it is suitable for hardware implementation of large-scale neural networks.
Bursting is a diverse and common phenomenon in neuronal activation patterns and it indicates that fast action voltage spiking periods are followed by resting periods. The interspike interval (ISI) is ...the time between successive action voltage spikes of neuron and it is a key indicator used to characterize the bursting. Recently, a three-dimensional memristive Hindmarsh-Rose (mHR) neuron model was constructed to generate hidden chaotic bursting. However, the properties of the discrete mHR neuron model have not been investigated, yet. In this article, we first construct a discrete mHR neuron model and then acquire different hidden chaotic bursting sequences under four typical sets of parameters. To make these sequences more suitable for the application, we further encode these hidden chaotic sequences using their ISIs and the performance comparative results show that the ISI-encoded chaotic sequences have much more complex chaos properties than the original sequences. In addition, we apply these ISI-encoded chaotic sequences to the application of image encryption. The image encryption scheme has a symmetric key structure and contains plain-text permutation and bidirectional diffusion processes. Experimental results and security analyses prove that it has excellent robustness against various possible attacks.
PDF
