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 2n?
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bas, P., Furon, T. (2012). Are 128 Bits Long Keys Possible in Watermarking?. In: De Decker, B., Chadwick, D.W. (eds) Communications and Multimedia Security. CMS 2012. Lecture Notes in Computer Science, vol 7394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32805-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-32805-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32804-6
Online ISBN: 978-3-642-32805-3
eBook Packages: Computer ScienceComputer Science (R0)