On the security of permutation-only image encryption schemes

Alireza Jolfaei, Xinwen Wu, Vallipuram Muthukkumarasamy

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Permutation is a commonly used primitive in multimedia (image/video) encryption schemes, and many permutation-only algorithms have been proposed in recent years for the protection of multimedia data. In permutation-only image ciphers, the entries of the image matrix are scrambled using a permutation mapping matrix which is built by a pseudo-random number generator. The literature on the cryptanalysis of image ciphers indicates that the permutation-only image ciphers are insecure against ciphertext-only attacks and/or known/chosen-plaintext attacks. However, the previous studies have not been able to ensure the correct retrieval of the complete plaintext elements. In this paper, we revisited the previous works on cryptanalysis of permutation-only image encryption schemes and made the cryptanalysis work on chosen-plaintext attacks complete and more efficient. We proved that in all permutationonly image ciphers, regardless of the cipher structure, the correct permutation mapping is recovered completely by a chosen-plaintext attack. To the best of our knowledge, for the first time, this paper gives a chosen-plaintext attack that completely determines the correct plaintext elements using a deterministic method. When the plain-images are of size M × N and with L different color intensities, the number n of required chosen plain-images to break the permutation-only image encryption algorithm is n = Γlog L (MN)1. The complexity of the proposed attack is O (n · M N) which indicates its feasibility in a polynomial amount of computation time. To validate the performance of the proposed chosen-plaintext attack, numerous experiments were performed on two recently proposed permutation-only image/video ciphers. Both theoretical and experimental results showed that the proposed attack outperforms the state-of-the art cryptanalytic methods.
LanguageEnglish
Pages235-246
Number of pages12
JournalIEEE Transactions on Information Forensics and Security
Volume11
Issue number2
DOIs
Publication statusPublished - Feb 2016
Externally publishedYes

Fingerprint

Cryptography
Polynomials
Color
Experiments

Keywords

  • Chosen-plaintext attack
  • cryptanalysis
  • image encryption
  • permutation
  • Image encryption
  • Permutation
  • Cryptanalysis

Cite this

Jolfaei, Alireza ; Wu, Xinwen ; Muthukkumarasamy, Vallipuram. / On the security of permutation-only image encryption schemes. In: IEEE Transactions on Information Forensics and Security. 2016 ; Vol. 11, No. 2. pp. 235-246.
@article{84183374e1cc415ab00faa28c680da03,
title = "On the security of permutation-only image encryption schemes",
abstract = "Permutation is a commonly used primitive in multimedia (image/video) encryption schemes, and many permutation-only algorithms have been proposed in recent years for the protection of multimedia data. In permutation-only image ciphers, the entries of the image matrix are scrambled using a permutation mapping matrix which is built by a pseudo-random number generator. The literature on the cryptanalysis of image ciphers indicates that the permutation-only image ciphers are insecure against ciphertext-only attacks and/or known/chosen-plaintext attacks. However, the previous studies have not been able to ensure the correct retrieval of the complete plaintext elements. In this paper, we revisited the previous works on cryptanalysis of permutation-only image encryption schemes and made the cryptanalysis work on chosen-plaintext attacks complete and more efficient. We proved that in all permutationonly image ciphers, regardless of the cipher structure, the correct permutation mapping is recovered completely by a chosen-plaintext attack. To the best of our knowledge, for the first time, this paper gives a chosen-plaintext attack that completely determines the correct plaintext elements using a deterministic method. When the plain-images are of size M × N and with L different color intensities, the number n of required chosen plain-images to break the permutation-only image encryption algorithm is n = Γlog L (MN)1. The complexity of the proposed attack is O (n · M N) which indicates its feasibility in a polynomial amount of computation time. To validate the performance of the proposed chosen-plaintext attack, numerous experiments were performed on two recently proposed permutation-only image/video ciphers. Both theoretical and experimental results showed that the proposed attack outperforms the state-of-the art cryptanalytic methods.",
keywords = "Chosen-plaintext attack, cryptanalysis, image encryption, permutation, Image encryption, Permutation, Cryptanalysis",
author = "Alireza Jolfaei and Xinwen Wu and Vallipuram Muthukkumarasamy",
year = "2016",
month = "2",
doi = "10.1109/TIFS.2015.2489178",
language = "English",
volume = "11",
pages = "235--246",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",
number = "2",

}

