Finding Optimal LSB Substitution Using Ant Colony Optimization Algorithm

• Published in: 2010 Second International Conference on Communication Software and Networks pp. 293 - 297
• Main Authors: Ching-Sheng Hsu, Shu-Fen Tu
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.02.2010
• Subjects: Ant colony optimization; Biological cells; Computer hacking; Cryptography; image hiding; Information management; Least siginificatn bit substituion; LSB substitution matrix; Matrices; Particle swarm optimization; Pixel; Protection; Steganography
• ISBN: 1424457262; 9781424457267
• DOI: 10.1109/ICCSN.2010.61

The Least Significant Bit (LSB) Substitution is a kind of information hiding method. The secret message is embedded into the last r bits of a cover image to get away from the notice of hackers. The security and stego-image quality are two main issues of the LSB substitution method. Therefore, some researchers propose an LSB substitution matrix to address these two issues. Finding an optimal LSB substitution matrix can be seen as a problem of combinatorial optimization. There are 2 r ! feasible solutions, hence the search space grows notably when r increases. Consequently, an efficient method to construct the matrix is necessary. In this paper, we apply the Ant Colony Optimization Algorithm to construct an optimal LSB substitution matrix. The experimental results show that ACO can find optimal LSB substitution matrix efficiently and improve the qualities of the stego-images.