Skip to main content
Conference ProceedingsOPEN ACCESS

Are 128 bits long keys possible in watermarking?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7394 LNCS 191
DOI: 10.1007/978-3-642-32805-3_15
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The question raised in this poster is the following: is the key length of a watermarking system proportional to the key length of the seed used to generate the watermark? For example, if a watermark is generated from a binary sequence of size n, does it means that the key length is 2 n? © 2012 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Bas, P., & Furon, T. (2012). Are 128 bits long keys possible in watermarking? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7394 LNCS, p. 191). https://doi.org/10.1007/978-3-642-32805-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free