Share Email Print

Proceedings Paper

Secure digital watermark generation based on chaotic Kolmogorov flows
Author(s): Josef Scharinger
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The fundamental conditions that have to be fulfilled by a cryptographically secure watermark generation algorithm can be summarized as follows: availability of a large number of different watermarking keys, confusion to ensure that properties of any watermark key are not reflected in the corresponding watermark, and diffusion demanding that similar watermark keys always do result in completely different watermarks. Due to several drawbacks associated with methods based on Anosov diffeomorphisms we propose to use discrete versions of chaotic Kolmogorov flows instead to increase the cryptanalytic strength of the watermark generation scheme. For this approach it can be shown by combinatorial arguments that the number of different watermark keys grows exponentially and that fulfillment of the confusion requirement can be checked by standard statistical tests delivering results which are definitely within a reasonable experimental error when compared to the confidence level in use, while simulations investigating the diffusion distance amount to an average diffusion distance that is perfectly in line with the optimum average diffusion distance calculated analytically.

Paper Details

Date Published: 9 May 2000
PDF: 8 pages
Proc. SPIE 3971, Security and Watermarking of Multimedia Contents II, (9 May 2000); doi: 10.1117/12.384984
Show Author Affiliations
Josef Scharinger, Johannes-Kepler-Univ. Linz (Austria)

Published in SPIE Proceedings Vol. 3971:
Security and Watermarking of Multimedia Contents II
Ping Wah Wong; Edward J. Delp III, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?