An image encryption scheme based on irregularly decimated chaotic maps

An image encryption scheme provides means for securely transmitting images over public channels. In this work, we propose a robust shuffling–masking image encryption scheme based on chaotic maps. The shuffling phase permutes square blocks of bytes using a 3-dimensional chaotic cat map coupled with a zigzag scanning procedure. The masking phase then scrambles b-byte blocks of the shuffled image with combined outputs of three 1-dimensional chaotic skew tent maps, in such a way that the masking of every block is influenced by all previously masked blocks. Empirical results show that while the suggested scheme has good running speed, it generates ciphered images that exhibit (i) random-like behavior, (ii) almost flat histograms, (iii) almost no adjacent pixel correlation, (iv) information entropy close to the ideal theoretical value. Furthermore, this scheme has a large key space, strong sensitivity to the secret key, and is robust against differential attacks. On the basis of these results, this scheme can be regarded as secure and reliable scheme for use in secure communication applications.     

基于奇异值分解的Contourlet域图像水印算法

针对小波变换由于方向性缺乏而无法有效稀疏地表示图像本身几何结构的问题,结合Contourlet变换和奇异值分解的优点,提出了一种Contourlet变换域内基于奇异值分解的数字水印算法。宿主图像经过两层Contourlet分解后,生成一系列多尺度多方向的子带,选取第二层分解中能量最大的子带进行大小为4×4的互不重叠的分块,并进行奇异值分解,再将置乱后的原始二值水印信息嵌入到奇异值矩阵中。实验结果表明,该算法实现简单,透明性良好,对常规攻击和几何攻击具有较强的鲁棒性,且优于一般的小波域算法。     

一类基于Arnold变换的高效率分块图像置乱算法的研究

传统的基于Arnold变换的数字图像置乱方法存在置乱过程缺乏随机性,保密性不高,置乱周期过大降低了算法的效率等问题。针对上述问题,提出了一种高效率的分块图像置乱算法。该算法基于分块的思想,先对图像进行分块处理,而后对图像块进行Arnold变换,从而实现了对图像置乱加密的目的。实验结果表明:该算法可以缩短图像置乱的周期,操作简单,执行效率高,安全性强。     

A novel image encryption algorithm based on a 3D chaotic map

Recently [Solak E, Çokal C, Yildiz OT Biyikogˇlu T. Cryptanalysis of Fridrich’s chaotic image encryption. Int J Bifur Chaos 2010;20:1405-1413] cryptanalyzed the chaotic image encryption algorithm of [Fridrich J. Symmetric ciphers based on two-dimensional chaotic maps. Int J Bifur Chaos 1998;8(6):1259-1284], which was considered a benchmark for measuring security of many image encryption algorithms. This attack can also be applied to other encryption algorithms that have a structure similar to Fridrich’s algorithm, such as that of [Chen G, Mao Y, Chui, C. A symmetric image encryption scheme based on 3D chaotic cat maps. Chaos Soliton Fract 2004;21:749-761]. In this paper, we suggest a novel image encryption algorithm based on a three dimensional (3D) chaotic map that can defeat the aforementioned attack among other existing attacks. The design of the proposed algorithm is simple and efficient, and based on three phases which provide the necessary properties for a secure image encryption algorithm including the confusion and diffusion properties. In phase I, the image pixels are shuffled according to a search rule based on the 3D chaotic map. In phases II and III, 3D chaotic maps are used to scramble shuffled pixels through mixing and masking rules, respectively. Simulation results show that the suggested algorithm satisfies the required performance tests such as high level security, large key space and acceptable encryption speed. These characteristics make it a suitable candidate for use in cryptographic applications.     

水印的最佳置乱度置乱算法

介绍了数字图像置乱的基本概念,引入置乱度的定义对置乱后的图像作定量分析,提出了基于二维混沌映射Arnold变换的数字图像置乱方法,通过分析Arnold变换的周期及控制参数,实现对数字图像的最佳置乱。并通过对数字水印信号进行置乱,使得原始水印信号的相关性减弱,在遭到剪切攻击时,可以将提取出的水印信号的错误码元尽可能地分散开来,因此有效地提高了数字水印算法的抗剪切攻击性能。     

基于Arnold变换与LSB嵌入的数字水印系统

介绍了图像置乱算法的概念和几种常见的图像置乱算法,然后讨论了基于Arnold变换的图形置乱算法并利用MATLAB7.0对这一算法进行了实现,最后提出了一种基于Arnold置乱变换与改进LSB嵌入方案的数字水印系统.     

基于纹理特征的鲁棒图像水印算法研究

文章提出了一种新的基于图像纹理特征分块的鲁棒水印算法.算法提取载体图像抗攻击性较强的特征向量,对其进行分级聚类分析,从而自适应地确定水印嵌入的最佳区域.为了在保证水印不可见感知的前提下最大限度地提高水印的嵌入能量,本文给出了采用加法嵌入公式时水印最大嵌入强度估计.实验结果表明,该算法在保证图像质量的前提下,对几何同步、噪声干扰、剪切、JPEG压缩等攻击具有较强的鲁棒性.     

基于新的Arnold反置乱的二值图像信息隐藏

主要研究的是二值图像的信息隐藏技术。这类图像的信息隐藏,具有人眼易觉察、稳健性不高且容量受限制的缺点。目的正是在于提高该类图像信息隐藏的稳健性和人眼不可见性。首先对图像进行处理,即计算各像素点修改度,将原始图像和分配了可修改优先级的图像用同一算法和参数Arnold置乱,在嵌入信息后进行新的Arnold反置乱。通过Matlab试验,信息载体图像与原始二值图像相比没有明显降质,嵌入的数据可以无损恢复.原始图像也可以无损恢复。     

DCT域基于系数符号关系的印刷水印算法

针对条码印刷防伪应用,提出一种条码印刷防伪算法,使水印对一次打印扫描具有鲁棒性,对二次打印扫描具有脆弱性,以区分原始载体作品的真伪。根据条码水印图像的大小对载体图像进行分块DCT变换,选取中低频系数,同时对这些系数幅值小的进行放大修改,并通过修改系数符号的正负性来嵌入二值条码水印。根据嵌入水印后图像的分块DCT系数的正负性来提取水印,水印提取过程实现了盲提取。通过设定合适的阈值可以判断原图像真伪。仿真实验验证了算法具有很好的不可见性,符合印刷品防伪技术的要求。     

Image encryption using high-dimension chaotic system

In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. This paper proposes a new approach for image encryption based on a high-dimensional chaotic map. The new scheme employs the Cat map to shuffle the positions, then to confuse the relationship between the cipher-image and the plain-image using the high-dimensional Lorenz chaotic map preprocessed. The results of experimental, statistical analysis and key space analysis show that the proposed image encryption scheme provides an efficient and secure way for real-time image encryption and transmission.