基于显著像素复合矩阵的多图像同步实时加密算法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Multi-image Synchronous Real Time Encryption Algorithm Based on Significant Pixels Composite Matrix
  • 作者:邱斌 ; 张亶 ; 汪志达
  • 英文作者:QIU Bin;ZHANG Dan;WANG Zhida;School of Software Technology,Zhejiang University;Department of Electronic Information Engineering,Ningbo Polytechnic;
  • 关键词:多图像加密 ; 显著像素 ; 迭代复数模型 ; 奇异值分解 ; 矩阵密钥
  • 英文关键词:multi-image encryption;;significant pixel;;iteration plural model;;singular value decomposition;;matrix key
  • 中文刊名:JSJC
  • 英文刊名:Computer Engineering
  • 机构:浙江大学软件学院;宁波职业技术学院电子信息工程系;
  • 出版日期:2015-08-15
  • 出版单位:计算机工程
  • 年:2015
  • 期:v.41;No.454
  • 基金:浙江省教育厅2013年度科研课题基金资助项目(Y201328093)
  • 语种:中文;
  • 页:JSJC201508024
  • 页数:7
  • CN:08
  • ISSN:31-1289/TP
  • 分类号:126-132
摘要
当前图像加密算法对多图像同步实时加密效率低、复杂度高,且无法满足实时传输要求。为此,提出一种基于显著像素复合矩阵的多图像同步无损实时加密算法。引入Zig Zag机制扰乱所有明文像素位置,定义显著像素择取机制,将置乱后的密文像素分割为显著像素与次要像素,形成多个显著像素矩阵。设计迭代复数模型,将显著像素矩阵形成复合矩阵,借助奇异值分解与Logistic映射得到矩阵密钥。构造扩散函数,利用矩阵密钥对显著像素复合矩阵执行扩散获取密文。实验结果表明,该算法安全性高、无失真,与目前多图像加密机制相比,加密效率更高,可同时对多幅图像进行实时安全加密传输,满足实时性传输需求。
        In view of the current algorithm for multi-image synchronous real-time encryption has low efficiency,high complexity and cannot meet the requirements of real-time transmission problem. The selectively multi-image lossless real time encryption algorithm based on significant pixels composite matrix is proposed. All the pixels of plaintexts are permutated by introducing the Zigzag mechanism; the image pixels are divided into important pixels and unimportant pixels by defining the pixels of interest selection mechanism for getting several important pixels matrix; and the composite matrix is obtained by designing the iteration plural model. Using the singular value decomposition gets the key matrix.The cipher is formed by constructing the diffusion function to diffuse the significant pixel composite matrix. This algorithm only encrypts the image significant pixels,avoiding the diffusion of non-significant pixel,resulting in low complexity. Simulation results show that this algorithm has high security,and belongs to lossless encryption; comparison w ith other multi-image encryption mechanism,the encryption / decryption efficiency of this algorithm is higher to meet the requirement of real time transmission.
引文
[1]焦亚冰.基于RFID的产品信息追溯防伪策略[J].包装工程,2012,33(1):119-121.
    [2]谢勇,冯起芹,单武扬.数字全息水印在印刷半色调图像中的应用[J].包装工程,2013,34(1):101-105.
    [3]Dong Chang’e.Color Image Encryption Using One-time Keys and Coupled Chaotic Systems[J].Signal Processing:Image Communication,2014,29(5):628-640.
    [4]Zhou Yicong,Cao Weijia,Chen P.Image Encryption Using Binary Bitplane[J].Signal Processing,2014,100(25):197-207.
    [5]Zhang L Y,Hu Xiaobo.A Chaotic Image Encryption Scheme Owning Temp-value Feedback[J].Communications in Nonlinear Science and Numerical Simulation,2014,19(10):3653-3659.
    [6]Boriga R,Daˇscaˇlescu A C,Priescu I.A New Hyperchaotic Map and Its Application in an Image Encryption Scheme[J].Signal Processing:Image Communication,2014,24(5):578-583.
    [7]张文全,薛侠,周南润.基于相位恢复和混沌图的多图像并行加密算法[J].计算机工程与应用,2012,48(23):63-66.
    [8]罗贤哲.基于分数阶傅里叶变换和分数余弦变换的多图像及彩色图像加密算法[D].南昌:南昌大学,2012.
    [9]郭雨,柏森,阳溢.基于复用技术和数论的图像加密压缩同步算法[J].电视技术,2013,37(5):33-37.
    [10]Xiang Tao,Qu Jinyu,Xiao Di.Joint SPIHT Compression and Selective Encryption[J].Applied Soft Computing Journal,2014,21(8):159-170.
    [11]Bilge K,Aydin T.Automated Detection of Regions of Interest for Tissue Micro-array Experiments:An Image Texture Analysis[J].BMC Medical Imaging,2014,7(1):1-7.
    [12]Bhatnagar G,Wu Q M J,Liu Zheng.Human Visual System Inspired Multi-modal Medical Image Fusion Framework[J].Expert Systems with Applications,2013,40(5):1708-1720.
    [13]宋雁斓.视觉注意模型及其在图像分类中的应用[D].上海:上海交通大学,2008.
    [14]Ozkaynak F,zer A B,Yavuz S.Cryptanalysis of a Novel Image Encryption Scheme Based on Improved Hyperchaotic Sequences[J].Optics Communications,2012,285(24):4946-4948.
    [15]许爽,王伟,苏玉.基于双向扩散机制融合伪随机数同步生成器的快速图像加密算法研究[J].科学技术与工程,2014,14(3):45-50.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700