一种基于RSA的数字图象加密技术及其快速实现

RSA公钥密码体制的安全性依赖于大整数因数分解的困难性,目前安全素数产生难度大,运算时间长。文章根据素数的特殊表示法研究了一种高速的安全素数算法,针对当今的信息安全问题和数字图像的特点,提出了一种基于图像信息摘要和RSA的图像加密技术,利用图像信息摘要构造图像像素置乱矩阵并对图像像素矩阵进行置乱后再运用RSA公钥加密算法对置乱后的图像快速加密。     

一种基于Arnold变换和RSA的图像加密算法

提出一种Arnold变换和RSA相结合的图像加密算法。利用Arnold变换对图像的像素位置进行链式迭代置乱。在对置乱后的图像像素值进行替代和扩散的过程中,采用基于大素数分解的RSA算法,构造一个位置置乱和灰度变换相结合的加密算法。实验仿真结果表明该算法支持变长密钥,具有敏感性强、去相关能力强及抵御统计和已知明文攻击等优点,能够取得很好的加密效果。     

基于量子密钥分发和像素置乱的图像加密方法研究

鉴于当前经典图像加密算法的局限性及量子密钥分发协议无条件安全的特性,提出一种基于量子密钥分发和像素置乱的图像加密方法。首先通信双方产生量子密钥序列,然后将密钥序列转换成与要加密的图像对应的像素矩阵,将该像素矩阵与对应的图像的像素矩阵元素按位进行异或运算,再利用下一量子密钥序列生成像素置乱矩阵,对图像像素进行置乱变换,最终完成加密。解密方用与发送方相反的方法进行像素位置复原,再利用密钥矩阵进行异或运算即可解密。该算法所有密钥均采用量子密钥分发协议产生,安全性高,实现简单,经实验仿真证明,加密后的图像直方图呈均匀分布,像素相关性非常弱,像素变化率和信息熵高。     

改进约瑟夫遍历和分段Logistic映射的图像加密算法

为了满足网络通信和图像传输的安全,提出了一种改进约瑟夫遍历和分段Logistic映射的图像加密算法,在置乱过程中通过改进约瑟夫遍历对待加密图像进行全局像素置乱,将置乱像素按照矩阵排列,分解成两个四位的高低矩阵,低四位矩阵利用分段的Logistic混沌映射进行加密处理,对高四位矩阵通过异或运算改变原来矩阵,再将两个四位矩阵结合起来得到加密图像。改进的约瑟夫遍历可以有效抵御周期性攻击,分段Logistic映射引入图像的元素值增强了秘钥的独特性,实验结果证明,该加密算法秘钥空间大,安全性能好,可以抵御穷举,直方图统计等各种攻击。     

一种基于混沌映射的快速图像加密算法优化

为了解决现有图像加密算法存在随图像尺寸变大导致加密时间迅速增加的问题,采用基于logistic和Arnold映射的改进加密算法实现了快速图像加密算法的优化。该算法基于两种混沌映射对原文图像进行像素置乱和灰度值替代,像素置乱是按图像大小选择以H个相邻像素为单位进行,通过适当调整H的取值实现加密时间优化;灰度值替代是利用Arnold映射产生混沌序列对置乱图像进行操作而得到密文图像。结果表明,对于256×256的Lena标准图像,加密时间降低到0.0817s。该算法具有密钥空间大和加密速度快等优点,能有效抵抗穷举、统计和差分等方式的攻击。     

基于生成对抗网络的遥感图像加密研究

遥感图像中包含了大量的信息，为防止这些信息被窃取，有必要对其进行加密处理。在该背景下，研究一种基于生成对抗网络的遥感图像加密方法。该研究通过图像分割来切断图像信息之间的关联性，利用改进Arnold变换算法来实现遥感图像置乱，打乱图像像素点的排列顺序。通过生成对抗网络在真遥感图像像素中加入假图像像素，掩盖图像真实信息，实现遥感图像加密。结果表明：基于GAN的加密方法的峰值信噪比均值为5.92 dB,信息熵损失均值为20.7 bit,加密耗时均值为27.3 ms,均低于对比方法，由此说明所研究方法加密后，既达到了加密目标，保证了遥感图像完整性，同时提高了加密效率。     