On the security of permutation-only image encryption schemes. / Jolfaei, Alireza; Wu, Xinwen; Muthukkumarasamy, Vallipuram.

In: IEEE Transactions on Information Forensics and Security, Vol. 11, No. 2, 02.2016, p. 235-246.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - On the security of permutation-only image encryption schemes

AU - Jolfaei, Alireza

AU - Wu, Xinwen

AU - Muthukkumarasamy, Vallipuram

PY - 2016/2

Y1 - 2016/2

N2 - Permutation is a commonly used primitive in multimedia (image/video) encryption schemes, and many permutation-only algorithms have been proposed in recent years for the protection of multimedia data. In permutation-only image ciphers, the entries of the image matrix are scrambled using a permutation mapping matrix which is built by a pseudo-random number generator. The literature on the cryptanalysis of image ciphers indicates that the permutation-only image ciphers are insecure against ciphertext-only attacks and/or known/chosen-plaintext attacks. However, the previous studies have not been able to ensure the correct retrieval of the complete plaintext elements. In this paper, we revisited the previous works on cryptanalysis of permutation-only image encryption schemes and made the cryptanalysis work on chosen-plaintext attacks complete and more efficient. We proved that in all permutationonly image ciphers, regardless of the cipher structure, the correct permutation mapping is recovered completely by a chosen-plaintext attack. To the best of our knowledge, for the first time, this paper gives a chosen-plaintext attack that completely determines the correct plaintext elements using a deterministic method. When the plain-images are of size M × N and with L different color intensities, the number n of required chosen plain-images to break the permutation-only image encryption algorithm is n = Γlog L (MN)1. The complexity of the proposed attack is O (n · M N) which indicates its feasibility in a polynomial amount of computation time. To validate the performance of the proposed chosen-plaintext attack, numerous experiments were performed on two recently proposed permutation-only image/video ciphers. Both theoretical and experimental results showed that the proposed attack outperforms the state-of-the art cryptanalytic methods.

AB - Permutation is a commonly used primitive in multimedia (image/video) encryption schemes, and many permutation-only algorithms have been proposed in recent years for the protection of multimedia data. In permutation-only image ciphers, the entries of the image matrix are scrambled using a permutation mapping matrix which is built by a pseudo-random number generator. The literature on the cryptanalysis of image ciphers indicates that the permutation-only image ciphers are insecure against ciphertext-only attacks and/or known/chosen-plaintext attacks. However, the previous studies have not been able to ensure the correct retrieval of the complete plaintext elements. In this paper, we revisited the previous works on cryptanalysis of permutation-only image encryption schemes and made the cryptanalysis work on chosen-plaintext attacks complete and more efficient. We proved that in all permutationonly image ciphers, regardless of the cipher structure, the correct permutation mapping is recovered completely by a chosen-plaintext attack. To the best of our knowledge, for the first time, this paper gives a chosen-plaintext attack that completely determines the correct plaintext elements using a deterministic method. When the plain-images are of size M × N and with L different color intensities, the number n of required chosen plain-images to break the permutation-only image encryption algorithm is n = Γlog L (MN)1. The complexity of the proposed attack is O (n · M N) which indicates its feasibility in a polynomial amount of computation time. To validate the performance of the proposed chosen-plaintext attack, numerous experiments were performed on two recently proposed permutation-only image/video ciphers. Both theoretical and experimental results showed that the proposed attack outperforms the state-of-the art cryptanalytic methods.

KW - Chosen-plaintext attack

KW - cryptanalysis

KW - image encryption

KW - permutation

KW - Image encryption

KW - Permutation

KW - Cryptanalysis

UR - http://www.scopus.com/inward/record.url?scp=85039988622&partnerID=8YFLogxK

U2 - 10.1109/TIFS.2015.2489178

DO - 10.1109/TIFS.2015.2489178

M3 - Article

VL - 11

SP - 235

EP - 246

JO - IEEE Transactions on Information Forensics and Security

T2 - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

IS - 2

ER -