Visual pattern embedding in multi-secret image steganography

This article presents a new method of steganographic keys generation for secret key visual steganography, when there is a need of embedding many secret messages in one container. The main assumptions which such algorithm has to meet are such that there should be no conflicts in generated keys, in other words keys cannot indicate the same positions (determining the way of secret image distribution over container). Secret data should be scattered in carrier randomly. Recovering any secret should be fast (with known key) without necessity of extracting all other messages. The proposed method can find application in multi-secret steganography in which many messages are embedded in a single container, especially with techniques of substitution or cover lookup.