Skip to Main content Skip to Navigation
New interface
Conference papers

Are 128 Bits Long Keys Possible in Watermarking?

Patrick Bas 1 Teddy Furon 2 
2 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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?
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, June 16, 2017 - 4:47:01 PM
Last modification on : Thursday, January 20, 2022 - 4:12:32 PM
Long-term archiving on: : Wednesday, January 10, 2018 - 1:38:27 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Patrick Bas, Teddy Furon. Are 128 Bits Long Keys Possible in Watermarking?. 13th International Conference on Communications and Multimedia Security (CMS), Sep 2012, Canterbury, United Kingdom. pp.191-191, ⟨10.1007/978-3-642-32805-3_15⟩. ⟨hal-01540890⟩



Record views


Files downloads