Skip to main content
Log in

Security analysis and improvement of a partial encryption scheme

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

This paper proposes to cryptanalyze a partial image encryption scheme. Security weaknesses were found in the cryptosystem consisting in the generation of the keystream. We then propose a modified version of the partial encryption scheme to enhance its security together with keeping the benefit of encrypting a reduced amount of data. Our contributions can be resumed in two points : we will first show the insecurity of the cryptosystem under study then we will propose a remedy to resist the described attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Ariffin M, Noorani M (2008) Modified Baptista type chaotic cryptosystem via matrix secret key. Phys Lett A 372:5427–430

    Article  MATH  MathSciNet  Google Scholar 

  2. Bhatnagar G, Wu QJ (2012) Selective image encryption based on pixels of interest and singular value decomposition. Digit Signal Process 22:648–663

    Article  MathSciNet  Google Scholar 

  3. Biryukov A, Kushilevitz E (1998) Improved cryptanalysis of rc5. In: Eurocrypt, 1998

  4. Bogdanov A, Knudsen L, Leander G, Paar C, Poschmann1 A, Robshaw M, Seurin Y, Vikkelsoe C (2007) Present: an ultra-lightweight block cipher. In: Cryptographic hardware and embedded systems, vol 4727 of LNCS. Springer, pp 450–466

  5. Furht B, Socek D, Eskicioglu A (2005) Fundamentals of multimedia encryption techniques. A chapter in multimedia security handbook. CRC Press

  6. Gao T, Chen Z (2008) Image encryption based on a new total shuffling algorithm. Chaos Solitons Fractals 38(1):213–220

    Article  MATH  MathSciNet  Google Scholar 

  7. Grangetto M, Magli E, Olmo G (2006) Multimedia selective encryption by means of randomized arithmetic coding. IEEE Trans Multimed 8(5):905–917

    Article  Google Scholar 

  8. Hermassi H, Rhouma R, Belghith S (2009) A modified hyperchaos based image cryptosystem. In: 6th International multi-conference on systems, signals and devices, SSD 2009, art no 4956660

  9. Hermassi H, Rhouma R, Belghith S (2010) Joint compression and encryption using chaotically mutated huffman trees. In: Communications in nonlinear science and numerical simulation

  10. Hermassi H, Rhouma R, Belghith S (2012) Security analysis of image cryptosystems only or partially based on a chaotic permutation. J Syst Softw 85:2133–2144

    Article  Google Scholar 

  11. Huang C, Nien H (2009) Multi chaotic systems based pixel shuffle for image encryption. Opt Commun 1282(11):2123–2127

    Article  Google Scholar 

  12. Li S, Chen G, Wong K-W, Mou X, Cai Y (2004) Baptista-type chaotic cryptosystems: problems and countermeasures. Phys Lett A 240:368–375

    Article  Google Scholar 

  13. Li S, Li C, Chen G, Bourbakis N, Lo K-T (2008) A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks. Signal Process Image 23(3):212–223

    Article  Google Scholar 

  14. Liu Y, Tian S, Hu W, Xing C (2012) Design and statistical analysis of a new chaotic block cipher for wireless sensor networks. Commun Nonlinear Sci Numer Simulat 17:3267–3278

    Article  MathSciNet  Google Scholar 

  15. Lian S (2009) Multimedia content encryption: techniques and applications. Auerbach Publications, Taylor & Francis Group

  16. Li C, Lo K-T (2011) Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks. Signal Process 91:949–954

    Article  MATH  Google Scholar 

  17. Lian S, Sun J, Zhang D, Wang Z (2004) A selective image encryption scheme based on jpeg2000 codec. In: Pacific-Rim Conference on Multimedia (PCM2004), vol 3332 of LNCS, pp 65–72

  18. Nagaraj N, Vaidya PG, Bhat KG (2009) Arithmetic coding as a non-linear dynamical system. Commun Nonlinear Sci Numer Simul 14(4):1013–1020

    Article  MATH  MathSciNet  Google Scholar 

  19. Pisarchik AN, Flores-Carmona NJ, Carpio-Valadez M (2006) Encryption and decryption of images with chaotic map lattices. Chaos 16:033118

    Google Scholar 

  20. Rhouma R, Belghith S (2008) Cryptanalysis of a new image encryption algorithm based on hyper-chaos. Phys Lett A 372(38):5973–5978

    Article  MATH  Google Scholar 

  21. Rhouma R, Belghith S (2008) Cryptanalysis of a spatiotemporal chaotic image/video cryp-tosystem. Phys Lett A 372(36):5790–5794

    Article  MATH  Google Scholar 

  22. Sam I, Devaraj P, Bhuvaneswaran RS (2012) A novel image cipher based on mixed transformed logistic maps. Multi Tools Appl 56(2):315–330

    Article  Google Scholar 

  23. Shannon C (1949) Communication theory of secrecy systems. Bell Syst Tech J 28:656–715

    Article  MATH  MathSciNet  Google Scholar 

  24. Shibutani K, Isobe T, Hiwatari H, Mitsuda A, Akishita T, Shirai T (2011) Piccolo: an ultra-lightweight blockcipher. In: Cryptographic hardware and embedded systems, vol 6917 of LNCS. Springer, pp 342–357

  25. Solak E, Çokal C (2008) Comment on encryption and decryption of images with chaotic map lattices [chaos, 033118 (2006)]. Chaos Interdis J Nonlinear Sci 18(3):038101

    Article  Google Scholar 

  26. Solak E, Rhouma R, Belghith S (2010) Cryptanalysis of a multi-chaotic systems based image cryptosystem. Opt Commun 283(2):232–236

    Article  Google Scholar 

  27. Vrahatis M, Tsirogiannis G, Laskari E (2010) Novel orbit based symmetric cryptosystems. Math Comput Model 51:239–246

    Article  MATH  MathSciNet  Google Scholar 

  28. Wu CP, Kuo CCJ (2005) Design of integrated multimedia compression and encryption systems. IEEE Trans Multimed 7(5):828–839

    Article  Google Scholar 

  29. Xiang T, Wong K-W, Liao X (2007) Selective image encryption using a spatiotemporal chaotic system. Chaos 17(023115):1–12

    Google Scholar 

  30. Yick J, Mukherjee B, Ghosal D (2008) Wireless sensor network survey. Comput Netw 52:2292–2330

    Article  Google Scholar 

