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?
Type de document :
Communication dans un congrès
Bart Decker; David W. Chadwick. 13th International Conference on Communications and Multimedia Security (CMS), Sep 2012, Canterbury, United Kingdom. Springer, Lecture Notes in Computer Science, LNCS-7394, pp.191-191, 2012, Communications and Multimedia Security. 〈10.1007/978-3-642-32805-3_15〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01540890
Contributeur : Hal Ifip <>
Soumis le : vendredi 16 juin 2017 - 16:47:01
Dernière modification le : mercredi 11 avril 2018 - 01:51:29
Document(s) archivé(s) le : mercredi 10 janvier 2018 - 13:38:27

Fichier

978-3-642-32805-3_15_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Patrick Bas, Teddy Furon. Are 128 Bits Long Keys Possible in Watermarking?. Bart Decker; David W. Chadwick. 13th International Conference on Communications and Multimedia Security (CMS), Sep 2012, Canterbury, United Kingdom. Springer, Lecture Notes in Computer Science, LNCS-7394, pp.191-191, 2012, Communications and Multimedia Security. 〈10.1007/978-3-642-32805-3_15〉. 〈hal-01540890〉

Partager

Métriques

Consultations de la notice

299

Téléchargements de fichiers

15