Steganographic algorithm based on a chaotic map

In this paper, we suggest a new steganographic spatial domain algorithm based on a single chaotic map. Unlike most existing steganographic algorithms, the proposed algorithm uses one chaotic map to determine the pixel position of the host color image, the channel (red, green or blue) and the bit position of the targeted value in which a sensitive information bit can be hidden. Furthermore, this algorithm can be regarded as a variable-sized embedding algorithm. Experimental results demonstrate that this algorithm can defeat many existing steganalytic attacks. In comparison with existing steganographic spatial domain based algorithms, the suggested algorithm is shown to have some advantages over existing ones, namely, larger key space and a higher level of security against some existing attacks.

► We model a steganographic spatial domain algorithm for hiding information in an image. ► A 2-D chaotic map is used to obtain the pixel position, color and host bit position. ► The algorithm can be regarded as a variable-sized embedding algorithm. ► Experimental results show that this algorithm can defeat many existing attacks. ► Advantages over existing algorithms are highlighted.