Integrated chaotic systems for image encryption

Lan, Rushi; He, Jinwen; Wang, Shouhua; Gu, Tao; Luo, Xiliang

doi:10.1016/j.sigpro.2018.01.026

Cited by 211 publications

(80 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the semantic characteristics change, the histogram is the same as the original image. Arnold transform is also called an image encryption technique that is sensitive to initial values and resistant to differential attacks [36,37]. In general, Arnold transform is mostly done on two-dimensional matrices that are defined as in Eq.…”

Section: Arnold Transformmentioning

confidence: 99%

An Image Watermarking Method Using Discrete Tchebichef Transform and Singular Value Decomposition Based on Chaos Embedding

Setyono¹,

Setiadi²

2020

IJIES

View full text Add to dashboard Cite

A good watermarking method should be robust against attacks but have good visual quality. This research proposes a combination of two transformations i.e. Tchebichef and singular value decomposition (SVD). Arnold's algorithm is also integrated to improve the security of the watermark and visual quality of the watermarked image. Arnold's transformation was carried out on the cover image with the aim to spread watermark. Furthermore, the cover image is divided into small blocks and transformed using Tchebichef. The lowest coefficient of each Tchebichef block is collected in a matrix for decomposition with SVD, then the watermark is embedded in the singular matrix. Based on the results of testing the proposed method can have excellent visual quality with PSNR values ranging from 45dB and SSIM averaging 0.998. The proposed method is also robust to various attacks such as filtering, noise addition, geometry, and signal processing.

show abstract

Section: Arnold Transformmentioning

confidence: 99%

An Image Watermarking Method Using Discrete Tchebichef Transform and Singular Value Decomposition Based on Chaos Embedding

Setyono¹,

Setiadi²

2020

IJIES

View full text Add to dashboard Cite

show abstract

“…High dimension chaotic systems possess complex chaotic behavior, while 1D chaotic systems are convenient for implementation. Under synthetical consideration, some combined chaotic maps have been explored in recent encryption schemes [2,[9][10][11][12]. Just resembling the series-parallel connection of resistors in circuits, these chaotic maps are a combination or adjustment of the original chaotic maps.…”

Section: Introductionmentioning

confidence: 99%

An Image Encryption Algorithm Based on Random Hamiltonian Path

Zhang

Shu-wen

Han

et al. 2020

Entropy

View full text Add to dashboard Cite

In graph theory, Hamiltonian path refers to the path that visits each vertex exactly once. In this paper, we designed a method to generate random Hamiltonian path within digital images, which is equivalent to permutation in image encryption. By these means, building a Hamiltonian path across bit planes can shuffle the distribution of the pixel’s bits. Furthermore, a similar thought can be applied for the substitution of pixel’s grey levels. To ensure the randomness of the generated Hamiltonian path, an adjusted Bernoulli map is proposed. By adopting these novel techniques, a bit-level image encryption scheme was devised. Evaluation of simulation results proves that the proposed scheme reached fair performance. In addition, a common flaw in calculating correlation coefficients of adjacent pixels was pinpointed by us. After enhancement, correlation coefficient becomes a stricter criterion for image encryption algorithms.

show abstract

“…Although the results show that both the pixel correlation and structural similarity index metrics are good, it has poor ability for noise attack. Lan et al combine the sharing matrix and image encryption for lossless (k, n)secret image sharing [27]. is approach introduces the (k, n) sharing matrix producing algorithm, and it combines the sharing matrix with chaos encryption to do image encryption.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Based on High-Dimensional Manifold Computing and Block Dividing Algorithm

Jia

2020

International Journal of Optics

View full text Add to dashboard Cite

The image encryption schemes developing more sensitive and more chaotic maps are used as a key sequence generator, such as cascade chaotic maps and high-dimension maps. High-dimension chaotic maps can generate sequences with little correlation after hundred times of iteration. In fact, the sequence is just a flow of the manifold of the chaotic system. A fast way to select sensitive flows of the dynamic systems is introduced in the paper. Combining with the divided blocks diffusion algorithm, the novel scheme yields the cipher image more randomly. Experimental results show that the sensitive flows of the high-dimension system can generate a series with better ergodicity and less correlation compared with the common flows of the same system. The encryption efficiency is enhanced by choosing the sensitive flows of the high-dimension system. The analysis proved that the novel image encryption scheme can resist all common kinds of attacks.

show abstract

Integrated chaotic systems for image encryption

Cited by 211 publications

References 40 publications

An Image Watermarking Method Using Discrete Tchebichef Transform and Singular Value Decomposition Based on Chaos Embedding

An Image Watermarking Method Using Discrete Tchebichef Transform and Singular Value Decomposition Based on Chaos Embedding

An Image Encryption Algorithm Based on Random Hamiltonian Path

Image Encryption Based on High-Dimensional Manifold Computing and Block Dividing Algorithm

Contact Info

Product

Resources

About