Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

Simple item page
dc.creatorRyabko, Boris
dc.creatorRyabko, Daniil
dc.date2009-01-26
dc.date.accessioned2026-07-07T12:34:34Z
dc.date.available2026-07-07T12:34:34Z
dc.descriptionRecently perfectly secure steganographic systems have been 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.
dc.identifierhttps://arxiv.org/abs/0901.4023
dc.identifierhttp://arxiv.org/abs/0901.4023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217479
dc.subjectComputational Complexity
dc.subjectCryptography and Security
dc.titleUsing Kolmogorov Complexity for Understanding Some Limitations on Steganography
dc.typetext

Files

Collections

arXiv