# Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm

- Lifang Yu
^{1}, - Yao Zhao
^{1}Email author, - Rongrong Ni
^{1}and - Ting Li
^{1}

**2010**:876946

https://doi.org/10.1155/2010/876946

© Lifang Yu et al. 2010

**Received: **17 November 2009

**Accepted: **19 May 2010

**Published: **20 June 2010

## Abstract

We propose a novel steganographic method in JPEG images with high performance. Firstly, we propose improved adaptive LSB steganography, which can achieve high capacity while preserving the first-order statistics. Secondly, in order to minimize visual degradation of the stego image, we shuffle bits-order of the message based on chaos whose parameters are selected by the genetic algorithm. Shuffling message's bits-order provides us with a new way to improve the performance of steganography. Experimental results show that our method outperforms classical steganographic methods in image quality, while preserving characteristics of histogram and providing high capacity.

## Keywords

## 1. Introduction

Steganography is the science of hiding messages in a medium called *carrier* or *cover* object in such a way that existence of the message is concealed. The cover object could be a digital still image, an audio file, or a video file. The hidden message called *payload* could be a plain text, an audio file, a video file, or an image [1, 2].

Steganographic methods can be classified into *spatial domain embedding* and *frequency domain embedding*. Least Significant Bit (LSB) replacing is the most widely used steganographic method in spatial domain, which replaces the cover image's LSBs with message bits directly. Although it has several disadvantages such as vulnerable to attacks, LSB steganography is a popular method because of its low computational complexity and high embedding capacity. In frequency domain, popular steganographic methods mostly base on Discrete Cosine Transformation (DCT). After performing DCT on each
block and quantizing the DCT coefficients, message bits are embedded into the quantized DCT (qDCT) coefficients. Recently, many steganographic schemes using LSB and its improved versions on qDCT have been invented, which offer reasonably high embedding capacity while attempting to preserve the marginal statistics of the cover image, such as J-Steg [3], F5 [4], and OutGuess [5]. It is well known that J-Steg is detectable using the
attack [6, 7] since it is based on simply flipping LSBs. F5 employs matrix encoding to decrease the change for one payload, but its shrinkage at 0s makes it detectable. OutGuess embeds message bits into a part of coefficients and uses the other part to compensate artifacts on the histogram, so it preserves characteristics of histogram. But its embedding efficiency and capacity are low because of compensation.

Our contributions are in two folds. First, we present improved adaptive LSB steganography that can embed messages adaptively and thus can satisfy various requirements (high capacity, high security, high image quality, etc.). Second, our method minimizes degradation of the stego image through finding the best mapping between the secret message and the cover image based on chaos and the genetic algorithm (GA).

The rest of the paper is organized as follows. Section 2 introduces general principles of chaos and GA. Section 3 illustrates our proposed method in detail, which includes the improved adaptive LSB steganography, a method to shuffle message bits based on the logistic map and GA, the embedding procedure and the extraction procedure. Experimental results are shown in Section 4, where we demonstrate that our method has good stego image quality, high security-preserving characteristics of histogram, and high capacity. Finally, conclusions are addressed in Section 5.

## 2. Preliminary

### 2.1. Chaos and Its Application in Information Hiding

The chaos phenomenon is a deterministic and analogously stochastic process appearing in a nonlinear dynamical system [8, 9]. Because of its extreme sensitivity to initial conditions and the outspreading of orbits over the entire space, it has been used in information hiding to increase security [10, 11].

Researches on chaotic dynamical systems show that the logistic map stands in chaotic state when . That is, the sequence generated by the logistic map is nonperiodic and nonconvergent. All the sequences generated by the logistic map are very sensitive to initial conditions, in the sense that two logistic sequences generated from different initial conditions are uncorrelated statistically. The logistic map was used to generate a sequence as the watermark [11] or to encrypt the embedded position [10, 11] in former works. In our algorithm to be described below, we use the logistic map to shuffle bits-order of the message.

### 2.2. Genetic Algorithm

The genetic algorithm (GA), introduced by Holland [12] in his seminal work, is commonly used as an adaptive approach that provides a randomized, parallel, and global search. It bases on the mechanics of natural selection and genetics to find the exact or approximate solution for a given optimization problem.

