摘要
给出的基于互补矩阵数据隐藏算法在数据隐藏量和安全性两方面都有良好性能。算法可以在长为n bit的宿主数据嵌入[lb2n]bit的秘密数据,而对宿主数据的修改量平均为[(3/2)?(1/2m?1)]bit。互补矩阵H的多种取法及密钥k的引入增加了算法的安全性。
The complementary matrix-based algorithm for data hiding presented does a good job at capacity of data hiding and data security. The proposed algodthrn can conceal as many as [1b2n] bits data in n bits host data stream, by changing, averagely, [（3/2）-（1/2^m-1）] bits. There are so many kinds of complementary matrices, and the secret key is only shared by the sender and extractor, so the algodthrn is very secure.
出处
《通信学报》
EI
CSCD
北大核心
2007年第11期38-43,共6页
Journal on Communications
关键词
数据隐藏
互补矩阵
矩阵理论
隐藏容量
安全性
data hiding
complementary matrix
matrix theory
capacity of data hiding
security
