Abstract
The security of information and digital images has become a major issue during the last three decades. A large number of algorithms for data and image encryptions are reported in the literature. However, many of the proposed algorithms are not suitable in the fields of application, because they are cryptographically weak. In the present work, a novel algorithm for encoding digital images by using a circle map with 3 parameters has been proposed. In this article different images are used for testing the validity of the proposed algorithm. The algorithm has increased the strength of security of the image encryption against cipher-text-only, chosen-plaintext and chosen-cipher-text attacks. The analysis of cryptographic strength has also been performed to confirm the fact. The results of several experimental tests, such as, key space analysis, key sensitivity analysis and statistical analysis show that the proposed algorithm for image cryptosystems provides an efficient and secure way for image encryption. A comparison in terms of correlation between the initial and transformed images, number of pixels change rate (NPCR) and unified average changing intensity (UACI) is also done. Keywords: Circle map, Chaos, Lyapunov exponent, anti-differential attack, NPCR, UACI.
Highlights
The security of information and digital images has become a major issue during the last three decades
In this article different images are used for testing the validity of the proposed algorithm
The algorithm has increased the strength of security of the image encryption against cipher-text-only, chosen-plaintext and chosen-cipher-text attacks
Summary
The security of digital images in the a good resistance against the common attacks. For the purpose of making the brute-force attack infeasible, the key space should be large enough in a secure image cryptosystem The difference value is k1 − k1 = 0.0001 which produced decrypted images totally different from the original plain images This analysis proved that the algorithm of the cryptosystem is sensitive to the key and it guarantees the security against known plain-text attacks . The mod operation does not provide any information about the keys used in the map and it is not possible to extract the keys from the sequence obtained by known plain-text attack. The approximate average brute force cipher text-only attack complexity can be estimated as follows: For each guessed key { x0 , k1, k2 , k3 }, the number of computations required for generating the chaotic sequence is MN. An attacker finds it difficult to extract the pixels statistical nature of the plain image from the cipher image and the algorithm can resist a chosen plain text or known plain text attacks
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
