Инд. авторы:	Ryabko B.Y., Ryabko D.
Заглавие:	Using Kolmogorov Complexity for Understanding Some Limitations on Steganography
Библ. ссылка:	Ryabko B.Y., Ryabko D. Using Kolmogorov Complexity for Understanding Some Limitations on Steganography // 2009 IEEE International Symposium on Information Theory (ISIT'09): IEEE International Symposium on Information Theory (ISIT 2009) (JUN 28-JUL 03, 2009). - 2009. - Seoul. - P.2733-2736. - ISBN: 978-1-4244-4312-3.
Внешние системы:	DOI: 10.1109/ISIT.2009.5205847; РИНЦ: 15298145; SCOPUS: 2-s2.0-70449460962; WoS: 000280141401263;
Реферат:	eng: Perfectly secure steganographic systems have been recently described for a wide class of sources of covertexts. The speed of transmission of secret information for these stegosystems is proportional to the length of the covertext. In this work we show that there are sources of covertexts for which such stegosystems do not exist. The key observation is that if the set of possible covertexts has a maximal Kolmogorov complexity, then a high-speed perfect stegosystem has to have complexity of the same order.
Издано:	Seoul: , 2009
Физ. характеристика:	с.2733-2736