Abstract
Several secure image encryption systems have been researched and formed by chaotic mechanisms in current decades. This work recommends an innovative quantum color image encryption method focused on the Lucas series-based substitution box to enhance the competence of encryption. The suggested encryption technique has more excellent key space and significant confidentiality. The chaotic system, along with the substitution box, exhibits additional complicated dynamical behavior, sufficient arbitrariness, and uncertainty than all others focused on just chaotic models. Theoretical and simulation assessments show that the offered image encryption performs admirably, its traditional equivalents in terms by efficiency in terms of statistical analysis.
Highlights
The advancement of computer networks directs to the extra efficient retrieval of digital images over multimedia networks
The computed values must be higher to existing S-boxes bit Independence criterion (BIC)-non-linearity test analysis (NL) and BIC-sac values
To observe the plaintext sensitivity in the suggested technique, we have calculated the number of pixels changing rate (NPCR) and the unified average changing intensity (UACI)
Summary
The advancement of computer networks directs to the extra efficient retrieval of digital images over multimedia networks. By using a chaotic quantum map, Lucas series with strong S-box based hybrid dynamical models, this article provides new approaches for encryption. In 2017, a quantum-based encryption approach was applied in the work of Zhou et al [23] utilizing a hyper-chaotic method and reiterative Arnold transforms to manage image cycle shift operations. The suggested algorithm works as a hybrid model utilizing quantum chaotic logistic map at its initial stage for an image encryption process. This system possesses high randomness comparative to traditional techniques and classical chaotic maps. In last section we have included some conclusion remarks
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have