Multiple-Image Encryption Algorithm Based on the 3D Permutation Model and Chaotic System

Xiaoqiang Zhang, Xuesong WangSymmetry 2018 · DOI

TL;DR

This paper introduces a novel multiple-image encryption algorithm that leverages a 3D permutation model inspired by Rubik's cubes and chaotic systems. This approach aims to enhance the security and efficiency of encrypting multiple digital images simultaneously, addressing the growing need for robust image protection in the digital age.

What Problem Does This Paper Address?

The proliferation of digital images across various fields, from surveillance and healthcare to e-commerce, has created a critical need for secure image encryption. While single-image encryption algorithms exist, they are insufficient for handling the sheer volume and interconnectedness of modern image data. Existing multiple-image encryption (MIE) techniques often focus on optical images or have limitations in terms of security, efficiency, or the number of images they can process. This paper tackles the challenge of developing a secure, efficient, and versatile MIE algorithm capable of encrypting multiple digital images simultaneously.

Methods

The core of this work lies in two main components:

  • 3D Permutation Model: Inspired by the mechanics of a Rubik's cube, the authors propose a 3D permutation model. This model treats multiple input images as layers of a 3D "image cube." It introduces three distinct permutation modes:
  • Internal-row mode: Permutes pixels within each row of an individual image.
  • Internal-column mode: Permutes pixels within each column of an individual image.
  • External mode: Permutes pixel positions across all input images. These permutation operations are controlled by chaotic sequences generated from chaotic systems.

  • Chaotic System Integration: The algorithm utilizes two types of chaotic systems:

  • 2D Logistic Map: Generates chaotic sequences for pixel value diffusion and for controlling the external permutation mode.
  • Piece-Wise Linear Chaotic Map (PWLCM): Generates chaotic sequences to control the internal-row and internal-column permutation modes. The encryption process involves scrambling the images using the 3D permutation model and then diffusing the permuted images using an XOR operation with a chaotic image.

Datasets

The authors used nine plain images of size 512x512 for their experiments. These images are presented in Figure 6 and include subjects like "Tree," "Tiger," "House," "Flower," "Building," "Road," "Ship," "Boy," and "Machine." The paper does not introduce new benchmark datasets.

Key Insights and Ideas

  • Rubik's Cube Analogy for Image Permutation: The novel application of a 3D permutation model, inspired by the complex rotations of a Rubik's cube, offers a structured and multi-faceted approach to scrambling image pixels across multiple images.
  • Synergy of 3D Permutation and Chaos: The combination of a sophisticated 3D permutation strategy with the inherent unpredictability of chaotic systems creates a powerful encryption mechanism. The chaotic sequences ensure that even small changes in the input keys lead to drastically different encrypted outputs.
  • Versatility in Permutation Modes: The three distinct permutation modes (internal-row, internal-column, and external) provide flexibility and allow for different scrambling strategies, potentially enhancing security by avoiding predictable patterns.
  • Lossless Decryption: A crucial aspect highlighted is that the proposed algorithm achieves lossless decryption, meaning the original images can be perfectly recovered, which is essential for many applications.

Key Results

  • Security: The proposed algorithm demonstrates strong security, as evidenced by its desirable histogram analysis (uniform distribution of pixel values in encrypted images) and low correlation coefficients between adjacent pixels in the encrypted images (close to zero).
  • Efficiency: The algorithm is reported to be efficient, with an encryption time of 8.7202 seconds for nine 512x512 images, making it competitive with or superior to several compared algorithms.
  • Key Space: The algorithm boasts a large key space (10^160), making brute-force attacks computationally infeasible.
  • Differential Attack Resistance: The algorithm shows strong resistance to differential attacks, with high NPCR (Number of Pixels Change Rate) and UACI (Unified Average Changing Intensity) values.

Limitations and Future Work

  • Computational Complexity: While efficient, the computational complexity for the proposed algorithm is noted as approximately kmn(3S+X), where k is the number of images, and m×n is their size. For a large number of images or very high-resolution images, this could still be significant.
  • Comparison Scope: The paper compares the proposed algorithm with eight other MIE algorithms. While this is a good range, further comparisons with more recent or specialized MIE techniques could provide additional context.
  • Future Work: The authors suggest that future research could explore more complex chaotic systems or investigate the application of this 3D permutation model in other cryptographic contexts. The paper also implicitly points towards the potential for optimizing the computational complexity further.

Summary updated

BibTeX
@article{zhang2018multiple,
  author = {Xiaoqiang Zhang and Xuesong Wang},
  title = {{Multiple-Image Encryption Algorithm Based on the 3D Permutation Model and Chaotic System}},
  journal = {Symmetry},
  year = {2018},
  doi = {10.3390/sym10110660},
}
Figure