基于动态密钥选择与多方向扩散的图像加密算法

设计了基于动态密钥选择与多方向扩散的图像加密算法。利用128位外部密钥来生成4个Logistic映射的初值,通过对其迭代,获取4个随机序列;利用明文自身像素特性,定义一个引擎计算函数,联合随机序列,在像素置乱过程中,根据引擎值来动态选择加密密钥,通过构建非线性像素交叉互换方法,不同的密钥来置乱不同的明文像素位置,消除了置乱周期性;设计4方向连续扩散方法,利用4个方向的扩散函数对置乱图像进行加密。测试数据表明:与当前图像加密技术相比,所提技术具备更高的安全性与抗明文攻击能力,能够较好地对图像完成解密。     

基于混合相位掩码与Gyrator小波变换的光学图像加密算法

为了提高密文的安全性,设计了基于混合相位掩码与Gyrator小波变换的光学图像加密算法。基于Logistic映射,利用明文像素对其迭代,生成一个随机相位掩码,引入Fresnel波带与Hilbert相位函数,获取二者对应的相位掩码,通过对这三个相位掩码进行组合,形成一个混合相位掩码,对输入明文进行调制处理;联合Gyrator变换与小波变换,构建Gyrator小波变换机制,根据明文像素迭代Logistic映射所输出的混沌序列来计算其旋转角度,获取明文Gyrator频谱对应的4个子带;对这些子带进行位置复用,借助幅度-相位截断技术,获取相应的密文与相位信息,而相位信息则视为解密密钥,以准确复原明文。实验数据表明:与当前非对称光学加密机制相比,所提算法具有更高的密文安全性与抗明文攻击能力。     

基于像素动态更新与差异扩散的图像加密算法

提出了基于像素动态更新与差异扩散的图像加密算法。引入Lucas与Fibonacci序列,充分利用二者的更新特点,基于二维映射,设计像素动态更新机制,在每一轮像素混淆过程中,利用不同的随机序列完成像素位置置乱,避免了置乱周期性;依据人眼视觉特性,建立像素重要等级模型,明文像素分类为视觉像素与次级像素;利用明文像素生成映射的初值,通过建立序列量化机制,获取一组密钥流;根据密钥流,设计两个像素扩散函数,对视觉像素与次级像素进行差异扩散,以输出密文。测试数据显示:与当前图像加密机制相比,所提算法具有更高的安全性,输出密文像素分布更加均匀。     

基于图像重组和比特置乱的多图像加密

针对现有多图像加密算法只能同时加密多张同类型同大小的图像,适用范围不广、实用性差等问题,提出一种基于图像重组和比特置乱的多图像加密算法.该算法通过将任意数量、不同大小和不同类型的图像重新组合成新多灰度图,一次完成同时加密,极大提高了加密效率和适用范围.首先,依次提取所有待加密图像像素值重新组合出N张m×n新灰度图,并将其转化成m×n×8N二进制矩阵.然后,采用3D比特置乱方式,对高位页进行行列比特置乱,低位页进行整页比特置乱.最后,进行异或扩散操作,得到密文图像.高低位分开置乱提高了算法的抗噪声能力,最终密文信息熵达到7.999以上,很好地掩盖了明文的统计特性.构造一种新型Logistic与广义三阶Fibonacci级联的混沌系统产生随机序列,增加了初值和控制参数范围,扩大了密钥空间,使其达到8×10^84以上,极大地提高了抗穷举攻击能力.既提高了序列随机性,又同时保留了低维混沌系统的快速性.结合明文哈希值(SHA-256)产生密钥,明文像素值发生微小改变后密文像素值变化率达到0.996以上,极大地提高了的明文敏感性和算法抗选择明文攻击的能力.实验分析表明,提出的多图像加密算法安全性高、实用性强.     

基于混沌映射的图像快速加密改进算法

