| 基于分数傅立叶变换生成序列多样性的图像加密算法 |
| |
| 引用本文： | 张贞凯,于凤芹,杨慧中,李江. 基于分数傅立叶变换生成序列多样性的图像加密算法[J]. 东南大学学报(自然科学版), 2006, 0(Z1) |
| |
| 作者姓名： | 张贞凯 于凤芹 杨慧中 李江 |
| |
| 作者单位： | 江南大学系统工程研究所 江南大学系统工程研究所 无锡 |
| |
| 摘 要： | 为了增强分数傅立叶变换在图像信息加密领域的复杂性,提出了一种基于分数傅立叶变换生成序列多样性的图像加密算法.根据分数傅立叶变换的生成序列的多样性,构造不同的分数傅立叶变换的核函数,利用各级的生成序列、二维变换阶次以及相位编码时使用的随机矩阵作为算法中的密钥,对相位编码后的图像进行3次不同的分数傅立叶变换,达到对图像加密的目的.随着变换次数的逐渐增多,加密算法的安全性也逐渐提高.仿真实验结果表明,最后一级变换阶数的偏离在解密过程中造成解密图像的均方误差最大,是最重要的密钥;同时证明了算法具有较好的可行性、安全性.
|
| 关 键 词： | 图像加密 分数傅立叶变换 生成序列 相位编码 |
Algorithm for image encryption based on multiplicity of generating sequence of fractional Fourier transform |
| |
| Zhang Zhenkai Yu Fengqin Yang Huizhong Li Jiang. Algorithm for image encryption based on multiplicity of generating sequence of fractional Fourier transform[J]. Journal of Southeast University(Natural Science Edition), 2006, 0(Z1) |
| |
| Authors: | Zhang Zhenkai Yu Fengqin Yang Huizhong Li Jiang |
| |
| Abstract: | In order to improve the complexity of the algorithms for image encryption using fractional Fourier transform(FRFT),an algorithm based on the multiplicity of generating sequence of FRFT is proposed.With the help of the multiplicity of generating sequence,three kernel functions of FRFT are produced to build three different FRFT operators.And the three generating sequences,transform orders,random matrixes for phase encoding are used as encryption keys in the algorithm.The coded image is transformed three times by different FRFTs with different kernel functions in order to encrypt the image. As the transform times of FRFT increase,the complexity of the algorithm enhances.Experimental results show that the mean square error(MSE) caused by deviation of the last transform orders is the biggest and the algorithm is very reliable and complex. |
| |
| Keywords: | image encryption fractional Fourier transform(FRFT) generating sequence phase encoding |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
