Image Encryption Using Chaotic Maps: A Survey

Sankpal, Priya R; Vijaya, P. A.

doi:10.1109/icsip.2014.80

Cited by 73 publications

(36 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The circular shifts to be performed in the algorithm are given by two randomly generated vectors (one vector related with rows and another associated with the columns). The assessment of the efficacy of the propounded approach is highly sensitive when compared to existing cryptosystems …”

Section: Rubik's Cube Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Secure image transmission through crypto‐OFDM system using Rubik's cube algorithm over an AWGN channel

Dharavathu

Mosa

2020

Int J Communication

View full text Add to dashboard Cite

Summary Confidentiality of information must be maintained when it is required to be transmitted over a communication channel or when it is stored in a computer for further information access. Establishing a highly reliable and secure means of wireless communication for the transfer of digital data (text, images, audio, and video) from source to destination is becoming a prime requirement in present‐day wireless communications. Security can be achieved at the network level as well as at the data level. Data‐level security is made through cryptographic techniques. This paper emphasizes data‐level security aspects in a wireless communication system for the secure transmission of images over an AWGN channel condition. Here, a crypto orthogonal frequency division multiplexing system (crypto‐OFDM system) is designed using Rubik's cube encryption algorithm scheme for secured transmission of images under the MATLAB environment. The quality of the image transmission is analyzed using peak signal to noise ratio (PSNR) and BER at different SNR conditions. The quality of the encryption algorithm was also tested with statistical metrics, which are the histogram, NPCR, UACI, entropy, correlation coefficient analysis, etc. The numerical results reveal that a DCT‐based crypto‐OFDM system with Rubik's cube algorithm show a better performance over earlier cryptosystems and also perform superior to the original/basic OFDM system. The statistical analysis tests prove that Rubik's cube algorithm is one of the most robust algorithms for security point of view and is easy to implement, as Rubik's cube algorithm makes use of natural characteristics of pixel values, which form the basis for designing the secret key.

show abstract

Section: Rubik's Cube Algorithmmentioning

confidence: 99%

“…The assessment of the efficacy of the propounded approach is highly sensitive when compared to existing cryptosystems. [21][22][23] The Rubik's cube principle is used to disturb the order of the pixels existing in the original image. This process alters the position of the pixels.…”

Section: Rubik's Cube Algorithmmentioning

confidence: 99%

Secure image transmission through crypto‐OFDM system using Rubik's cube algorithm over an AWGN channel

Dharavathu

Mosa

2020

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Bu çalışmada öne sürülen yöntem ile [2]' de incelenen yöntemler karşılaştırıldığında daha iyi sonuçların elde edildiği açıkça görülmektedir.…”

Section: B Korelasyon Analiziunclassified

“…Resim şifreleme ayrıca verinin şifrelenme oranına göre tam şifreleme ya da kısmi şifreleme olarak da sınıflandırılmaktadır [2]. Kaotik ve kaotik olmayan resim şifreleme algoritmaları üç temel fikre sahiptir.…”

Section: Introductionunclassified

An improvement for Knutt/Durstenfeld algorithm based image encryption

Güvenoğlu

Tuysuz

2015

2015 23nd Signal Processing and Communications Applications Conference (SIU)

View full text Add to dashboard Cite

Özetçe-Veri iletimi için genel kullanıma açık ortamlar, günümüzde yaygın olarak kullanılmaktadır. Bu ortamlarda bilgi güvenliği büyük önem taşıdığından, resim şifreleme üzerinde yapılan çalışmalar da yoğun bir talep ve ilgi görmektedir. Bu makalede sunulan çalışmanın ana hedefi, dijital ortamdaki resimlerin şifrelenmesi amacı ile kullanımı kolay, güçlü ve etkin bir yöntemin geliştirilmesidir. Bu amaçla, bilinen Knutt/Durstenfeld Shuffle Algoritması ile elde edilen bir anahtar dizisi kullanılarak, resim piksellerinin yerlerini değiştirmeye dayalı resim şifreleme yöntemini iyileştiren yeni bir yöntem tanıtılmaktadır. Gerçekleştirilen uygulamada, resim türü ve biçimi önemli olmaksızın resim şifreleme işleminin başarılı bir şekilde gerçekleştirilebildiği görülmüştür. Anahtar Kelimeler; Şifreleme, bilgi güvenliği, resim güvenliği, resim şifreleme.Abstract-Nowadays, as public media such as internet are used for transmitting various kinds of data, information security is an important issue. Image data is one of the mostly shared data type. Therefore, image encryption studies have attracted more attention recently. The aim of this study is to propose an easy-touse, robust, and effective image encryption method. Accordingly, an improvement for the image encryption technique based on scrambling image pixels using key sequence generated by wellknown Knutt/Durstenfeld algorithm will be introduced. In the application of this new technique, it is shown that image encryption and decryption can be performed independently from the type of an image.

show abstract

“…The use of chaos-based encryption schemes has expanded steadily over the last few years. Sankpal and Vijaya [9] provided the insights on chaos-based image encryption. Chaotic encryption mechanisms with infinite precision and unpredictability are sensitive to initial conditions and chaotic parameters.…”

Section: Introductionmentioning

confidence: 99%

Implementation of a Multimaps Chaos-Based Encryption Software for EEG Signals

Lin¹,

Liu²

2017

Advances in Security in Computing and Communications

View full text Add to dashboard Cite

In the chapter, we adopted a chaos logic map and a quadratic map to develop the chaosbased multi-maps EEG encryption software. The encryption performances of the chaosbased software were studied. The percent root-mean-square difference (PRD) is used to estimate the accuracy of a correctly decrypted EEG signal with respect to the original EEG signal. Pearson correlation coefficient (PCC) is used to estimate the correlation between the original EEG signal and an incorrectly decrypted EEG signal. The seven encryption aspects were testing, the average PRD value of the original and correctly decrypted EEG signals for the chaos-based multi-maps software is 2.59 x 10 -11 , and the average encryption time is 113.2857 ms. The five error decryption aspects were testing, the average PCC value of the original and error decrypted EEG signals for the chaosbased multi-maps software is 0.0026, and the average error decryption time is 113.4000 ms. These results indicate that the chaos-based multimaps EEG encryption software can be applied to clinical EEG diagnosis.

show abstract

Image Encryption Using Chaotic Maps: A Survey

Cited by 73 publications

References 5 publications

Secure image transmission through crypto‐OFDM system using Rubik's cube algorithm over an AWGN channel

Secure image transmission through crypto‐OFDM system using Rubik's cube algorithm over an AWGN channel

An improvement for Knutt/Durstenfeld algorithm based image encryption

Implementation of a Multimaps Chaos-Based Encryption Software for EEG Signals

Contact Info

Product

Resources

About