Triple-image bit-level encryption algorithm based on double cross 2D hyperchaotic map

Wen, Jun; Xu, Xuemei; Sun, Kehui; Jiang, Zhaohui; Wang, Xiao

doi:10.1007/s11071-022-08158-z

Cited by 28 publications

(11 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

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

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

show abstract

“…Consequently, the global search capability of the algorithm is enhanced, and the convergence speed is accelerated. The ICMIC chaotic mapping employed in this study is characterized by infinite folding times [49,50], making it more likely to exhibit chaotic phenomena compared to other maps with limited folding times. The mathematical expression for the ICMIC chaotic mapping is as follows:…”

Section: Icmic Chaotic Mappingmentioning

confidence: 99%

Short-Term Power-Generation Prediction of High Humidity Island Photovoltaic Power Station Based on a Deep Hybrid Model

Wang,

Jia,

et al. 2024

Sustainability

View full text Add to dashboard Cite

Precise prediction of the power generation of photovoltaic (PV) stations on the island contributes to efficiently utilizing and developing abundant solar energy resources along the coast. In this work, a hybrid short-term prediction model (ICMIC-POA-CNN-BIGRU) was proposed to study the output of a fishing–solar complementary PV station with high humidity on the island. ICMIC chaotic mapping was used to optimize the initial position of the pelican optimization algorithm (POA) population, enhancing the global search ability. Then, ICMIC-POA performed hyperparameter debugging and L2-regularization coefficient optimization on CNN-BIGRU (convolutional neural network and bidirectional gated recurrent unit). The L2-regularization technique optimized the loss curve and over-fitting problem in the CNN-BIGRU training process. To compare the prediction effect with the other five models, three typical days (sunny, cloudy, and rainy) were selected to establish the model, and six evaluation indexes were used to evaluate the prediction performance. The results show that the model proposed in this work shows stronger robustness and generalization ability. K-fold cross-validation verified the prediction effects of three models established by different datasets for three consecutive days and five consecutive days. Compared with the CNN-BIGRU model, the RMSE values of the newly proposed model were reduced by 64.08%, 46.14%, 57.59%, 60.61%, and 34.04%, respectively, in sunny, cloudy, rainy, continuous prediction 3 days, and 5 days. The average value of the determination coefficient R2 of the 20 experiments was 0.98372 on sunny days, 0.97589 on cloudy days, and 0.98735 on rainy days.

show abstract

“…Image transformation has a high degree of data redundancy. To prevent an attacker from analyzing the correlation of the adjacent pixels, the cipher image pixels should be as uncorrelated as possible [54]. That is, the coefficient should be close to the ideal value of 0.…”

Section: Correlation Of Adjacent Pixelsmentioning

confidence: 99%

Color Image Encryption Algorithm Based on Cross-Spiral Transformation and Zone Diffusion

2023

View full text Add to dashboard Cite

Due to their rich information, color images are frequently utilized in many different industries, but the network’s security in handling their delivery of images must be taken into account. To improve the security and efficiency of color images, this paper proposed a color image encryption algorithm based on cross-spiral transformation and zone diffusion. The proposed algorithm is based on Chen’s system and the piecewise linear chaotic map, and uses the chaotic sequences generated by them for related operations. Firstly, the R, G and B planes are extracted, and the spiral starting point of each plane is randomly selected by the chaotic sequence to implement the cross-spiral transformation. Secondly, the bit-level image matrix is constructed by the scrambled image matrix, and the bit-level chaotic matrix is constructed by the chaotic sequence. Finally, the three-dimensional matrix is divided into four zones by a dividing line, and partition diffusion is carried out to obtain the encrypted image. Simulation results and algorithm analyses indicate that the proposed algorithm has superior performance and can resist a wide range of attacks.

show abstract

Triple-image bit-level encryption algorithm based on double cross 2D hyperchaotic map

Cited by 28 publications

References 50 publications

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

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

Short-Term Power-Generation Prediction of High Humidity Island Photovoltaic Power Station Based on a Deep Hybrid Model

Color Image Encryption Algorithm Based on Cross-Spiral Transformation and Zone Diffusion

Contact Info

Product

Resources

About