This article is devoted to the study of the improved neighbor mean interpolation (INMI) steganographic method. To date, no steganalysis of such a method of information embedding has been carried out. We implemented the INMI method of embedding messages in raster files and conducted a stegoanalysis on a set of 800 images of 225 × 225 size. Experimentally, we found that with this embedding method, the maximum container capacity is 21% and that it depends on the contents of the container. It is established that only 60 files out of 800 actually have the maximum capacity. We presented the calculation of the Type I error and the percentage of information detection in the obtained containers by the regular–singular (RS) method. The results showed that the considered steganographic algorithm is resistant to RS steganalysis and is comparable to the stegosystem of the permutation method investigated in one of our previous articles.

In this paper we propose a new method for hidden messages transmission in social networks, on the example of the network “Vkontakte”. It was proposed to use a graph structure of user's friends to embed a secret message. It was tested for robustness of this method to a statistical stegoanalysis. It was shown the necessity of adding redundancy to secret messages for preventing successful steganalysis.

In this article we present a new method of stegoanalysis revealing the text produced by the synonym runlength encoding steganography. During this research, it was shown that RLE embedding method changes statistical structure of extracted message and this fact could be used for stegoanalysis. In the constructed method we compare the probability distribution of runs (with length no more than 5 bits) in the message extracted from the analyzed container with reference distributions corresponding to empty and filled containers. The Kullback-Leibler measure is used as a divergence measure of two probability distributions. It was shown that the proposed method makes it possible to detect a secret message in the container having 500 synonyms, while the false negative error is 1.5 ^% and the false positive error is 1.3%. In comparison with known analogs, the proposed method has higher accuracy of steganalysis with smaller size of input data.

НОВЫЙ МЕТОД СТЕГОАНАЛИЗА ТЕКСТОВЫХ ДАННЫХ, ПОЛУЧЕННЫХ КОДИРОВАНИЕМ ДЛИН СЕРИЙ СИНОНИМОВ

In this paper we propose new attack on dynamic watermark scheme Radix-n widely known as one of the most secure. It was shown that we are able to reveal dynamically allocated memory blocks and then a digital watermark can be discovered by hooking API function calls. During the experiment it was ascertained that often an amount of such structures is low because of widely used optimization. This feature increases a probability of successful attack on dynamic watermark.

Анализ устойчивости динамических водяных знаков