Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

Details Using Kolmogorov Complexity for Understanding Some Limitations on Steganography Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

2009-01-26

arxiv.org/abs/0901.4023v1

Computer Science

Computational Complexity

Scientific paper

Recently 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.

Affiliated with

Also associated with

No associations

Rating

Using Kolmogorov Complexity for Understanding Some Limitations on Steganography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Using Kolmogorov Complexity for Understanding Some Limitations on Steganography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Kolmogorov Complexity for Understanding Some Limitations on Steganography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-372260