An Efficient Image Encryption Algorithm for the Period of Arnold's CAT Map
Küçük Resim Yok
Tarih
2018
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Arnold's CAT Map (ACM) is a chaotic transformation of the 2-dimensional toral automorphism T2 defined by the mapping ? ? T2? T2. There are many applications of ACM in various research areas such as: steganography, encryption of images, texts and watermarks. The transformation of an image is achieved by the randomized order of pixels. After a finite number of repetitions of the transformation, the original image reappears. In this study, encryption of two images is demonstrated together with a proposed algorithm. Moreover, the periodicity of ACM is discussed and an algorithm to change the period of ACM is suggested. The resultant period obtained from the new algorithm is compared with the period obtained from the usual ACM. The results show that the period of the proposed algorithm grows exponentially while the period of ACM has an upper bound
Arnold's CAT Map (ACM) is a chaotic transformation of the 2-dimensional toral automorphism T2 defined by the mapping ? ? T2? T2. There are many applications of ACM in various research areas such as: steganography, encryption of images, texts and watermarks. The transformation of an image is achieved by the randomized order of pixels. After a finite number of repetitions of the transformation, the original image reappears. In this study, encryption of two images is demonstrated together with a proposed algorithm. Moreover, the periodicity of ACM is discussed and an algorithm to change the period of ACM is suggested. The resultant period obtained from the new algorithm is compared with the period obtained from the usual ACM. The results show that the period of the proposed algorithm grows exponentially while the period of ACM has an upper bound
Arnold's CAT Map (ACM) is a chaotic transformation of the 2-dimensional toral automorphism T2 defined by the mapping ? ? T2? T2. There are many applications of ACM in various research areas such as: steganography, encryption of images, texts and watermarks. The transformation of an image is achieved by the randomized order of pixels. After a finite number of repetitions of the transformation, the original image reappears. In this study, encryption of two images is demonstrated together with a proposed algorithm. Moreover, the periodicity of ACM is discussed and an algorithm to change the period of ACM is suggested. The resultant period obtained from the new algorithm is compared with the period obtained from the usual ACM. The results show that the period of the proposed algorithm grows exponentially while the period of ACM has an upper bound
Açıklama
Anahtar Kelimeler
Bilgisayar Bilimleri, Yapay Zeka
Kaynak
International Journal of Intelligent Systems and Applications in Engineering
WoS Q Değeri
Scopus Q Değeri
Cilt
6
Sayı
1