针对当前的三维混沌映射加密算法存在安全性不高,加密速度慢以及密钥空间小等不足,提出了一种新的三维混沌映射图像加密算法;首先利用快速置乱方法置乱初始图像,以改变像素位置;利用三维Chen系统结合像素值变换函数所生成初始外部密钥迭代三维混沌映射,得到一个序列,由此根据混淆机制对置乱图像像素值进行混淆;改变外部密钥,再迭代计算三维混沌映射,得到三元一维伪随机数组,借助密钥流机制量化该数组,得到新数组,由此根据扩散机制对混淆后的像素进行扩散处理;采用酷睿3.5 GHz双核CPU的PC机和MATLAB仿真平台,输入256×256的明文图像实验,置乱100次所用时间为78.67 s,在灰度平面内其相关性约为-0.001 652,表明该算法高度安全,密钥空间巨大,加密速度快,用于图像快速加密是可行、有效的。     

基于多混沌系统的双图像光学加密算法

为了扩展双图像光学加密算法的密钥空间,克服双随机相位加密系统中随机相位掩模作为密钥难于存储、传输和重构的问题,突破传统图像加密的研究思路,提出了一种基于多混沌系统的双图像加密算法,构造了光学加密系统。系统增加混沌系统参数作为密钥,利用混沌加密密钥空间大和图像置乱隐藏性好的特点,构建基于Logistic混沌映射的图像置乱算法,利用Kent混沌映射生成的伪随机序列构造出一对随机相位掩模,分别放置在分数傅里叶变换光学装置的两端,图像经加密系统变换后得到密文。数值仿真结果表明,算法的密钥敏感性极高,能够有效地对抗统计攻击,具有较高的安全性。     

三维可逆混沌映射的图像加密算法

提出了一种三维可逆混沌映射图像加密算法。基于Line map二维混沌可逆映射,推导了该三维可逆映射的数学表达式。将灰度图像用一个三维矩阵数据描述,并按照所提出的算法将其组成一个二维的二进制图像。首先对此图像应用Line map二维混沌可逆映射进行像素置乱处理,然后再将置乱后的二进制图像还原成十进制的灰度图像,这样就得到了加密后的图像。所提出的方法可以通过一次三维可逆混沌映射同时实现图像加密的两个步骤,即像素置乱和像素混淆。仿真实验结果表明了该算法的有效性,且加密速度快、安全性高、简单易行。     

一种基于混沌系统的新型图像加密算法

针对加密算法对明文敏感性较低的问题,提出了一种基于混沌系统的新型图像加密算法。采用SHA256函数对明文图像进行计算得到初值,将初值代入混沌系统生成伪随机序列,进一步使用该序列完成对明文图像的置乱。使用并行扩散机制对置乱图像进行第一轮扩散,在此基础上利用DNA动态编码技术进行第二轮扩散。对DNA矩阵解码得到二进制矩阵,进一步转化为十进制矩阵,得到加密图像。进行了计算机仿真分析和对比,通过对统计特性、差分特性、信息熵、密钥和鲁棒性的分析与测试,表明该算法安全性较好且易于实现,具有较大的应用前景。     

对一类超混沌图像加密算法的密码分析与改进

对一种超混沌图像加密算法及其改进版进行了安全性分析, 结果表明该类算法的置乱过程都是与混淆过程相脱离的, 且混淆过程的加密公式简单; 因此都不能抵抗选择明文和选择密文攻击. 进而提出了一种改进的加强型超混沌图像加密算法; 改进算法包含两轮像素值替代加密操作, 并使得密文与明文、密钥之间的关系更复杂. 安全性分析和实验测试表明, 改进算法不仅克服了原算法不能抵御选择明文和选择密文攻击的缺陷; 而且具有时间开销更小和抗差分攻击性能更好的优势.     

基于改进Logistic混沌映射的数字图像加密算法研究

