摘要
提出了一种基于队列变换的数字图像置乱新算法。该算法克服了Arnold等置乱变换中存在取模运算,运算量大以及求逆变换困难的缺点。满足任意大小的数字图像进行置乱变换。与密码技术相结合,具有很高安全性,根据变换可以选择图像外的点为参照点的性质,使得密钥的选择具有无穷性,只要密钥的长度足够长,攻击者几乎无法攻破密钥。
A new class of digital image scrambling algorithm based on the method of queue transformation is proposed. This algorithm overcomes the disadvantages of Arnold which needs module arithmetic and difficult to seek the reverse transformation. This algorithm can achieve the digital image scrambling of any size. It is difficult for the attacker to decode just because of its infinite in the selection of referral point.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2005年第1期148-149,152,共3页
Computer Engineering
关键词
行列式
数字图像置乱
加密
数字水印
Determinant
Digital image scrambling
Encrypt
Watermarking
