Abstract
Associative steganography embodies a kind of symbiosis of the concepts of steganography and cryptography. The dimensions of the size of stegomessages were previously determined by the condition that the volume of bit inclusions should not exceed 1% of the volume of the media, which is typical for steganography. Accordingly, the previous studies were carried out with the size of binary matrix-standards of code symbols \(m\times{n}=119\times 60\). The article discusses the importance of the so-called completeness of coverage for the durability of associative protection to a ‘‘frontal’’ attack (known as a brute-force attack). The criterion of completeness is formulated when the search is limited by the time frames of creating a database of scenes with associative protection and cryptanalysis of messages. It is shown that the completeness of the coverage with such an enumeration can also be established in the cases \(n<60\) if its volume is increased accordingly. Estimates are given for reducing the size of the carrier when choosing \(n=40\) and 30. It is established that the resistance to ‘‘frontal’’ attack, steganographic durability, and good noise immunity of hidden messages with this choice is maintained.
Similar content being viewed by others
REFERENCES
R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification and Scene Analysis (Wiley, New York, 1973), Vol. 3, pp. 731–739.
V. A. Raikhlin, I. S. Vershinin, R. F. Gibadullin, and S. V. Pystogov, ‘‘Reliable recognition of masked binary matrices. Connection to information security in map systems,’’ Lobachevskii J. Math. 34, 319–325 (2013).
V. A. Raikhlin, R. F. Gibadullin, I. S. Vershinin, and S. V. Pystogov, ‘‘Reliable recognition of masked cartographic scenes during transmission over the network,’’ in Proceedings of the 2016 International Siberian Conference on Control and Communications SIBCON (IEEE, 2016), pp. 1–5.
V. A. Raikhlin, I. S. Vershinin, and R. F. Gibadullin, ‘‘The elements of associative steganography theory,’’ Moscow Univ. Bull. Comput. Math. Cybern. 43, 40–46 (2019).
I. S. Vershinin, R. F. Gibadullin, S. V. Pystogov, and V. A. Raikhlin, ‘‘Associative steganography. Durability of associative protection of information,’’ Lobachevskii J. Math. 41, 440–450 (2020).
I. S. Vershinin, R. F. Gibadullin, S. V. Pystogov, and V. A. Raikhlin, ‘‘Associative steganography of text messages,’’ Moscow Univ. Comput. Math. Cybern. 45, 1–11 (2021).
V. A. Raikhlin, I. S. Vershinin, R. K. Klassen, R. F. Gibadullin, and S. V. Pystogov, Constructive Modeling of Synthesis Processes (Nauka, Kazan, 2020) [in Russian].
What is Mersenne Twister (MT)? http://www.math.sci.hiroshima-u.ac.jp/m-mat/MT/ewhat-is-mt.html. Accessed 2021.
ASCII. https://www.industrialnets.ru/files/misc/ascii.pdf. Accessed 2021.
J. K. M. S. Zaman and R. Ghosh, ‘‘Review on fifteen statistical tests proposed by NIST,’’ J. Theor. Phys. Cryptogr. 1, 18–31 (2012).
I. S. Vershinin, ‘‘Refinement of the redundancy criterion of noise-proof concealment of informatics in the framework of associative steganography,’’ Inform. Bezopasn. 19, 511–514 (2016).
C. E. Shannon, ‘‘Communication theory of secrecy systems,’’ Bell System Tech. J. 28, 656–715 (1949).
Author information
Authors and Affiliations
Corresponding authors
Additional information
(Submitted by A. M. Elizarov)
Rights and permissions
About this article
Cite this article
Raikhlin, V.A., Gibadullin, R.F. & Vershinin, I.S. Is It Possible to Reduce the Sizes of Stegomessages in Associative Steganography?. Lobachevskii J Math 43, 455–462 (2022). https://doi.org/10.1134/S1995080222050201
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080222050201