混沌序列具有伪随机性、遍历性、对初始条件极其敏感性以及具备白噪声的统计特性等特点;文章利用Logistic混沌映射的改进算法产生的混沌序列所具有的这些特性,对数字图像进行空域像素进行位置置乱,然后对置乱后的图像序列按照一定的方法进行异或处理得到加密图像;实验在图像的竖直、水平、对角线方向,随机选择像素点,利用其灰度值,图像像素个数,计算数学期望,方差,协方差,相关系数;结果表明文章算法扰乱了图像像素间的相关性,使得加密图像能够抵抗明文统计的攻击,且密钥空间大,运算速度快,具有非常好的加密效果。     

Double image encryption based on discrete multiple-parameter fractional Fourier transform and chaotic maps

A double image encryption method is proposed by utilizing discrete multiple-parameter fractional Fourier transform and chaotic maps. One of the two original images scrambled by one chaotic map is encoded into the amplitude of a complex signal with the other original image as its phase. The complex signal multiplied by another chaotic random phase mask is then encrypted by discrete multiple-parameter fractional Fourier transform. The parameters in chaotic map and discrete multiple-parameter fractional Fourier transform serve as the keys of this encryption scheme. Numerical simulations have been done to demonstrate the performance of this algorithm.     

基于菲涅耳变换的图像加密算法

针对相位截断加密算法无法抵御信息泄露问题,文章提出了一种基于相位截断菲涅耳变换与随机振幅掩模的加密算法,以抵御信息泄露问题;算法首先将原彩色图像分为3个独立的颜色通道,在对其进行菲涅耳变换后加入随机振幅掩模通道,将4个通道分别进行菲涅耳衍射截断处理;算法通过级联处理不仅提高了秘钥与密文间的关联性,还消除了信息泄露的风险;通过仿真试验与结果分析可知,本算法不仅在波长与自由空间传播错误距离参数、密文噪声、遮挡污染、密文泄露以及不同攻击等情况下有较好的鲁棒性,还解决了信息泄露问题。     

Fractional Fourier-domain random encoding and pixel scrambling technique for double image encryption

A double image encryption method is proposed using fractional Fourier-domain random encoding and pixel scrambling technique. One of the two original images is encoded into the phase function of a synthesized input signal after being scrambled, and the other original image encoded into its amplitude. The phase function serves as phase mask in the input domain, and the synthesized input signal is then encrypted into stationary white noise by utilizing random phase encoding in fractional Fourier domain. The two original images can be retrieved without cross-talk by using the correct keys with fractional orders, the random phase mask and the pixel scrambling operator. Numerical simulations and security analysis have been done to prove the validity and the security of the proposed encryption method.     

Image encryption algorithm based on the multi-order discrete fractional Mellin transform

A multi-order discrete fractional Mellin transform (MODFrMT) is constructed and directly used to encrypt the private images. The MODFrMT is a generalization of the fractional Mellin transform (FrMT) and is derived by transforming the image with multi-order discrete fractional Fourier transform (MODFrFT) in log-polar coordinates, where the MODFrFT is generalized from the closed-form expression of the discrete fractional Fourier transform (DFrFT) and can be calculated by fast Fourier transform (FFT) to reduce the computation burden. The fractional order vectors of the MODFrMT are sensitive enough to be the keys, and consequently key space of the encryption system is enlarged. The proposed image encryption algorithm has significant ability to resist some common attacks like known-plaintext attack, chosen-plaintext attack, etc. due to the nonlinear property of the MODFrMT. Additionally, Kaplan-Yorke map is employed in coordinate transformation process of the MODFrMT to further enhance the security of the encryption system. The computer simulation results show that the proposed encryption algorithm is feasible, secure and robust to noise attack and occlusion.     

Triple color images encryption algorithm based on scrambling and the reality-preserving fractional discrete cosine transform