GA is implemented as a computer simulation in which a population of abstract representations of candidate solutions to an optimization problem evolves toward better solutions. The evolution usually starts with some randomly selected genes as the first generation. All genes in a generation form a *population*. Each individual in the population is called *chromosome*, which corresponds to a solution in the optimization problem domain. An objective, called *fitness function*, is used to evaluate the quality of each chromosome. A new generation is recombined to find the best solution by using three operators: *selection*, *crossover*, and *mutation* [13]. The process is repeated until a predefined condition is satisfied.

- (1)
Generate initial population.

- (2)
Evaluate the fitness of each individual in the population.

- (3)
Select best-ranking individuals to reproduce.

- (4)
Breed a new generation through crossover and mutation (genetic operations) and give birth to offspring.

- (5)
Evaluate the individual fitness of the offspring.

- (6)
Replace the worst ranked part of population with offspring.

- (7)

## 3. Our Proposed Method

### 3.1. Improved Adaptive LSB (IA-LSB) Steganography

The classical LSB steganography replaces cover images' LSBs with messages' bits directly. This embedding strategy leads to dissymmetry. When the LSB of a coefficient in the cover image equals to its corresponding message bit, no change is made. Otherwise, this coefficient is changed from to or from to —changes from to or from to never happen. This dissymmetry is utilized by steganalysis, known as attack [6, 7].

In order to avoid dissymmetry, improved adaptive LSB (IA-LSB) steganography is proposed. First, the number of bits to be embedded in a certain coefficient is adaptive. With proper parameters, we can get high capacity while preserving high security. Second, less modification rule (LMR) is used to minimize modification.

#### 3.1.1. Adaptively Decide Bits to be Embedded in Each Coefficient

#### 3.1.2. Less Modification Rule (LMR)

Suppose is assigned to hold bits. Denote 's corresponding message bits as decimally, and denote its corresponding coefficient in the stego image as . Let be the decimal expression of the least significant bits of . That is, .

In this rule, we always choose the change that introduces less modification. For example, if , , and , then , , . , but the absolute value of change from to is 3 while to is 1, so choose as . Take another example, , and , then , , . In this case, choose , which is closer to , as .

### 3.2. Shuffle Message Bits Based on Chaos and Genetic Algorithm

Shuffling message bits changes the way of modifying the cover image during embedding thus influences image quality and security of the stego image. By finding a proper way to shuffle, we can improve the image quality or security or both. In this paper, we use the logistic map for shuffling and use GA to find proper parameters for the logistic map.

Here comes an example of using the logistic map to shuffle message bits. Let , , then , and shuffled message sequence is .

- (1)
Initialize population. Randomly generate pairs of , , . is the size of population and each is an individual.

- (2)
For each , shuffle message bits and embed the reordered message bits into the cover image using IA-LSB steganography, then compute PSNR between the cover image and the stego image, which is the fitness function of GA. In the following operations, the individual with larger fitness function will be considered better.

- (3)
GA operators—selection, crossover, and mutation—are operated to generate the next generation.

- (4)
- (5)

### 3.3. Embedding Procedure

*valid*, if and it is not a DC coefficient. The whole embedding procedure is depicted in Figure 3. Firstly, the message bits are shuffled by the logistic map whose input pair is selected by GA. Secondly, the cover JPEG file is decoded, obtaining quantized DCT coefficients. Thirdly, the shuffled message bits are embedded into the valid quantized DCT coefficients using IA-LSB steganography. Finally, stego quantized DCT coefficients are encoded to the stego JPEG file.

It needs to be taken into consideration that valid coefficients after embedding should still be valid, that is, valid coefficients should not be changed to 0. On one hand, characteristics of histogram can be preserved; on the other hand, message bits can be extracted correctly and simply. If , . To add or subtract is determined randomly.

### 3.4. Extracting Procedure

## 4. Experiments

In this section, we demonstrate the performance of our proposed method and compare it with that of F5 [14], MB1 [15], and Outguess [16]. The image quality of each steganography method is expressed objectively in PSNR. Standard gray-level and true color images with sizes of are used as covers, such as Lena, Baboon, and Couple. The JPEG quality factor is set to during compression in each method.

### 4.1. Image Quality

PSNR of gray images embedded by IA-LSB with and without shuffling message bits, simply denoted as "with" and "without".

PSNR (db) | Average embedding capacity (bpc) | |||||
---|---|---|---|---|---|---|

