Abstract:
An adaptive steganography algorithm for data hiding in full-color images based on iterative introduction of minor distortions into blocks of container images and the use of high-speed non-cryptographic hash functions for data extraction is considered. Modification of the minimum number of container elements compared to the length of the hidden message is a distinctive feature of the algorithm. This feature allows the hidden throughput to be increased and the visual and statistical visibility of hidden data to be reduced. The algorithm is compared with modern algorithms of adaptive spatial steganography in terms of assessing the level of distorting changes in stego-containers. In addition, a modified version of the algorithm that implements covert channel multiplexing using a common subset of container elements when embedding various messages into them is considered.