Associative steganography. Durability of associative protection of information

DOI10.1134/S1995080220030191zbMath1451.62076OpenAlexW3043337674MaRDI QIDQ2207058

S. V. Pystogov, V. A. Raikhlin, I. S. Vershinin, R. F. Gibadullin

Publication date: 27 October 2020

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080220030191

zbMATH Keywords

associative steganographysteganographic durabilitybasic masking algorithmcryptographic durabilityexcessive maskingNIST testingtext protection

Mathematics Subject Classification ID

Image analysis in multivariate analysis (62H35) Information storage and retrieval of data (68P20)

Related Items (3)

Is it possible to reduce the sizes of stegomessages in associative steganography? ⋮ Concept formalization in designing: roles of natural and artificial actors ⋮ The elements of associative stegnanography theory

Uses Software

• GitHub

Cites Work

• Unnamed Item
• A universal statistical test for random bit generators
• On a pseudorandom property of binary sequences
• The elements of associative stegnanography theory
• Reliable recognition of masked binary matrices. Connection to information security in map systems
• Communication Theory of Secrecy Systems*

This page was built for publication: Associative steganography. Durability of associative protection of information