Abstract

Along with features of the architecture of a textual DBMS with associative protection, problems of encoding text characters and generating a protected database using encoded text are considered in the context of an earlier infological database for the associative protection of text messages. The steganographic resistance of associative protection is assessed using the NIST (National Institute of Standards and Technology) set of statistical randomness tests. It is shown that the steganographic resistance of the approach is unconditional if certain conditions are met by lengthening the time for generating steganographic messages. The rates of concealing and decrypting associative steganographic text are compared to those of the modern Russian cryptosystem (the Kuznyechik cipher) and the AES (Advanced Encryption Standard) cryptosystem.

中文翻译：

---

文字讯息的联想隐写

摘要

连同具有关联保护的文本DBMS的体系结构的功能一起，在较早的用于文本消息的关联保护的信息数据库的上下文中，考虑了编码文本字符和使用编码的文本生成受保护的数据库的问题。使用NIST（美国国家标准与技术学院）统计随机性测试集评估联想保护的隐写抵抗力。结果表明，如果通过延长生成隐写消息的时间满足某些条件，则该方法的隐写抵抗是无条件的。将隐藏和解密关联密写文本的速率与现代俄罗斯密码系统（Kuznyechik密码）和AES（高级加密标准）密码系统的速率进行了比较。