Abstract
A novel chaos-based image encryption scheme has been proposed recently. In this scheme, redundancies of the Fridrich’s structure were reduced significantly via a new circular inter-intra-pixels bit-level permutation strategy. However, we proved that the original encryption scheme is vulnerable to the known/chosen-plaintext attacks. Both the permutation and diffusion phases have been improved to enhance the security of the original scheme. By shifting each row of the plain image randomly, known-plaintext attacks could be resisted. Furthermore, by appending double crossover diffusion to the end of the original scheme, chosen-plaintext attacks lost their efficacies. Simulation results demonstrated that the improved encryption scheme outperforms the original one.
Highlights
With the development of Internet technology, image data has been widely applied in many fields, such as military systems, government agencies, medical imaging systems, and online trade and business
It was found that the scheme can be cracked by known-plaintext attacks
One is the fixed steps and directions of the circular shift, which causes the vulnerability to known-plaintext attacks
Summary
With the development of Internet technology, image data has been widely applied in many fields, such as military systems, government agencies, medical imaging systems, and online trade and business. To reduce redundancy and statistical links, many bit-level-based techniques have been proposed [10,11,12,13,14,15,16]. In 2016, Diaconu proposed a circular inter-intra-pixels bit-level permutation-confusion strategy [17] This strategy takes advantage of Fridrich’s structure; employing the confusion strategy reduces the redundancy significantly. The secret matrix, that is, the equivalent of the keys, can be revealed through known-plaintext attacks To overcome these security problems, we propose two improvements/changes to the scheme; that is, we improve the permutation phase to resist known-plaintext attacks and improve the diffusion phase to resist chosen-plaintext and differential attacks [20], respectively.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
