基于量子Logistic映射的图像加密算法研究

目的提出将量子Logistic混沌映射与三维Arnold混沌映射相结合的图像加密算法,以提高图像加密的复杂度。方法首先利用量子Logistic混沌映射生成置乱用的伪随机序列与明文进行整体置乱,再利用三维Arnold混沌映射生成一个整数序列,与置乱后的密文进行扩散运算。结果通过仿真实验,加密图像的相关性系数接近于0,密钥敏感性的NPCR和UACI的测试值分别约等于99.60和33.4,信息熵的测试结果约等于7.999,都非常接近于理论值。结论加密算法充分体现了量子混沌映射高复杂度的非线性力学特性。通过仿真实验测试可知,加密算法具有密钥空间大、敏感性强、安全性好的特点。     

基于复合混沌模型的高级加密标准图像加密算法

为提高图像加密算法的安全性能,提出了一种基于复合混沌系统的改进的高级加密标准加密算法。该算法将Logistic混沌序列与Chebyshev混沌序列相结合,产生2种新的混沌映射。一种复合混沌矩阵作为高级加密标准的轮密匙,进行像素置乱;另一种复合混沌矩阵组成S盒,进行位置置乱。另外,对图像像素点进行位移及列混合操作,进一步达到位置置乱的目的,实现动态变换密钥的高级加密标准图像的加密。实验结果表明,该算法具有较高的密钥敏感性、良好的置乱效果及高效性。     

基于新型多环多翼超混沌系统的图像加密算法

目的 为提高图像加密算法的安全性,提出一种新型多环多翼超混沌系统的图像加密算法.方法 对超Lorenz混沌系统进行分形变换,得到多环多翼超混沌系统,设计一种基于该混沌系统的查表运算扩散算法.算法采用典型的置乱-扩散模式,借助Logistic混沌系统对明文图像进行无重复索引置乱,将新型多环多翼超混沌系统产生的密钥序列结合明文信息,对一次扩散图像的每个像素值进行正逆向扩散,得到最终的加密图像.结果 置乱图像的平均不动点比为0.003％,密文直方图分布均匀,相邻像素相关性几乎为零,信息熵达到了7.999,且NPCR,UACI和BACI的值分别为99.61％,33.46％和26.7％,与同类加密算法相比,该算法加密效果更优.结论 算法具有较强的密钥敏感性,能有效抵抗剪切、噪声等攻击,所提出的图像加密算法具有较高的安全性.     

基于混沌系统与多方向扩散的图像加密算法

目的为了避免只从单一方向来扩散图像像素,并提高加密密文的安全性,设计了混沌系统与多方向连续扩散的图像加密算法。方法综合Tent,sine映射,联合改进的Logistic映射,设计混合混沌机制,将Logistic模型的输出值作为触发器,获取一组随机性较强的混沌序列,对初始明文进行交叉置乱,高度混淆其像素位置,有效降低置乱周期性;构建量化机制对混沌序列进行处理,获取密钥流,从而设计多方向连续扩散机制,从4个不同的方向,利用不同的扩散模型来改变像素值,显著降低扩散周期性。结果实验结果显示,与当前混沌加密机制相比,所提算法具有更高的安全性与敏感性。结论所提加密算法能够确保图像在网络中安全传输,在包装信息防伪等领域具有较好的应用价值。     

基于改进的替换-扩散结构和变量控制参数的图像加密算法

提出一种基于改进的替换-扩散结构和变量控制参数的图像加密算法。首先使用传统的Arnold变换进行图像位置置乱,再利用Logistic映射产生混沌序列改变图像的灰度值,从而构造出一个位置置乱和像素值改变相结合的图像加密算法。最后使用Matlab进行实验仿真,结果表明该算法能够取得很好的加密效果,且具有算法简单,密钥空间大,密钥敏感性强等特点。基本满足图像加密的有效性和安全性要求。     

基于加权直方图位混淆与分阶混沌异扩散的快速图像加密算法

目的为了解决当前图像加密技术因在置乱和扩散过程忽略了明文像素特性,导致其抗明文攻击能力较弱,并且整个像素扩散均采用相同的加密机制来实现,存在安全性不理想问题,文中设计基于加权直方图位混淆和分阶混沌异扩散的快速图像加密算法。方法该算法充分利用整个明文的像素值,将其嵌入到整个置乱与扩散阶段,且在扩散过程中,利用不同的加密函数对不同的像素进行扩散。首先,联合Logistic与Tent映射,利用非线性组合思想构建新的低维混沌系统,并分析其混沌性能;考虑输入明文的像素值,建立像素加权直方图,借助外部密钥,生成复合混沌系统的初值,通过迭代输出随机序列;再将明文的每个像素在位水平上进行扩展,利用离散化的随机序列在位水平上实现明文混淆;随后,将分数阶理论嵌入Logistic映射中,构建分阶Logistic混沌映射,利用像素的加权直方图对其迭代,输出混沌数组;对混淆密文的像素进行分类,结合混沌数组,设计异扩散模型,对三类像素进行不同的加密。结果测试结果显示,与当前混沌加密算法相比,所提加密机制具有更强的抗明文攻击能力,其输出密文的像素分布更为均匀。结论所提加密技术兼顾了较高的安全性与效率,能够较好地保护图像在网络中安全传输。     

