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

基于二级定位的编码信道信息隐藏算法
引用本文:陈立全,卢 苗,胡爱群,孙晓燕.基于二级定位的编码信道信息隐藏算法[J].通信学报,2013,34(12):120-130.
作者姓名:陈立全  卢 苗  胡爱群  孙晓燕
作者单位:东南大学 信息安全研究中心,江苏 南京 210096
基金项目:国家高技术研究发展计划(“863”计划)基金资助项目(2013AA014001);国家自然科学基金资助项目(61372103);2011发改委信息安全专项基金资助项目
摘    要:分析了以编码信道为载体的信息隐藏算法及容量,指出现有算法存在的问题,提出了一种结合容量上限判断的基于二级定位的信息隐藏算法。所提算法在秘密信息嵌入前首先计算系统隐藏容量上限,并判断是否超出;接着在嵌入位置选择过程中引入二级定位以及循环移位机制。仿真结果表明,相比已有算法,所提算法能较好地避免因隐藏容量过大而导致秘密通道暴露的风险;同时通过二级定位及循环移位机制提高嵌入位置的随机性,避免秘密信息相互覆盖,提升信息隐藏性能。

关 键 词:信息隐藏  编码信道  二级嵌入  循环移位
收稿时间:6/9/2013 12:00:00 AM

Improved information hiding algorithm based on twice positioning in coding channel
Li-quan CHEN,Miao LU,Ai-qun HU,Xiao-yan SUN.Improved information hiding algorithm based on twice positioning in coding channel[J].Journal on Communications,2013,34(12):120-130.
Authors:Li-quan CHEN  Miao LU  Ai-qun HU  Xiao-yan SUN
Affiliation:Research Center of Information Security,Southeast Un versity,Nanjing 210096,China
Abstract:Based on analysis of existing information hiding algorithms and capacities in coding channel, the defects of those existing algorithms were pointed out, and an improved information hiding algorithm with capacity upper limit analysis and based on twice positioning was proposed. In the proposed algorithm, the information hiding capacity upper limit is firstly computed before embedding, and used for comparison with the size of hiding secret data. Then, twice positioning scheme and cyclic shift mechanism for choosing the embedding position were used in the proposed algorithm. Simulation results show that, compared with those existing algorithms, the proposed algorithm is able to avoid the risk of exposure of the secret channel caused by capacity exceeding of hiding data. It can not only improve the randomness of the embedding position, but also avoid the risk of overlap among different secret data. The hiding performances of the coding channel information hiding sys-tem are improved.
Keywords:information hiding  coding channel  twice positioning  cyclic shift
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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