首页 | 本学科首页   官方微博 | 高级检索  
     

基于混沌的双组合图像置乱算法研究
引用本文:崔 静,杨 帆,唐红梅.基于混沌的双组合图像置乱算法研究[J].电视技术,2011,35(21):36-39.
作者姓名:崔 静  杨 帆  唐红梅
作者单位:河北工业大学信息工程学院
基金项目:河北省科技支撑计划项目
摘    要:为了解决图像置乱算法在加密强度和算法泛化性方面存在局限性的问题,提出了双组合置乱算法,该算法充分利用了混沌映射无序、随机、对初值敏感的特性,将Logistic混沌映射巧妙地应用于序列交叉原则上。解决了直接序列交叉算法只适用于偶数元素图像的局限性,并且将单个密钥的敏感精度提高到10-9数量级。此外,实验结果表明应用该方法置乱后的图像,其像素相关性比直接应用序列交叉原则置乱后的图像像素相关性更小。

关 键 词:双组合置乱算法  混沌映射  像素相关性

Study on Image Scrambling Algorithm of Double Combination Based on Chaos
CUI Jing,YANG Fan,TANG Hongmei.Study on Image Scrambling Algorithm of Double Combination Based on Chaos[J].Tv Engineering,2011,35(21):36-39.
Authors:CUI Jing  YANG Fan  TANG Hongmei
Affiliation:(School of Information Engineering,Hebei University of Technology,Tianjin 300401,China)
Abstract:To solve the problem that the image scrambling algorithm have limitations in terms of encryption strength and generalization,a scrambling algorithm of double combination has been proposed.The algorithm takes advantage of chaotic maps which have the characteristics of disorder,random,and sensitivity to the initial variables.The logistic chaotic map has been applies on sequence cross principle cleverly.The algorithm solve the limitation that direct-sequence cross algorithm is only applicable to the image with even elements,and improve the accuracy of a single key to magnitude of 10-9.Moreover,the experimental results show that the pixel correlation of the image which have been scrambled by the double combination algorithm is smaller than the image that scrambled by sequence cross algorithm.
Keywords:scrambling algorithm of double combination  chaotic maps  pixel correlation
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电视技术》浏览原始摘要信息
点击此处可从《电视技术》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号