Generalized fast coding steganographic algorithm based on prime number

A generalization of the fast coding method for efficient data hiding has been proposed. In this way, each secret digit in a prime-base notational system is represented by a series of cover values. Modification on one cover value can be used to embed several secret digits, so that distortion is observably reduced. The original fast coding method can be viewed as a special case of the generalized scheme with a prime base p = 2. And theoretical analysis shows that the generalized running coding with p = 3 can provide the best performance.