摘要
分析了一种基于混沌映射的抗剪切鲁棒水印算法。根据密钥空间的两种不同选择方式,分别给出了一个选择明文攻击方案。对于N1×N2大小的水印图像,攻击方案的选择明文量分别为1幅载体图像和N1×N2幅水印图像,计算复杂度分别为1次和(N1×N2+1)次水印,成功率均为1。理论分析和实验证明,该水印算法是不安全的。
This paper analyzes a resisting cropping robust watermarking algorithm based on chaotic map. Two plaintext-chosen attacks are proposed respectively according to the two different ways of choosing key spaces. Data complexities of the two attacks are 1 cover image and N1×N2 watermark images, and the computing complexities are 1 and N1×N2 ＋1 computations of watermarking algorithm respectively. Success rates of them are both 1. Theoretic analysis and experimental results show the watermarking algorithm is insecure.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第18期164-166,共3页
Computer Engineering
基金
河南省杰出青年科学基金资助项目(0312001800)
关键词
密码分析
选择明文攻击
数字水印
混沌映射
Cryptanalysis
plaintext-chosen attack
digital watermarking
chaotic mapping