基于双向相关扩散与非线性混沌S盒的图像加密算法

目的 当前混沌加密方案主要采用存在迭代周期性的序列与单向扩散机制来实现像素的混淆,设计一种加密算法以解决其抗破译性能较弱的问题。方法 设计了基于双向相关扩散与非线性S盒的图像加密算法。借助哈希方案,形成一个与初始图像内容相关的密钥;基于2D混合混沌函数,利用子密钥来设计位置交叉规则,实现明文的像素置乱;基于线性分阶变换,联合混沌随机数组,构建一个16×16的非线性S盒;定义S盒的循环向前移位机制和向前扩散机制,对置乱图像完成正向加密;再更新混合混沌系统的初始条件,构建逆向扩散机制,对正向密文完成反向加密。结果 测试数据显示,与已有混沌加密方案相比,在安全性和效率方面,所提方案的优势更大,其时耗时仅为0.59 s,且稳定的NPCR和UACI值分别达到了99.74%,33.69%。结论 所提加密方案可以抵御网络中外来攻击,可充分保证图像内容的真实性。     

基于3D-CS混沌系统的双DNA编码图像加密算法

目的为解决加密算法中明文与混沌系统密钥关联小,且置乱扩散不能同步进行造成的安全性低的问题。在结合Chebyshev和Sine映射的基础上,新建三维Chebyshev-Sine混沌映射系统(3D-CS),提出一种基于3D-CS混沌系统的双DNA编码图像加密算法。方法设定二进制与四进制双重DNA编码,利用约瑟夫环变换对经过二进制DNA编码的图像RGB各层进行位置索引,同时完成置乱和扩散,然后将混沌系统产生的序列值经过处理后进行四进制DNA编码,最后将2种DNA序列进行加法运算后解码得到密文。结果仿真实验表明,索引序列和混沌序列通过了随机性检验,密文各层NPCR值分别为99.63%,99.61%,99.59%,UACI值分别为33.43%,33.44%,33.40%,信息熵分别为7.9992,7.9991,7.9993。结论所设计的混沌序列相较于其他混沌序列有一定优势,针对提出的问题有效提高了加密算法的安全性,密文能有效地抵御各种统计攻击与差分攻击。     

基于显著像素复合矩阵的多图像同步实时加密算法

目的 研究基于显著像素复合矩阵的多图像同步无损实时加密算法。方法 提出引入ZigZag机制,扰乱所有明文像素位置。定义显著像素择取机制, 将置乱后的密文像素分割为显著像素与次要像素, 形成多个显著像素矩阵。设计迭代复数模型, 将这些显著像素矩阵形成复合矩阵, 借助奇异值分解与Logistic映射, 得到矩阵密钥最后构造扩散函数, 利用矩阵密钥对显著像素复合矩阵执行扩散, 获取密文。结果 文中加密机制高度安全, 且无失真, 与当前多图像加密机制相比, 文中算法的加密效率更高,可满足实时性传输需求。结论 文中算法可同时对多幅图像进行实时安全加密传输。     

基于混合幅度-相位检索技术与二维耦合混沌映射的光学图像加密算法

目的为了解决当前光学图像加密算法主要将单色光束直接作用于明文,使其在解密过程中易出现丢失颜色信息等问题。方法文中设计基于混合幅度-相位检索技术与二维耦合混沌映射的光学图像加密算法。首先,提取彩色图像的R, G, B分量;随后,引入Logistic映射与Sine映射,通过对二者进行非线性耦合,形成二维复合混沌映射;利用彩色图像的像素信息来迭代复合映射,获取3个混沌序列,通过构建位置引擎混淆机制,对R,G,B分量进行置乱;基于Logistic映射,利用明文像素生成的初值条件对其进行迭代,输出一个混沌随机掩码;最后,基于幅度-相位截断方法和Gyrator变换,设计混合幅度-相位检索技术,利用单向二进制相位函数和随机掩码,对置乱后的R, G, B分量进行加密,获取相应的检测振幅,再将其进行组合,形成实值函数的加密密文。结果实验结果显示,与当前光学图像加密机制相比,所提算法具有更高的安全性与解密质量,具备较强的抗明文攻击能力。结论所提加密技术具有较高的抗攻击能力,能够安全保护图像在网络中传输,在信息防伪等领域具有较好的应用价值。     

Reversible Data Hiding in Encrypted Image Based on Block Classification Permutation