0.46 | 0.624 | 0.731 | ||||

with | without | with | without | with | without | |

Lena | 39.93 | 39.72 | 38.521 | 38.181 | 37.376 | 37.221 |

Baboon | 33.59 | 33.41 | 33.058 | 32.821 | 32.381 | 32.23 |

Milkdrop | 44.32 | 44.21 | 40.187 | 39.92 | 39.274 | 38.934 |

Plane | 38.73 | 38.44 | 37.586 | 37.281 | 36.727 | 36.506 |

PSNR of color images embedded by IA-LSB at 0.45 bpc.

PSNR (db) | with | without |
---|---|---|

Lena | 35.134 | 35.011 |

Baboon | 28.62 | 28.556 |

Milkdrop | 39.384 | 39.252 |

Plane | 34.518 | 34.391 |

### 4.2. Preserving Characteristics of Histogram

## 5. Conclusion

A steganographic method uses IA-LSB based on chaos and genetic algorithm is proposed. After finding the best parameters for the logistic map using GA, rearrange the secret message and embed it into the cover image using IA-LSB. Experimental results demonstrate that our algorithm achieves high embedding capacity while preserving good image quality and high security.

The important and distinctive features in the proposed method are to minimize the degradation of stego image by shuffling the secret message based on the logistic map and GA. To find better mapping between the secret message and the cover image so as to improve the steganographic performance is our future work.

## Declarations

### Acknowledgments

This work was supported in part by National Natural Science Foundation of China (no. 60776794, no. 90604032, and no. 60702013), 973 program (no. 2006CB303104), 863 program (no. 2007AA01Z175), Beijing NSF (no. 4073038), and Specialized Research Foundation of BJTU (no. 2006XM008 and no. 2005SZ005).

## Authors’ Affiliations

## References

- Silman J:
*Steganography and steganalysis: an overview.*SANS Institute; 2001.Google Scholar - Jamil T: Steganography: the art of hiding information in plain sight.
*IEEE Potentials*1999, 18(1):10-12. 10.1109/45.747237View ArticleGoogle Scholar - Upham D1997, http://zooid.org/~paul/crypto/jsteg/
- Westfeld A: F5-a steganographic algorithm.
*Proceedings of the 4th International Workshop on Information Hiding, 2001, Pittsburgh, Pa, USA*289-302.View ArticleGoogle Scholar - Provos N: Defending against statistical steganalysis.
*Proceedings of the 10th USENIX Security Symposium, 2001, Washington, DC, USA*323-335.Google Scholar - Westfeld A, Pfitzmann A: Attacks on steganographic systems.
*Proceedings of the 3rd International Workshop on Information Hiding, 2000*Google Scholar - Provos N, Honeyman P:
*Detecting steganographic content on the internet.*Center for Information Technology Integration, University of Michigan; 2001.Google Scholar - Liu Z, Xi L: Image information hiding encryption using chaotic sequence.
*Proceedings of the 11th International Conference on Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks, 2007*202-208.Google Scholar - Zhang Y, Zuo F, Zhai Z, Xiaobin C: A new image encryption algorithm based on multiple chaos system.
*Proceedings of the International Symposium on Electronic Commerce and Security (ISECS '08), August 2008*347-350.Google Scholar - Munir R, Riyanto B, Sutikno S, Agung WP: Secure spread spectrum watermarking algorithm based on chaotic map for still images.
*Proceedings of the International Conference on Electrical Engineering and Informatics, 2007*Google Scholar - Dawei Z, Guanrong C, Wenbo L: A chaos-based robust wavelet-domain watermarking algorithm.
*Chaos, Solitons and Fractals*2004, 22(1):47-54. 10.1016/j.chaos.2003.12.104View ArticleMATHGoogle Scholar - Holland JH:
*Adaptation in Natural and Artificial Systems*. MIT Press, Cambridge, Mass, USA; 1992.Google Scholar - Wu Y-T, Shih FY: Genetic algorithm based methodology for breaking the steganalytic systems.
*IEEE Transactions on Systems, Man, and Cybernetics B*2006, 36(1):24-31.View ArticleGoogle Scholar - http://os.inf.tu-dresden.de/~westfeld/publikationen/f5r11.zip
- http://www.philsallee.com/mbsteg/index.html
- http://www.outguess.org/download.php

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.