基于Arnold变换的高效率分块图像置乱算法的研究  

Study on Type of High-efficiency and Block Image Scrambling Algorithm Based on Arnold Transform

作　　者：王圆妹[1] 李涛[1] 

机构地区：[1]长江大学电子信息学院,湖北荆州434023

出　　处：《电视技术》2012年第3期17-19,共3页Video Engineering

基　　金：国家自然科学基金项目(60973012)

摘　　要：传统的基于Arnold变换的数字图像置乱方法存在置乱过程缺乏随机性、保密性不高、置乱周期过大降低了算法的效率等问题。针对上述问题,提出了一种高效率的分块图像置乱算法。该算法基于分块的思想,先对图像进行分块处理,而后对图像块进行Arnold变换,从而实现了对图像置乱加密的目的。实验结果表明,该算法可以缩短图像置乱的周期,操作简单,执行效率高,安全性强。The traditional digital image scrambling method based on Arnold transform lacks of randomness in the scrambling process, and the corffidentiality is not high; the speed of running is low for the big cycle of Arnold transform. In order to solve these problems, a high-efficiency digital image scrambling method is proposed. The method is based on idea of block. First image is composed into blocks, then to scramble each block so as to achieve image encryption. Experimental results show that this image scrambling algorithm can shorten the cycle of Arnold transform and the algorithm is simple, high efficiency and good safety.

关 键 词：图像加密 置乱 分块 ARNOLD变换 

分 类 号：TN911.73[电子电信—通信与信息系统]