基于混沌伪随机匹配移位的图像加密算法

基于二维Logistic混沌系统,提出一种伪随机匹配移位的图像加密算法。先对原始图像和混沌系统产生的模板图像像素在水平和垂直方向进行随机匹配移位,匹配方式和移位步长由混沌序列控制。接着对像素置乱后的原始图像和模板图像进行按位异或运算,得到加密后的密文。混沌随机匹配移位不仅保证了原始图像的充分置乱,同时也提高了异或加密的安全性。数值实验结果显示该加密方法能够抵御常见的暴力破解攻击、统计分析攻击和差分攻击,具有较高的安全性。     

基于位交换的图像置乱

研究了基于位交换的图像置乱，提出一种无需迭代计算的置乱方法。将各像素的位分为奇偶2组，在2个位组内分别实行高低位交换；为了降低交换后像素值不变的概率，取另一不相关像素的奇数位组替换当前像素的奇数位组。实验结果表明，该方法可有效实现图像置乱，速度优于arnold变换法，具有较好的鲁棒性。     

基于单图像局部置乱和动态反馈扩散的混沌图像加密算法

提出一种基于单图像局部置乱和动态反馈的混沌图像加密算法。首先,提出一种单图像局部置乱算法。其次,在扩散阶段,采用一种基于动态反馈的扩散策略来改变置乱后图像中的像素值,通过动态反馈来改善图像的加密效果。最后,实验结果表明,与3种经典的算法相比,提出的算法大大缩短了加密时间;并且只通过一次加密,其像素变化率和归一化平均变化强度值都可接近99.6%和33.4%,进一步证明了提出的算法具有良好的抵抗差分攻击的能力。     

基于骑士巡游的灰度图像加密压缩算法

为了进一步提高涉密图像的存储和传输效率,提出了基于骑士巡游的灰度图像加密压缩算法。该算法将原始图像进行8×8分块,对每个块进行DCT变换,构建以块为单位的系数块化矩阵,然后采用骑士巡游置乱对该系数块化矩阵加密,对置乱加密后图像进行JPEG压缩得到加密压缩图像。实验仿真和分析表明,该算法密钥空间大、密钥敏感性高,在保证一定置乱度的前提下,获得了更高的压缩效率。     

基于数字图像分割的认证加密方案

本文利用加密技术中广泛应用的RSA公钥加密算法，提出了一种基于数字图像分割的认证加密方案。     

面向云环境的彩色图像混合加密算法

针对传统图像加密算法难以保证在云环境下密钥配送的安全性,以及DNA编码在抗统计学分析效果欠佳等问题提出了一种面向云环境的彩色图像混合加密算法。提出了一种自适应DNA编码对传统方法进行改善,通过国产SM2与SM3加密算法作为散列值的生成函数与控制参数的非对称加密,运用盲水印技术镶嵌至密文图像中。实验结果表明,该算法密钥空间大且加密图像相邻像素相关性较低,具有更为接近理想值的像素改变率与像素平均改变强度,具有较为理想的安全性同时在密钥的传输过程中由非对称加密算法保证其安全可靠。     

Bit level image encryption algorithm based on hyperchaotic system

Because chaotic systems are unpredictable, ergodic and sensitive to initial values and parameters, they are often used in the field of encryption. To avoid the bad randomness of the random key generated by the low dimensional chaotic map system, a 5-dimensional multi-wing hyperchaotic system is adopted in this paper. The key stream generated by the chaotic system is related to the plaintext image. So it can effectively resist the attacks of selecting plaintext. The plaintext graph is decomposed into binary form by bit plane decomposition technique, and then these bit planes are divided into high and low groups. The designed control matrix is used to identify the specific scrambling mode, and each bit is permuted within and between groups. Finally, bit diffusion is used to change the pixel value of each pixel. Theoretical analysis and numerical simulation show that the algorithm has good encryption performance for image encryption.     

