Heurísticas para Matriz de Substituição do LSB utilizando Algoritmos Genéticos e Path Relinking

• Marcus V. M. Vieira UFF
• André L. Brazil UFF
• Aura Conci UFF
• Célio V. N. Albuquerque UFF

DOI: https://doi.org/10.5753/sbseg.2010.20588

Abstract

With the increase of data traffic the need for transmitting secure information gains another perspective. One way to protect the data sent over the web is to embed the relevant information within an unsuspected image. This paper proposes the protection of secret data by combining the genetic algorithm with a path relinking process to optimize the substitution matrix in order to improve the stego image quality. Computational results show that the proposed combination outperforms the LSB substitution technique, the genetic algorithm technique and other variations, concerning both security and stego image quality.

References

Anderson, R. and Petitcolas, F. (1998). On the limits of steganography. Selected Areas in Communications, IEEE Journal on, 16(4):474–481.

Bellare, M. and Rogaway, P. (1993). Entity authentication and key distribution. In Advances in Cryptology-CRYPTO’93, pages 232–249. Springer.

Bender, W., Gruhl, D., Morimoto, N., and Lu, A. (1996). Techniques for data hiding. IBM Syst. J., 35(3-4):313–336.

Bourbakis, N. and Alexopoulos, C. (1992). Picture data encryption using scan patterns. Pattern Recognition, 25(6):567–581.

Chang, C.-C., Hsiao, J.-Y., and Chan, C.-S. (2003). Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy. Pattern Recognition, 36(7):1583 – 1595.

Duric, Z., Jacobs, M., and Jajodia, S. (2005). Information hiding: Steganography and steganoanalysis. Pattern Recognition, 24(6):171–187.

Glover, F. (1998). A template for scatter search and path relinking. In AE ’97: Selected Papers from the Third European Conference on Artificial Evolution, pages 3–54, London, UK. Springer-Verlag.

Glover, F. and Laguna, F. (1997). Tabu Search. Kluwer Academic Publishers, Norwell, MA, USA.

Highland, H. J. (1997). Data encryption: A non-mathematical approach. Computers & Security, 16(5):369 – 386.

Hsu, C. and Tu, S. (2010). Finding Optimal LSB Substitution Using Ant Colony Optimization Algorithm. In 2010 Second International Conference on Communication Software and Networks, pages 293–297. IEEE.

Jan, J.-K. and Tseng, Y.-M. (1996). On the security of image encryption method. Inf. Process. Lett., 60(5):261–265.

Johnson, N. and Jajodia, S. (1998). Exploring steganography: Seeing the unseen. Computer, 31(2):26–34.

Julio, E., Brazil, W., and Neves, C. (2007). Esteganografia e suas Aplicações. Universidade Federal do Rio de Janeiro.(Org.). Livro Texto dos Minicursos-SBSEG 2007, pages 54–102.

Petitcolas, F., Anderson, R., and Kuhn, M. (1999). Information hiding-a survey. Proceedings of the IEEE, 87(7):1062–1078.

Provos, N. and Honeyman, P. (2003). Hide and seek: an introduction to steganography. Security & Privacy, IEEE, 1(3):32–44.

Resende, M. and Ribeiro, C. (2007). An Introduction to GRASP. XXXIX Simpósio Brasileiro de Pesquisa Operacional.

Rhee, M. Y. (1993). Cryptography and Secure Communications. McGraw-Hill, Inc., New York, NY, USA.

Thien, C.-C. and Lin, J.-C. (2003). A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function. Pattern Recognition, 36(12):2875 – 2881.

Vallada, E. and Ruiz, R. (2010). Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega, 38(1-2):57 – 67.

Wang, R.-Z., Lin, C.-F., and Lin, J.-C. (2001). Image hiding by optimal lsb substitution and genetic algorithm. Pattern Recognition, 34(3):671 – 683.

Wang, S.-J. (2005). Steganography of capacity required using modulo operator for embedding secret image. Applied Mathematics and Computation, 164(1):99–116.

Yu, Y.-H., Chang, C.-C., and Lin, I.-C. (2007). A new steganographic method for color and grayscale image hiding. Computer Vision and Image Understanding, 107(3):183–194.

Zhang, G. and Lai, K. (2006). Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem. European Journal of Operational Research, 169(2):413 – 425.