An image encryption algorithm to secure three color images simultaneously by combining scrambling with the reality-preserving fractional discrete cosine transform (RPFrDCT) is proposed. The three color images to be encrypted are converted to their indexed formats by extracting their color maps, which can be considered as the three components of a color image. These three components are affected each other by scrambling the interims obtained from vertically and horizontally combining the three indexed formats with the help of the chaos-based cyclic shift. The three scrambled components are separately transformed with the RPFrDCT, in which the generating sequences are determined by the Chirikov standard chaotic map. Arnold transform is used to further enhance the security. Due to the inherent properties of the chaotic maps, the cipher keys are highly sensitive. Additionally, the cipher image is a single color image instead of three color ones, and is convenient for display, storage and transmission due to the reality property of RPFrDCT. Numerical simulations are performed to show the validity of the proposed algorithm.     

Double-image encryption based on discrete fractional random transform and chaotic maps

A novel double-image encryption algorithm is proposed, based on discrete fractional random transform and chaotic maps. The random matrices used in the discrete fractional random transform are generated by using a chaotic map. One of the two original images is scrambled by using another chaotic map, and then encoded into the phase of a complex matrix with the other original image as its amplitude. Then this complex matrix is encrypted by the discrete fractional random transform. By applying the correct keys which consist of initial values, control parameters, and truncated positions of the chaotic maps, and fractional orders, the two original images can be recovered without cross-talk. Numerical simulation has been performed to test the validity and the security of the proposed encryption algorithm. Encrypting two images together by this algorithm creates only one encrypted image, whereas other single-image encryption methods create two encrypted images. Furthermore, this algorithm requires neither the use of phase keys nor the use of matrix keys. In this sense, this algorithm can raise the efficiency when encrypting, storing or transmitting.     

Novel image encryption algorithm based on multiple-parameter discrete fractional random transform

A new method of digital image encryption is presented by utilizing a new multiple-parameter discrete fractional random transform. Image encryption and decryption are performed based on the index additivity and multiple parameters of the multiple-parameter fractional random transform. The plaintext and ciphertext are respectively in the spatial domain and in the fractional domain determined by the encryption keys. The proposed algorithm can resist statistic analyses effectively. The computer simulation results show that the proposed encryption algorithm is sensitive to the multiple keys, and that it has considerable robustness, noise immunity and security.     

Image encryption based on the multiple-order discrete fractional cosine transform

A novel scheme for image encryption based-on the multiple-order discrete fractional cosine transform (MODFrCT) is proposed. The DFrCT has a similar relationship with the discrete fractional Fourier transform (DFrFT). Not only has the DFrCT many useful properties similar to the conventional discrete cosine transform, but it also has another property, namely its fraction, or its transform order. The image to be encrypted is transformed with the multiple-order DFrCT using a random row cipher key vector and a random column key vector successively, and the corresponding cipher key vectors of decryption are also very sensitive. The transmission of the encrypted image with the algorithm of the multiple-order DFrCT is faster due to its reality. The digital simulation results proved the validity and safety of this algorithm.     

Efficient Entropic Security with Joint Compression and Encryption Approach Based on Compressed Sensing with Multiple Chaotic Systems

This paper puts forward a new algorithm that utilizes compressed sensing and two chaotic systems to complete image compression and encryption concurrently. First, the hash function was utilized to obtain the initial parameters of two chaotic maps, which were the 2D-SLIM and 2D-SCLMS maps, respectively. Second, a sparse coefficient matrix was transformed from the plain image through discrete wavelet transform. In addition, one of the chaotic sequences created by 2D-SCLMS system performed pixel transformation on the sparse coefficient matrix. The other chaotic sequences created by 2D-SLIM were utilized to generate a measurement matrix and perform compressed sensing operations. Subsequently, the matrix rotation was combined with row scrambling and column scrambling, respectively. Finally, the bit-cycle operation and the matrix double XOR were implemented to acquire the ciphertext image. Simulation experiment analysis showed that the compressed encryption scheme has advantages in compression performance, key space, and sensitivity, and is resistant to statistical attacks, violent attacks, and noise attacks.