Novel SCAN-CA-based image security system using SCAN and 2-D von Neumann cellular automata

This paper presents a novel SCAN-CA-based image security system which belongs to synchronous stream cipher. Its encryption method is based on permutation of the image pixels and replacement of the pixel values. Permutation is done by scan patterns generated by the SCAN approach. The pixel values are replaced using the recursive cellular automata (CA) substitution. The proposed image encryption method satisfies the properties of confusion and diffusion as the characteristics of SCAN and CA substitution are flexible. The salient features of the proposed image encryption method are lossless, symmetric private key encryption, very large number of secret keys, key-dependent permutation, and key-dependent pixel value replacement. Simulation results obtained using some color and gray-level images clearly demonstrate the strong performance of the proposed SCAN-CA-based image security system.     

Chaotic image encryption based on circular substitution box and key stream buffer

A new image encryption algorithm based on spatiotemporal chaotic system is proposed, in which the circular S-box and the key stream buffer are introduced to increase the security. This algorithm is comprised of a substitution process and a diffusion process. In the substitution process, the S-box is considered as a circular sequence with a head pointer, and each image pixel is replaced with an element of S-box according to both the pixel value and the head pointer, while the head pointer varies with the previous substituted pixel. In the diffusion process, the key stream buffer is used to cache the random numbers generated by the chaotic system, and each image pixel is then enciphered by incorporating the previous cipher pixel and a random number dependently chosen from the key stream buffer. A series of experiments and security analysis results demonstrate that this new encryption algorithm is highly secure and more efficient for most of the real image encryption practices.     

Elliptic curve ElGamal based homomorphic image encryption scheme for sharing secret images

This paper proposes an encryption scheme with a new additive homomorphism based on Elliptic Curve ElGamal (EC-ElGamal) for sharing secret images over unsecured channel. The proposed scheme enables shorter key and better performance than schemes based on RSA or ElGamal. It has a lower computation overhead in image decryption comparing with the method that uses other additively homomorphic property in EC-ElGamal. Elliptic curve parameters are selected to resist the Pohlig-Hellman, Pollard's-rho, and Isomorphism attacks. Experimental results and analysis show that the proposed method has superior performance to RSA and ElGamal.     

Improved algorithm for image encryption based on DNA encoding and multi-chaotic maps

New image encryption based on DNA encoding combined with chaotic system is proposed. The algorithm uses chaotic system to disturb the pixel locations and pixel values and then DNA encodings according to quaternary code rules are carried out. The pseudo DNA operations are controlled by the quaternary chaotic sequences. At last the image encryption through DNA decoding is achieved. The theoretical analysis and experimental results show that the algorithm improves the encoding efficiency, enhances the security of the ciphertext, has a large key space and a high key sensitivity, it is able to resist the statistical and exhaustive attacks.     

Securing color image transmission using compression-encryption model with dynamic key generator and efficient symmetric key distribution

There are a few issues related to the existing symmetric encryption models for color image data, such as the key generation and distribution problems. In this paper, we propose a compression-encryption model to solve these problems. This model consists of three processes. The first process is the dynamic symmetric key generation. The second one is the compression process, which is followed by encryption using keystreams and S-Boxes that are generated using a chaotic logistic map. The last process is the symmetric key distribution. The symmetric key is encrypted twice using Rivest-Shamir-Adleman (RSA) to provide both authentication and confidentiality. Then, it is inserted into the cipher image using the End of File (EoF) method. The evaluation shows that the symmetric key generator model can produce a random and dynamic symmetric key. Hence, the image data is safe from ciphertext-only attacks. This model is fast and able to withstand entropy attacks, statistical attacks, differential attacks, and brute-force attacks.     

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.