Fast and Secure Image Encryption Algorithm with Simultaneous Shuffling and Diffusion Based on a Time-Delayed Combinatorial Hyperchaos Map

Yu-jie, Shen; Huang, Jun; Wen, Tao; Li, Tangyan; Zhang, Guidong

doi:10.3390/e25050753

Cited by 10 publications

(5 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 2 highlights the key space comparison of the proposed quantum image encryption scheme with other recently presented schemes [2,10,20,60,63]. Based on the comparison results, it can be concluded that the proposed scheme provides better security than its competitors when transmitting images through unsecured communication channels.…”

Section: Key Security Analysis Key Space Analysismentioning

confidence: 97%

Mixed Multi-Chaos Quantum Image Encryption Scheme Based on Quantum Cellular Automata (QCA)

Mohamed,

El-Sayed,

Youssif

2023

Fractal Fract

View full text Add to dashboard Cite

The advent of quantum computers could enable the resolution of complex computational problems that conventional cryptographic protocols find challenging. As a result, the formidable computing capabilities of quantum computers may render all present-day cryptographic schemes that rely on computational complexity ineffectual. Inspired by these possibilities, the primary purpose of this paper is to suggest a quantum image encryption scheme based on quantum cellular automata with mixed multi-chaos hybrid maps and a hyperchaotic system with quantum operations. To achieve desirable encryption outcomes, we designed an encryption scheme involving two main operations: (1) pixel-level diffusion and (2) pixel-level permutation. Initially, the secret keys generated using the hyperchaotic system were closely tied to the original image. During the first phase, the establishment of correlations among the image pixels, in addition to the three chaotic sequences obtained from the hyperchaotic system, was achieved with the application of a quantum-state superposition and measurement principle, wherein the color information of a pixel is described using a single qubit. Therefore, the three channels of the plain image were subjected to quantum operations, which involve Hadamard transformation and the quantum-controlled NOT gate, before the diffusion of each color channel with the hyperchaotic system. Subsequently, a quantum ternary Toffoli gate was used to perform the diffusion operation. Next, the appropriate measurement was performed on the three diffused channels. To attain the confusion phase, a blend of mixed multi-chaos hybrid maps and a two-dimensional quantum cellular automaton was used to produce random and chaotic sequence keys. Subsequently, the circular shift was utilized to additionally shuffle the rows and columns of the three diffused components, in order to alter the positions of their pixel values, which significantly contributes to the permutation process. Lastly, the three encoding channels, R, G, and B, were merged to acquire the encrypted image. The experimental findings and security analyses established that the designed quantum image encryption scheme possesses excellent encryption efficiency, a high degree of security, and the ability to effectively withstand a diverse variety of statistical attacks.

show abstract

Section: Key Security Analysis Key Space Analysismentioning

confidence: 97%

Mixed Multi-Chaos Quantum Image Encryption Scheme Based on Quantum Cellular Automata (QCA)

Mohamed,

El-Sayed,

Youssif

2023

Fractal Fract

View full text Add to dashboard Cite

show abstract

“…For one iteration cycle, the suggested scheme's key space value ≈2 540 is obtained. The traditional algorithm [13,16,18,23,24,25,26] has lower key space, and schemes [17,27] have larger key space values than the proposed algorithms. The scheme [13,16,17,18,23,24,25,26] has achieved its optimal key space value of 2 100 after several rounds of iteration, whereas the proposed Scheme 1 and Scheme 2 have attained their ideal values for a one cycle of iteration itself.…”

Section: Brute Force Attackmentioning

confidence: 98%

“…The traditional algorithm [13,16,18,23,24,25,26] has lower key space, and schemes [17,27] have larger key space values than the proposed algorithms. The scheme [13,16,17,18,23,24,25,26] has achieved its optimal key space value of 2 100 after several rounds of iteration, whereas the proposed Scheme 1 and Scheme 2 have attained their ideal values for a one cycle of iteration itself. Subsequently, the proposed encryption algorithm with both schemes 1 and 2 has larger key space and has sufficient resistance to withstand brute force attack.…”

Section: Brute Force Attackmentioning

confidence: 98%

Dynamic Multi-Layered Image Encryption scheme using User Driven Chaotic Sequences

Mathivanan,

Ashwini,

Aljaedi

et al. 2023

Preprint

View full text Add to dashboard Cite

With technological advances, sharing sensitive information, such as multimedia data, especially images, is common. To protect the integrity of such data, advanced encryption algorithms are utmost necessary. The proposed encryption scheme introduces a novel approach that capitalizes on the distinct characteristics of users' authenticated usernames to dictate the sequence in which image blocks are encrypted. The methodology encompasses two key strategies. Initially, a set of four individual chaotic maps - Sin, Chebyshev, Logistic, and Gaussian - are employed for encryption. Also, the image blocks are encrypted with a novel 4D chaotic map. The process begins with segmenting an N×N×3 color image into its red, blue, and green constituents, each of size N×N. These constituents are further subdivided into four arrays, each sized (4×4) × (N/4) × (N/4). The encryption process for various image bands is based on the use of chaotic sequences generated by schemes 1 and 2. These resulting sequences serve as the fundamental encryption keys, guiding a variety of processes including both confusion and diffusion. The proposed encryption schemes, Scheme 1 and Scheme 2 were rigorously evaluated through extensive simulations, comparing their performance with a traditional algorithm. Both procedures demonstrated robustness against statistical analysis differential attacks and showcased NPCR and UACI values closely approximating ideal standards of 99.6 and 33.4, respectively. Notably, Scheme 2, employing the proposed 4D map, outperformed Scheme 1, which used four different chaotic maps, particularly in terms of NPCR and UACI. The schemes exhibited a significant key space of 2540, rendering decryption infeasible within an astronomical time frame of 9.449 × 10130 years. Further, entropy and correlation analysis validation revealed values close to 7.99 and 0, aligning with traditional algorithms' values. Additionally, pixel distribution analyses indicated uniformity along horizontal, vertical, and diagonal directions. The paper introduces an innovative encryption approach that capitalizes on user-specific characteristics and demonstrates superior security and performance compared to conventional methods.

show abstract

“…x i e mod 1 1 6, 1 10 = -Śtep 3: Transfer the calculated initial values into a 6D fractional order hyperchaotic system to generate a chaotic sequence. The initial values of the chaotic system obtained from the computation are used to generate chaotic sequences by substituting them into the 6D hyperchaotic system equation (11), which are pseudo-random sequences. Each value in the sequence is guaranteed to be between 0 and 255.…”

Section: Encryption Processmentioning

confidence: 99%

“…It is also because these characteristics match image encryption to a high degree, which makes its application in image encryption very widely. After all these years of research, different models of chaotic systems have emerged, such as complex chaotic systems [3][4][5][6], fractional chaotic systems [7][8][9], time-lagged chaotic systems [10,11], continuous chaotic systems [12][13][14], and discrete chaotic systems [15][16][17]. On the other hand, they can be differentiated in terms of dimensionality.…”

Section: Introductionmentioning

confidence: 99%

An algorithm based on 6D fractional order hyperchaotic system and knight tour algorithm to encrypt image

He,

Chen,

Wang

et al. 2024

Phys. Scr.

View full text Add to dashboard Cite

The security guarantee of data transmission is becoming more crucial as the frequency of information interchange rises. Ensuring the security of images is essential since they serve as a vital transmission medium. This research suggests an image encryption method that combines the knight tour algorithm with a 6D fractional order hyperchaotic system. First, chaotic sequences are produced using a fractional order hyperchaotic system, which is then utilized to index order and jumble the entire image. To retrieve the image after the second scrambling, choose the knight tour beginning point and run ten rounds of knight tour algorithms on the scrambled image. Thirdly, to maximize the efficiency of picture encryption, employ diffusion methods. The outcomes of the imaging experiment were lastly tested and assessed. The security of the image can be successfully guaranteed by a high-dimensional fractional order hyperchaotic system. This is because its high dimensionality gives it a larger key space than the low dimensional system. This is why it can resist attacks more effectively. After a series of evaluation experiments, it is obvious that this encryption scheme has good encryption performance.

show abstract

Fast and Secure Image Encryption Algorithm with Simultaneous Shuffling and Diffusion Based on a Time-Delayed Combinatorial Hyperchaos Map

Cited by 10 publications

References 40 publications

Mixed Multi-Chaos Quantum Image Encryption Scheme Based on Quantum Cellular Automata (QCA)

Mixed Multi-Chaos Quantum Image Encryption Scheme Based on Quantum Cellular Automata (QCA)

Dynamic Multi-Layered Image Encryption scheme using User Driven Chaotic Sequences

An algorithm based on 6D fractional order hyperchaotic system and knight tour algorithm to encrypt image

Contact Info

Product

Resources

About