共查询到20条相似文献,搜索用时 453 毫秒
1.
2.
为了实现对两幅图像进行同步加密,降低传输负载并提高密文的抗明文攻击能力,提出了离散分数阶随机变换与加权像素混沌置乱的双图像加密算法。将2个分阶参数引入到Tent映射中,设计了新的Tent映射;根据明文像素值,构建加权像素直方图模型,联合位外部密钥,生成改进的Tent映射的初值;再利用初值对分数阶Tent映射进行迭代,输出2组随机序列,对2幅明文进行位置交叉混淆,获取2个置乱密文;基于DWT(discrete wavelet transform)技术,对2个置乱密文进行稀疏表示;根据混沌序列,定义随机循环矩阵,联合稀疏表示,获取2个置乱密文对应的测量矩阵。根据随机掩码与调制相位掩码,建立数据融合模型,将2个测量矩阵组合为复合矩阵;基于离散分数阶随机变换,对复合图像进行扩散,获取密文。测试数据显示:与已有的多图像加密方案相比,该算法的抗明文攻击能力与用户响应值更理想,密文的NPCR、UACI值分别达到了99.83%、34.57%。该算法具有较高的加密安全性,能够有效抵御网络中的外来攻击,确保图像安全传输。 相似文献
3.
《光学学报》2020,(5)
针对光学多图像认证方法中,多路复用图像中的串扰噪声,以及不同认证级别下的信息安全问题,提出了一种基于超混沌振幅型掩模和Gyrator变换域下相位信息复用的光学多图像认证方法。利用分数阶超混沌Rabinovich系统构造超混沌随机振幅掩模;基于改进的Gerchberg-Saxton算法对原始图像进行低级或高级编码,利用超混沌掩模作为振幅约束,迭代获得目标图像,并将得到的N个目标图像编码成复合图像;再次通过Gerchberg-Saxton迭代将复合图像转化为两个便于传输的纯相位掩模。实验结果表明:在认证过程中,不同安全级别的用户拥有各自的认证密钥,低级认证过程中可以通过检索图像与原始图像的非线性相关峰值,判断认证图像的正确性,而高级认证过程中则可以获得与原始图像相似度较高的认证图像,峰值信噪比和相关系数分别可达25.2817 dB和0.9844。所提方法对遮挡攻击和噪声攻击具有良好的稳健性,为多幅图像在不同级别下的光学认证提供了新的思路。 相似文献
4.
5.
6.
7.
提出了一种基于迭代振幅-相位恢复算法和非线性双随机相位编码的图像加密方法。该方法利用两个公开密钥和一幅"假图像"在非线性双随机相位加密系统中生成密文,接着利用迭代非线性双随机相位编码生成两个私有密钥。待加密图像和密文作为迭代加密方法中的两个限定值。解密过程则可以在经典的基于4f系统的线性的光学双随机相位编码系统中完成。该加密方法具有迭代收敛速度快、安全性高的优点。迭代该图像加密方法能够抵御最近提出的基于改进的振幅-相位恢复算法的攻击。理论分析和仿真实验都证明了此方法的有效性和可靠性。 相似文献
8.
9.
用共参数的两种混沌系统生成可置换传统双随机相位编码系统中随机相位模板的新模板.将明文图像编码为相位信息,克服原双随机相位编码系统对第一块相位模板不敏感的缺陷;构建可产生均匀非相关随机序列的广义Fibonacci混沌系统,生成均匀分布的相位模板进行图像加密,提高密钥传输效率及系统对密钥的敏感性;对一次加密得到的复值图像,采用提取其振幅及相位的替代操作进行再加密,解决其像素值不能通过按位"异或"进行替代的问题,使密文图像分布更均匀,信息熵达到7.995 8,能有效抵御统计分析攻击.在二次加密中,将产生加密模板的混沌初值与一次加密得到的密文联系,像素数改变率达到0.995 239,更接近理想期望值,增强了系统对明文的敏感性,有效抵御选择明文攻击.仿真实验表明,该方法有效增加了密钥空间和密钥敏感性,提高了加密系统加密效率和安全性. 相似文献
10.
在关联成像方案中,通过强度关联可在参考臂上获得目标物体振幅信息,却不能恢复出目体物体的相位信息,而相位常常包含了目标物体的一些特殊信息.本文提出了一种新的关联成像方案,能够恢复出复值透射物体的振幅和相位信息.该方案通过分束器及π/2变相板在接收端分离出复值物体的实部和虚部信息,再利用二阶关联成像过程分别获得目标物体的实部和虚部信息,从而恢复出复值物体;在此基础上,利用压缩感知重建算法,获得了基于相位调制的复值物体的压缩关联成像方案.研究结果表明该方案可适用于一般化的复值物体恢复,也可克服测量次数多、重构时间长等目标物体重建问题.对于一般具有高斯分布的复值物体可用约奈奎斯特采样率的36%的测量次数获得振幅和相位恢复均方误差值约为10-2的高质量重建复值物体. 相似文献
11.
A multiple-image encryption method is proposed that is based on row scanning compressive ghost imaging, (t, n) threshold secret sharing, and phase retrieval in the Fresnel domain. In the encryption process, after wavelet transform and Arnold transform of the target image, the ciphertext matrix can be first detected using a bucket detector. Based on a (t, n) threshold secret sharing algorithm, the measurement key used in the row scanning compressive ghost imaging can be decomposed and shared into two pairs of sub-keys, which are then reconstructed using two phase-only mask (POM) keys with fixed pixel values, placed in the input plane and transform plane 2 of the phase retrieval scheme, respectively; and the other POM key in the transform plane 1 can be generated and updated by the iterative encoding of each plaintext image. In each iteration, the target image acts as the input amplitude constraint in the input plane. During decryption, each plaintext image possessing all the correct keys can be successfully decrypted by measurement key regeneration, compression algorithm reconstruction, inverse wavelet transformation, and Fresnel transformation. Theoretical analysis and numerical simulations both verify the feasibility of the proposed method. 相似文献
12.
In a cancelable iris recognition technique, all enrollment patterns are masked using a transformation function, and the invertibility process for obtaining the original data should not be possible. A novel cancelable iris authentication approach in the encrypted domain is presented in this paper. The double random phase encoding (DRPE) algorithm in the Fractional Fourier Transform (FrFT) Domain is utilized to generate the optical masked IrisCodes. For the transmitter side, two encryption keys (RPM1 and RPM2) are utilized, while the second phase mask is proposed to be the right iris feature vector of the same user. As a result, mixing the feature vectors of the left and right iris patterns of the same subject to an encrypted IrisCode results in enhancing the privacy and preserving the system performance. This proposed system success is attributed to the fact that the iris authentication issue is transformed to a key authentication process. Experimental results conducted on CASIA-IrisV3-Interval dataset achieve a significant gain for both privacy and performance proving the superiority of the proposed approach. 相似文献
13.
针对相位截断加密算法无法抵御信息泄露问题,文章提出了一种基于相位截断菲涅耳变换与随机振幅掩模的加密算法,以抵御信息泄露问题;算法首先将原彩色图像分为3个独立的颜色通道,在对其进行菲涅耳变换后加入随机振幅掩模通道,将4个通道分别进行菲涅耳衍射截断处理;算法通过级联处理不仅提高了秘钥与密文间的关联性,还消除了信息泄露的风险;通过仿真试验与结果分析可知,本算法不仅在波长与自由空间传播错误距离参数、密文噪声、遮挡污染、密文泄露以及不同攻击等情况下有较好的鲁棒性,还解决了信息泄露问题。 相似文献
14.
为了阐明相位编码光学加密算法的扩散及混淆特性,基于傅里叶变换位移定理,从分组密码设计准则出发,以双随机相位光学加密算法为研究对象,分析了采用单个随机相位模板的2 f系统的扩散和混淆特性。将单随机相位加密过程分解为2个相互关联的过程,结果表明,傅里叶变换在加密算法中引入了混淆操作,而傅里叶变换结合随机相位模板实现了扩散操作。通过数值模拟对上述理论分析进行了验证,引入信息熵来评价加密图像的统计分布特性,进一步分析了菲涅尔域及分数阶傅里叶变换域随机相位加密算法的扩散混淆特性。研究表明,单随机相位加密和双随机相位加密图像的信息熵分布为7.038和7.157,而随机振幅加密图像信息熵为4.521。因而,随机相位加密算法比随机振幅加密算法能实现对信息更好地扩散。 相似文献
15.
本文结合矢量分解和gyrator变换的数学实现得到了一种新的非对称图像加密算法,它将待加密图像先通过矢量分解加密到两块纯相位板中,然后利用从gyrator变换的数学实现中推导出来的加密算法加密其中一块相位板,获得最终的实值密文.另一块相位板作为解密密钥.算法的解密密钥不同于加密密钥,实现了非对称加密,加密过程中产生的两个私钥增大了算法的安全性.数值模拟结果验证了该算法的可行性和有效性. 相似文献
16.
An image encryption algorithm based on chaotic system and deoxyribonucleic acid (DNA) sequence operations is proposed in this paper. First, the plain image is encoded into a DNA matrix, and then a new wave-based permutation scheme is performed on it. The chaotic sequences produced by 2D Logistic chaotic map are employed for row circular permutation (RCP) and column circular permutation (CCP). Initial values and parameters of the chaotic system are calculated by the SHA 256 hash of the plain image and the given values. Then, a row-by-row image diffusion method at DNA level is applied. A key matrix generated from the chaotic map is used to fuse the confused DNA matrix; also the initial values and system parameters of the chaotic system are renewed by the hamming distance of the plain image. Finally, after decoding the diffused DNA matrix, we obtain the cipher image. The DNA encoding/decoding rules of the plain image and the key matrix are determined by the plain image. Experimental results and security analyses both confirm that the proposed algorithm has not only an excellent encryption result but also resists various typical attacks. 相似文献
17.
基于多重菲涅耳衍射变换和相位密码板,设计了一种新的图像加密计算方法.待加密的明文图像在多重离散菲涅耳衍射变换和相位密码板的共同作用下,变换为一个具有随机码特征的密文矩阵;衍射距离和相位密码板是主要的密钥.只有当所有密钥都正确时,才能成功地解密密文.结果表明,该加密算法能抵抗JPEG有损压缩、图像剪切、重度噪音污染和重采样等攻击,因此该法具有较强的鲁棒性;由于很难破解多重密钥,所以该算法具有极高的安全性. 相似文献
18.
二维阵列狭缝模板是阿达玛编码模板的一种新的设计思想,分析了模板上同列狭缝的加工误差对仪器波长准确度的不利影响,在此基础上,给出了减少同列狭缝高度、垂直光谱维方向上位置不一致性误差对仪器波长准确度影响的方法,以及同列狭缝在光谱维方向上位置不一致导致解码所得谱线产生的光谱偏移量的粗略估计方法,并建立模型进行仿真,计算了当模板上某列狭缝存在宽度、光谱维方向上位置不一致性误差时,解码所得其他各列狭缝谱线分布上测量误差的大小,根据仿真结果可以初步确定模板的加工精度。通过该研究有助于合理设计MEMS(微机电系统)二维阵列狭缝模板,获得对系统误差的有效补偿,提高仪器的波长准确度。 相似文献
19.
Jianhua Wu 《Optics Communications》2010,283(9):1720-3242
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. 相似文献
20.
Nader M. A. Mohamed 《Journal of statistical physics》2011,145(6):1653-1660
A fast, easily implemented and high efficiency algorithm is derived for sampling from the Maxwell distribution. The algorithm
is derived from the rejection-acceptance sampling method using the simple exponential decay function as an envelope function
for the Maxwell distribution. The derived algorithm requires less number of random numbers per iteration, consumes less number
of random numbers per sample and requires less expensive computation functions than the direct and Johnk’s algorithms. The
speed of the proposed algorithm is about 1.6 times that of the direct algorithm and is about 1.5 times that of Johnk’s algorithm.
Since the proposed algorithm for sampling from Maxwell distribution verified high efficiency and speed, Watt random variables
can be generated by transforming Maxwell random variables generated by the proposed algorithm. The speed of generating Watt
random variables using the proposed algorithm is about 1.1 times that generated from Kalos’s algorithm. 相似文献