Recently, reversible data hiding in encrypted image (RDHEI) has attracted extensive attention, which can be used in secure cloud computing and privacy protection effectively. In this paper, a novel RDHEI scheme based on block classification and permutation is proposed. Content owner first divides original image into non-overlapping blocks and then set a threshold to classify these blocks into smooth and non-smooth blocks respectively. After block classification, content owner utilizes a specific encryption method, including stream cipher encryption and block permutation to protect image content securely. For the encrypted image, data hider embeds additional secret information in the most significant bits (MSB) of the encrypted pixels in smooth blocks and the final marked image can be obtained. At the receiver side, secret data will be extracted correctly with data-hiding key. When receiver only has encryption key, after stream cipher decryption, block scrambling decryption and MSB error prediction with threshold, decrypted image will be achieved. When data hiding key and encryption key are both obtained, receiver can find the smooth and non-smooth blocks correctly and MSB in smooth blocks will be predicted correctly, hence, receiver can recover marked image losslessly. Experimental results demonstrate that our scheme can achieve better rate-distortion performance than some of state-of-the-art schemes.     

A chaos-based image encryption algorithm based on multiresolution singular value decomposition and a symmetric attractor

ABSTRACT

This paper proposes a new image cryptosystem using multiple chaotic maps and multiresolution singular value decomposition (MR-SVD). The encryption process starts with implementing the MR-SVD to decompose the original image into the four fundamental sub-bands, i.e., Approximation (A), Vertical (V), Horizontal (H), Diagonal (D) sub-bands respectively. Since the approximation part gives the most information about the image, this sub-band is selected to perform permutation and diffusion. The permutation of all the four sub-bands is done by deploying the Baker map. The diffusion of pixels in the permuted approximation part is done by our neighbourhood diffusion scheme that uses the numerical solution of the chaotic Thomas' cyclically symmetric attractor. The final cipher is obtained by combining all the four (A, H, V, D) partial ciphers by performing inverse MR-SVD. The experimental results of our proposed scheme on various benchmarks tests indicate that the algorithm is highly secure and can withstand various attacks.     

A Secure and Lightweight Chaos Based Image Encryption Scheme

In this paper, we present an image encryption scheme based on the multi-stage chaos-based image encryption algorithm. The method works on the principle of confusion and diffusion. The proposed scheme containing both confusion and diffusion modules are highly secure and effective as compared to the existing schemes. Initially, an image (red, green, and blue components) is partitioned into blocks with an equal number of pixels. Each block is then processed with Tinkerbell Chaotic Map (TBCM) to get shuffled pixels and shuffled blocks. Composite Fractal Function (CFF) change the value of pixels of each color component (layer) to obtain a random sequence. Through the obtained random sequence, three layers of plain image are encrypted. Finally, with each encrypted layer, Brownian Particles (BP) are XORed that added an extra layer of security. The experimental tests including a number of statistical tests validated the security of the presented scheme. The results reported in the paper show that the proposed scheme has higher security and is lightweight as compared to state-of-the-art methods proposed in the literature.     

改进的引力模型耦合明文像素相关交叉机制的图像加密算法

目的解决当前图像加密技术严重依赖混沌系统,使其通用性较差,难以直接加密非方形图像,且因混沌系统的周期性,算法的安全性不足的问题。方法提出了改进的引力模型耦合明文像素相关交叉算子的图像加密算法。首先,利用多个一维混沌映射,定义联合混沌变换模型,输出密钥流;随后,基于明文像素位置,设计像素相关交叉机制,联合密钥流,对明文进行高效置乱;构造质量动态变化函数,用其替代传统引力模型中的恒定粒子质量,增强算法的敏感性,并用改进的引力模型对置乱图像完成扩散,彻底改变像素值;最后,构建密文增强模型,对输出密文进行二次扩散,扩大密文的NPCR(Number of pixel change rate)与UACI(Unified average changed intensity)值。结果实验结果表明:与当前图像加密机制相比,所提加密算法不但可以扩散方形图像,而且能够对非方形目标直接加密,具有更高的通用性与安全性,以及更强的抗差分攻击能力。结论所提出的算法能够加密非方形尺寸的图像,具有较强的通用性与安全性。     

Applying and Comparison of Chaotic-Based Permutation Algorithms for Audio Encryption

This research presents, and clarifies the application of two permutation algorithms, based on chaotic map systems, and applied to a file of speech signals. They are the Arnold cat map-based permutation algorithm, and the Baker’s chaotic map-based permutation algorithm. Both algorithms are implemented on the same speech signal sample. Then, both the premier and the encrypted file histograms are documented and plotted. The speech signal amplitude values with time signals of the original file are recorded and plotted against the encrypted and decrypted files. Furthermore, the original file is plotted against the encrypted file, using the spectrogram frequencies of speech signals with the signal duration. These permutation algorithms are used to shuffle the positions of the speech files signals’ values without any changes, to produce an encrypted speech file. A comparative analysis is introduced by using some of sundry statistical and experimental analyses for the procedures of encryption and decryption, e.g., the time of both procedures, the encrypted audio signals histogram, the correlation coefficient between specimens in the premier and encrypted signals, a test of the Spectral Distortion (SD), and the Log-Likelihood Ratio (LLR) measures. The outcomes of the different experimental and comparative studies demonstrate that the two permutation algorithms (Baker and Arnold) are sufficient for providing an efficient and reliable voice signal encryption solution. However, the Arnold’s algorithm gives better results in most cases as compared to the results of Baker’s algorithm.