Paper
9 May 2000 Secure digital watermark generation based on chaotic Kolmogorov flows
Josef Scharinger
Author Affiliations +
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.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Josef Scharinger "Secure digital watermark generation based on chaotic Kolmogorov flows", Proc. SPIE 3971, Security and Watermarking of Multimedia Contents II, (9 May 2000); https://doi.org/10.1117/12.384984
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital watermarking

Diffusion

Signal detection

Complex systems

Detection and tracking algorithms

Error analysis

Statistical analysis

RELATED CONTENT


Back to Top