Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

Boris Ryabko; Daniil Ryabko

Conference Papers Year : 2009

Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

(1, 2) , (3)

1
2
3

Boris Ryabko

Function : Author

Siberian State University of Telecommunications and Informatics

Institute of Computational Technologies [Novosibirsk]

Daniil Ryabko

Function : Author

Sequential Learning

Domains

Computer Science [cs] Cryptography and Security [cs.CR] Computer Science [cs] Information Theory [cs.IT] Mathematics [math] Information Theory [math.IT]

Daniil Ryabko : Connect in order to contact the contributor

https://hal.inria.fr/hal-00639562

Submitted on : Wednesday, November 9, 2011-3:19:19 PM

Last modification on : Tuesday, March 22, 2022-8:30:02 PM

Dates and versions

hal-00639562 , version 1 (09-11-2011)

Identifiers

HAL Id : hal-00639562 , version 1

Cite

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⟩

Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share