Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

Boris Ryabko 1, 2 Daniil Ryabko 3
1 SIBSUTI - Siberian State University of Telecommunications and Informatics
2 ICT SBRAS - Institute of Computational Technologies
3 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/hal-00639562
Contributor : Daniil Ryabko <>
Submitted on : Wednesday, November 9, 2011 - 3:19:19 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM

Identifiers

  • HAL Id : hal-00639562, version 1

Collections

CNRS | INRIA | UNIV-LILLE3 | INSMI | LAGIS

Citation

Boris Ryabko, Daniil Ryabko. Using Kolmogorov Complexity for Understanding Some Limitations on Steganography. IEEE International Symposium on Information Theory, 2009, seoul, South Korea. pp.2733-2736. ⟨hal-00639562⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

302

 

 

Contact

archive-ouverte@inria.fr