Papers
Topics
Authors
Recent
Search
2000 character limit reached

A watermarking algorithm satisfying topological chaos properties

Published 26 Oct 2008 in cs.CR | (0810.4713v1)

Abstract: A new watermarking algorithm is given, it is based on the so-called chaotic iterations and on the choice of some coefficients which are deduced from the description of the carrier medium. After defining these coefficients, chaotic discrete iterations are used to encrypt the watermark and to embed it in the carrier medium. This procedure generates a topological chaos and ensures that the required properties of a watermarking algorithm are satisfied. Key-words: Watermarking, Encryption, Chaotic iterations, Topological chaos, Information hiding

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.