Download references

Acknowledgments

We thank the editor and the anonymous reviewers for their advice, comments and suggestions to improve the technical and editorial quality of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oussama Benrhouma.

Appendix

Appendix

We give here the definition and equations of the correlation coefficient of an image as well as the NPCR and UACI quantities.

  1. 1.

    Calculus of the Correlation Coefficient: It is well known that adjacent image pixels are highly correlated either in horizontal, vertical or diagonal directions. Such high correlation property can be quantified by means of correlation coefficients which are given by:

    $$ r=\frac{cov(p,q)}{\sqrt{D(p)}\sqrt{D(q)}} $$
    (19)

    where,

    $$D(p)= \frac{1}{S} \sum_{i=1}^{S}(p_i- \bar{p})^{2}$$
    $$cov(p,q)=\frac{1}{S} \sum_{i=1}^{S}(p_i- \bar{p})(q_i- \bar{q})$$

    \(q_{i}\) and \(p_{i}\) denote two adjacent pixels (either horizontal or vertical). S is the total number of duplets \((p_{i},q_i)\) obtained from the image; \(\bar {p}\) and \(\bar {q}\) are the mean values of \(p_{i}\) and \(q_{i}\), respectively.

  2. 2.

    Calculus of the NPCR and UACI: As a general requirement for all the image encryption schemes, the encrypted image should be greatly different from its original form. Such difference can be measured by means of two criteria namely, the NPCR (Number of Pixel Change Rate) and the UACI (Unified Average Changing Intensity). The NPCR is used to measure the number of pixels in difference between two images. Let \(S(i,j)\) and \(S'(i,j)\) be the \((i,j)^{th}\) pixel of two images S and \(S'\), respectively. The NPCR can be defined as:

    $$ NPCR=\frac{\sum_{i,j}D(i,j)}{L} \times 100~\% $$
    (20)

    where L is the total number of pixels in the image and \(D(i,j)\) is defined as:

    $$ D(i,j)=\left\{ {\begin{aligned} 0 \,\, if \,\, S(i,j)=S'(i,j) \\ 1 \,\, if \,\, S(i,j) \neq S'(i,j) \\ \end{aligned}} \right. $$
    (21)

    where \(S(i,j)\) and \(S'(i,j)\) are the pixel values of the two images, respectively. For instance, for two random images with \(256 \times 256\) pixels:

    $$NPCR=99.609375~\%.$$

    The second criterion, UACI, is used to measure the average intensity difference and can be defined as:

    $$ UACI=\frac{1}{L}\left( \sum_{i,j} \frac {|S(i,j)-S'(i,j)|}{2^{B}-1}\right)\times 100~\% $$
    (22)

    Where B is the number of bits used to represent a grey scale pixel value. In the case of two random images, the expected value of UACI is:

    $$UACI= 33.46354~\% $$

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benrhouma, O., Hermassi, H. & Belghith, S. Security analysis and improvement of a partial encryption scheme. Multimed Tools Appl 74, 3617–3634 (2015). https://doi.org/10.1007/s11042-013-1790-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-013-1790-4

Keywords

Navigation