Steganography: a Class of Algorithms having Secure Properties

Details Steganography: a Class of Algorithms having Secure Properties Steganography: a Class of Algorithms having Secure Properties

2011-12-07

arxiv.org/abs/1112.1675v1

Computer Science

Discrete Mathematics

4 pages, published in Seventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH

Scientific paper

Chaos-based approaches are frequently proposed in information hiding, but without obvious justification. Indeed, the reason why chaos is useful to tackle with discretion, robustness, or security, is rarely elucidated. This research work presents a new class of non-blind information hidingalgorithms based on some finite domains iterations that are Devaney's topologically chaotic. The approach is entirely formalized and reasons to take place into the mathematical theory of chaos are explained. Finally, stego-security and chaos security are consequently proven for a large class of algorithms.

Affiliated with

Also associated with

No associations

Rating

Steganography: a Class of Algorithms having Secure Properties 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 Steganography: a Class of Algorithms having Secure Properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Steganography: a Class of Algorithms having Secure Properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-598768