The results of the author’s collective research on the theory of associative steganography are systematized in order to bring them to a wide range of developers and users of stegosystems. The concept of associative steganography is associated with the associative protection of a finite set of object types and their coordinates, the decimal code symbols of which are represented by masked binary matrices of the same size. Consideration is carried out from positions of constructive modeling of systems. The accepted postulates on the principles of concealment, the logical interpretation of the criterion of Shannon’s perfect secrecy, the choice of the sizes of matrices and the randomizing gamma are explained. The masking algorithm is described. Estimates of the effectiveness of associative protection are given: the proof of the basic theorem, the estimation of speed, stiffness and noise immunity.

中文翻译：

---

联想隐写术理论的要素

作者对联想隐写术理论的集体研究的结果被系统化，以便将其带给广泛的隐身系统开发者和用户。关联隐写术的概念与对象类型及其坐标的有限集合的关联保护相关，对象类型及其坐标的十进制代码符号由相同大小的蒙版二进制矩阵表示。从系统的建设性建模位置进行考虑。公认的隐瞒原理，香农完美保密标准的逻辑解释，矩阵大小的选择和随机伽玛得到了解释。描述了屏蔽算法。给出了关联保护有效性的估计：基本定理的证明，