Document Type : Research Article



In this study, a novel approach which uses combination of steganography and cryptography for hiding information into digital images as host media is proposed. In the process, secret data is first encrypted using the mono-alphabetic substitution cipher method and then the encrypted secret data is embedded inside an image using an algorithm which combines the random patterns based on Space Filling Curves (SFC) and the optimal pair-wise LSB matching method. We employ a modified Imperialist Competitive Algorithm by Genetic Algorithm operations, namely Discrete Imperialist Competitive Algorithm (DICA), to perform the optimal pair-wise LSB matching method and find the suboptimum adjustment list. The performance of the proposed method is compared with other methods with respect to Peak Signal to Noise Ratio (PSNR). The PSNR value of the proposed method is higher than the state-of-the-art methods by almost 4dB to 5dB.


[1] Kanso, A., & Own, H. S. (2012). Steganographic algorithm based on a chaotic map. Commun Non-linear Sci Numer Simulat, 17, 3287-3302.
[2] Chu, Y.H., & Chang, S. (1999). Dynamical cryptography based on synchronized chaotic systems. Electronics Letters, 35, 974975.
[3] Highland, H.J. (1997). Data encryption: a non-mathematical approach. Computer & Security, 16, 369386.
[4] Sharp, T. (2001). An implementation of key-based digital signal steganography. Lecture Notes in Computer Science, 2137, 1326.
[5] Petitcolas, F.A.P., Anderson, R.J., & Kuhn, M.G. (1999). Information hiding a survey. Proc. IEEE, 87, 1062-1078.
[6] Xu, H., Wang, J., & Kim, H. J. (2010). Near-optimal solution to pair-wise LSB matching via an immune programming strategy. Information Sciences, 180, 1201-1217.
[7] Cox, I., Miller, M., Bloom, J., Fredrich, J., & Kalker, T. (2007). Digital Watermarking and Steganography. (2nd Ed.). Burlington: Morgan Kaufmann Publishers, MA.
[8] Simmons, G.J. (1984). The prisoners' problem and the subliminal channel. Proc, Crypto, 51-67.
[9] Cheddad, A., Condell, J., Curran, K., & Kevitt, P.M. (2010). Digital image steganography: Survey and analysis of current methods. Signal Processing, 90, 727-752.
[10] Lou, D.C., Wu, N.M., Lin, Z.H., & Tsai, C.S. (2010). A novel adaptive steganography based on local complexity and human vision sensitivity. The Journal of Systems and Software, 83, 1236-1248.
[11] Sajadi, H., & Jamzad, M. (2010). BSS: Boosted steganography scheme with cover image pre-processing. Expert systems with application, 37, 7703-7710.
[12] Wang, R.Z., Lin, C.F., & Lin, J. (2001). Image hiding by optimal LSB substitution and genetic algorithm. Pattern Recognition, 34, 671-683.
[13] Chan, C.K., & Chen, L.M. (2004). Hiding data in images by simple LSB substitution. Pattern Recognition. 37, 469-474.
[14] Yang, C.H. (2008) Inverted pattern approach to improve image quality of information hiding by LSB substitution. Pattern Recognition, 41, 2674-2683.
[15] Provos, N., & Honeyman, P. (2003). Hide and seek: an introduction to steganography. IEEE Security & Privacy Magazine, 1, 32-44.
[16] Wu, D.C., & Tsai, W.H. (2003). A steganographic method for images by pixel-value differencing. Pattern Recognition Letters, 24, 1613-1626.
[17] Chang, C.C., & Tseng, H.W. (2004). A steganographic method for digital images using side match. Pattern Recognition Letters, 25, 1431- 1437.
[18] Wang, Z.H., Chang, C.C., & Li, M.C. (2012). Optimizing least significant-bit substitution using cat swarm optimization strategy. Information Sciences, 192, 98-108.
[19] Amirtharajan, R., & Bosco, J. (2012). An intelligent chaotic embedding approach to enhance stego-image quality. Information Sciences, 193, 115-124.
[20] Hossain, M., Haque, S. A., & Sharmin, F. (2010). Variable Rate Steganography in Gray Scale Digital Images Using Neighborhood Pixel Information, The International Arab Journal of Information Technology, 7, 34-38.
[21] Ioannidou, A., Halkidis, S. T., & Stephanides, G. (2012). A novel technique for image steganography based on a high payload method and edge detection, Expert Systems with Applications, 39, 1151711524.
[22] Akar, F., Yalman, Y., & Varol, H. S. (2013). Data hiding in digital images using a partial optimization technique based on the classical LSB method, Turkish Journal of Electrical Engineering & Computer Sciences, 21, 2037-2047.
[23] Sadeghi, F., Kuchaki, M., & Zarisfi, F. (2013). Hiding Information in Image by Compound Meta-Heuristic Algorithm PSO-SA, International Journal of Computer Science & Artificial Intelligence, 3, 125-133.
[24] Jung, K. H., & Yoo, K. Y. (2015). Steganographic method based on interpolation and LSB substitution of digital images, Multimed Tools Appl, 74, 21432155.
[25] Sabeti, V., Samavi, S., & Shirani, S. (2013). An adaptive LSB matching steganography based on octonary complexity measure, Multimed Tools Appl, 64, 777793.
[26] Liu, G., Zhang, Z., & Dai, Y. (2010). Improved LSB-matching Steganography for Preserving Second-order Statistics, JOURNAL OF MULTI-MEDIA, 5, 458 -463.
[27] Luo, W., Huang, F., & Huang, J. (2010) Edge Adaptive Image Steganography Based on LSB Matching Revisited, Information Forensics and Security, IEEE Transactions, 5, 201-0214.
[28] Soleimanpour, M., Nezamabadi, H., M. Farsangi, M. & Mahyabadi, M. (2012).A more secure steganography method based on pair-wise LSB matching via a quantum gravitational search algorithm, 16th CSI International Symposium on Artificial Intelligence and Signal Processing (AISP), Shiraz, Fars, 2-3 May.
[29] Khosravi, M., Soleymanpour, S., & Mahyabadi, M. (2012). Improved pair-wise LSB matching steganography with a new evaluating system, Sixth International Symposium on Telecommunications (IST), Tehran, 6- 8 November
[30] Mielikainen, J. (2006). LSB matching revisited. IEEE Processing Letters, 13, 285-287.
[31] Harmsen, J., & Pearlman, W. (2003). Steganalysis of additive-noise modelable information hiding. Proc, SPIE Security Watermarking Multi- media Contents, 131-142.
[32] Atashpaz, E., & Lucas, C. (2007). Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation, 46614667.
[33] Rajabioun, R., Atashpaz-Gargari, E., & Lucas, C. (2008). Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement. Lecture notes in computer science, 5073, 680-695.
[35] Koga, T., & Suetake, N. (2013). Image coarsening by using space-filling curve for decomposition-based image enhancement. J. Vis. Commun. Image R, 24, 806-818.
[36] Konrad C, C. (2011). Two-constraint domain decomposition with Space Filling Curves. Parallel Computing, 37, 203-216.
[37] Bhatnagar, G., & Wu, Q.M.J. (2012). Selective image encryption based on pixels of interest and singular value Decomposition. Digital Signal Processing, 22, 648-663.
[38] Feng, G.R., Jiang, L.G., He, C., & Xue, Y. (2006). Chaotic spread spectrum watermark of optimal space-filling curves. Chaos Solitons and Fractals, 27, 580-587.
[39] Chen, H.L., & Chang, Y.I. (2005). Neighbor-finding based on space-filling curves. Information Systems, 30, 205-226.
[40] Peano, G. (1890). Sur une courbe, qui remplittoute une aire plane. Mathematische Annalen, 36, 157-160.
[41] Rhee, M.Y. (1994). Cryptography and Secure Communication. Singapore. McGraw-Hill Book Co Press.