Image encryption by chaos mixing

Abanda, Yannick; Tiedeu, Alain

doi:10.1049/iet-ipr.2015.0244

Cited by 82 publications

(49 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In terms of the key space, it should be larger than 2 100 to defend from a brute force attack [9]. The key space of this work is larger than Ref [1,8,31,44,47], but smaller than the scheme in [10]. However the NPCR and UACI values in Ref [10] are smaller.…”

Section: Speed Analysis and Comparisonsmentioning

confidence: 90%

“…However the NPCR and UACI values in Ref [10] are smaller. In addition, the proposed algorithm is faster than [1,10,31,44,47], but slower than [8]. Although the algorithm in the approach of [8] only takes 3.41ms for encryption, however this time is only for one round encryption.…”

Section: Speed Analysis and Comparisonsmentioning

confidence: 96%

“…In this approach, the quantitative measures of NPCR and UACI are calculated for five different plain-images, and their results are shown in Table 4. The tested pixels are all at (1,1) in each image.…”

Section: Differential Attackmentioning

confidence: 99%

See 2 more Smart Citations

A parallel image encryption algorithm based on the piecewise linear chaotic map and hyper-chaotic map

et al. 2018

View full text Add to dashboard Cite

This paper proposes a parallel digital image encryption algorithm based on a piecewise linear chaotic map (PWLCM) and a four-dimensional hyper-chaotic map (FDHCM). Firstly, two decimals are obtained based on the plain-image and external keys, using a novel parallel quantification method. They are used as the initial value and control parameter for the PWLCM. Then, an encryption matrix and four chaotic sequences are constructed using the PWLCM and FDHCM, which control the permutation and diffusion processes. The proposed algorithm is implemented and tested in parallel based on a Graphics Processing Unit (GPU) device. Numerical analysis and experimental results show that the proposed algorithm achieves a high encryption speed and a good security performance, which provides a potential solution for real-time image encryption applications.

show abstract

Section: Speed Analysis and Comparisonsmentioning

confidence: 90%

Section: Speed Analysis and Comparisonsmentioning

confidence: 96%

See 1 more Smart Citation

A parallel image encryption algorithm based on the piecewise linear chaotic map and hyper-chaotic map

et al. 2018

View full text Add to dashboard Cite

show abstract

“…In another work, Wang et al [24] used two chaotic systems to develop a hybrid color image encryption scheme. In [25], Abanda and Tiedeu proposed a fast and simple image encryption algorithm by combining two kinds of chaotic maps to meet real-time application. Belazi et al [26] presented a novel selective image encryption by using DWT with AES s-box and chaotic permutation.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption with Double Spiral Scans and Chaotic Maps

Tang

Yang

Shijie

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

Image encryption is a useful technique of image content protection. In this paper, we propose a novel image encryption algorithm by jointly exploiting random overlapping block partition, double spiral scans, Henon chaotic map, and Lü chaotic map. Specifically, the input image is first divided into overlapping blocks and pixels of every block are scrambled via double spiral scans. During spiral scans, the start-point is randomly selected under the control of Henon chaotic map. Next, image content based secret keys are generated and used to control the Lü chaotic map for calculating a secret matrix with the same size of input image. Finally, the encrypted image is obtained by calculating XOR operation between the corresponding elements of the scrambled image and the secret matrix. Experimental result shows that the proposed algorithm has good encrypted results and outperforms some popular encryption algorithms.

show abstract

“…Colpitts oscillators are used in many fields such as radars, sensors, convertors, chaos generators, encryption, etc. [1][2][3][4][5]. Due to their wide range of applications, they have attracted more attention in recent years.…”

Section: Introductionmentioning

confidence: 99%

Design of optimised backstepping controller for the synchronisation of chaotic Colpitts oscillator using shark smell algorithm

Fouladi

Mojallali

2017

Pramana - J Phys

View full text Add to dashboard Cite

In this paper, an adaptive backstepping controller has been tuned to synchronise two chaotic Colpitts oscillators in a master-slave configuration. The parameters of the controller are determined using shark smell optimisation (SSO) algorithm. Numerical results are presented and compared with those of particle swarm optimisation (PSO) algorithm. Simulation results show better performance in terms of accuracy and convergence for the proposed optimised method compared to PSO optimised controller or any non-optimised backstepping controller.

show abstract

Image encryption by chaos mixing

Cited by 82 publications

References 31 publications

A parallel image encryption algorithm based on the piecewise linear chaotic map and hyper-chaotic map

A parallel image encryption algorithm based on the piecewise linear chaotic map and hyper-chaotic map

Image Encryption with Double Spiral Scans and Chaotic Maps

Design of optimised backstepping controller for the synchronisation of chaotic Colpitts oscillator using shark smell algorithm

Contact Info

Product

Resources

About