An Inter-Component Pixels Permutation Based Color Image Encryption Using Hyper-chaos

Abstract

In this paper, a simple and robust color image encryption algorithm based on high-dimensional chaotic maps is proposed. The algorithm employs a 3D Arnold transform to perform inter-component shuffling of plain-image, while a 2D hyper-chaotic map is used to confuse the relationship between the encrypted image and plain-image. The control parameters of Arnold transform are extracted from pending plain-image, thereby establishing a dependency to the plain-image. The confusion process is carried out in cipher-block chaining mode to make it dependent to the encrypted image. This makes the algorithm able to resist the cryptographic attacks. The performance of the proposed algorithm is analyzed through computer simulations. The experimental analyses show that the proposed algorithm has desirable properties of high security, robustness to cryptographic attacks and practicability to protect multimedia color images.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…