Associative Steganography. Durability of Associative Protection of Information
I. S. Vershinin, R. F. Gibadullin, S. V. Pystogov, V. A. Raikhlin
Abstract
The case of analysis of associatively protected cartographic scenes is considered. Protection of objects and their coordinates is achieved masking binary matrices of their code symbols. The set of inverse mask matrices is the recognition key. This allows such protection to be attributed to associative steganography. A message is considered to be unconditionally steadfast if it is statistically indistinguishable from a random sequence. Therefore, the study of its steadfastness is carried out using statistical tests of randomness NIST. If a pseudo-random sequence successfully passes the test of all 15 tests, then it is considered random (‘‘white’’). If there is a failure at least on one test, then it is considered ‘‘black’’. But in the case of the application of the basic masking algorithm, this cannot help the disclosure of the stegomessage. The effect of masking redundancy introduced with the aim of improving noise immunity on the durability of mapping objects to the effects of various attacks is considered. It is established that associative steganography retains the property of provable (computational) stability in this case as well. Recommendations for its use to protect the text characteristics of objects are given.