【信息技术】【2013.04】基于离散小波变换和分数傅立叶变换的高效图像加密与解密...

本文为印度拉贾斯坦邦理工大学（作者：Prerana Sharma）的硕士论文，共71页。

 

分数傅立叶变换和混沌函数在许多加密解密算法中起着关键作用。在这项工作中，对图像加密解密算法的性能进行了量化，并用计算时间（即加密解密过程的时间消耗和输入图像与恢复图像的相似性）进行了比较，比较量化参数为MSE。本文利用二维离散小波变换（DWT2）的图像压缩特性，改进了图像加密解密算法的计算时间。首先，对算法的计算复杂度进行了评估，并与现有算法进行了比较。该分析表明，所提出的算法比现有算法快近8倍。此外，还使用MATLAB 7.7进行了仿真，以量化现有算法的性能，并使用MSE和计算时间对所提出的算法进行了仿真。仿真结果表明，对于所提出的算法，恢复图像和原始图像之间的均方误差小于现有算法，从而保持了现有算法的鲁棒性。这些算法对加密解密过程中使用的分数阶在1x10^-1的变化范围很敏感。

 

Fractional Fourier transform and chaos functions play a key role in many of encryption-decryption algorithms. In this work performance of image encryption-decryption algorithms is quantified and compared using the computation time i.e. the time consumption of encryption-decryption process and resemblance of input image to the restored image, quantified by MSE. This work proposes an improvement in computation-time of image encryptiondecryption algorithms by utilizing image compression properties of the 2-dimensional Discrete Wavelet Transform (DWT2). Initially, computation complexity of the algorithms is evaluated and compared with that of existing algorithms. This analysis claims the proposed algorithms to be nearly 8 times faster than the existing algorithms. Further, simulations are performed using MATLAB7.7 to quantify performance of existing algorithms and the proposed algorithms using MSE and computation time. The results obtained in these simulations prove that for the proposed algorithms MSE between restored and original images is lesser than that of existing algorithms thereby maintaining the robustness of the existing algorithms. These algorithms are found sensitive to a variation of 1x10-1 in the fractional orders used in encryption-decryption process.

 

1 引言

2 文献回顾

3 现有方法的分析研究

4 本文提出的算法

5 仿真结果

6 结论 

推荐公众号：电力电子技术与新能源

推荐公众号：MATLAB基于模型的设计

下载英文原文请点击“阅读原文”