Rate the Article: A Chosen-Plaintext Attack on Permutation-Only Image Encryption Schemes and Steganography on Images, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 108 | Views: 312

M.Tech / M.E / PhD Thesis | Electronics & Communication Engineering | India | Volume 6 Issue 5, May 2017 | Rating: 7 / 10


A Chosen-Plaintext Attack on Permutation-Only Image Encryption Schemes and Steganography on Images

Soja Prasannan, Devi Murali


Abstract: An encryption process which is a commonly used primitive in multimedia for both images and videos is permutation scheme, and many permutation-only algorithms have been proposed in recent years for the protection of multimedia data. The image matrix entries in permutation-only image ciphers are scrambled using a pseudo-random number generated permutation mapping matrix. The literature survey done on the cryptanalysis of the image ciphers in the previous works indicates that the permutation-only image ciphers are prone to cipher text-only attacks and/or known/chosen-plaintext attacks. Steganography is a type of hidden communication in which a file, message, image, or video is concealed within another file, message, image, or video. The previous works on cryptanalysis of permutation-only image encryption schemes were studied in this paper and the cryptanalysis performed on chosen-plaintext attacks were made more efficient and along with this a steganographic process is done to hide text data as well. It was proved that in all permutation-only image ciphers, nevertheless of the cipher structure, the exact permutation mapping is recovered completely by a chosen-plaintext attack. A chosen-plaintext attack is introduced in this paper that determines the exact plaintext elements perfectly using a deterministic method. When the plain-images are of size M N and with L different color potency, the number m of chosen plain-images required for breaking the permutation-only image encryption algorithm is m = [log_L (M N)]. The complexity of the proposed attack is small as permutation is used and hence the consumption time is also small. To endorse the performance of the proposed chosen-plaintext attack, an experiment was performed on a recently proposed permutation-only image/video ciphers. Both the theoretical and the experimental results exhibited that the proposed attack surpasses the state-of-the art cryptanalytic methods. The steganographic step provides an additional security to the overallsystem by hiding the image data within another image.


Keywords: Chosen-plaintext attack, Cryptanalysis, Image encryption, Steganography, Payload


Edition: Volume 6 Issue 5, May 2017,


Pages: 1420 - 1426



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top