Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Image Encryption Based on Arnod Transform and Fractional Chaotic

Version 1 : Received: 15 December 2021 / Approved: 16 December 2021 / Online: 16 December 2021 (11:52:50 CET)

How to cite: Chen, C.; Zhang, H.; Wu, B. Image Encryption Based on Arnod Transform and Fractional Chaotic. Preprints 2021, 2021120269. https://doi.org/10.20944/preprints202112.0269.v1 Chen, C.; Zhang, H.; Wu, B. Image Encryption Based on Arnod Transform and Fractional Chaotic. Preprints 2021, 2021120269. https://doi.org/10.20944/preprints202112.0269.v1

Abstract

In view of the problem of cracking easily and partial distortion of images after encryption or decryption, a novel image encryption and decryption algorithm based on Arnod Transform and fractional chaotic is proposed. To begin with, the Arnold transform is used to encrypt. So that the spatial confidence of the original image has been comprehensively disturbed. Secondly, the XOR involving the fractional order chaotic sequence is used to encrypt. The key sequence is dynamically generated to ensure the randomness and difference of key generation. When decryption is required, the first decryption is performed using the key and XOR. Then the second decryption is carried out by using the inverse Arnold transform, and finally the decrypted image is obtained. Experimental results show that the improved algorithm has achieved better performance in encryption and decryption.

Keywords

fractional derivative; Arnold Transform; XOR involving fractional order chaotic sequence; encryption and decryption

Subject

Computer Science and Mathematics, Computer Vision and Graphics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.