【24h】

Novel Steganographic Schemes Based on Row-Major Mapping Relation

机译:基于行主要映射关系的新型书签计划

获取原文

摘要

This paper presents two concise novel steganographic schemes of strings comparing and formats converting based on the Row-Major Mapping Relation (RMMR). In general, the number of concealed secret bits(m) is far smaller than that of available host bits(n). Based on the property, we proved that if n≥2{sup}m-1, the alteration rates of our proposed schemes are independent of n, and the alteration rates are close to m{sup}(-1) when m is large. Even in the worst case that the amount of the secret bits is equal to that of the host bits and over half of the host bits are altered, our proposed scheme based on the Row-Major Mapping Relation with complement (RMMRwC) can decrease the alteration rate. From practical analyses and theoretical inductions, all results show that our novel schemes have advantages over steganography.
机译:本文介绍了基于行主要映射关系(RMMR)的串比较和格式化转换的两个简洁的新型隐写计划。通常,隐藏的秘密比特(m)的数量远小于可用主机位(n)的数量。基于该性质,我们证明,如果n≥2{sup} m-1,我们建议方案的改变率与n无关,并且当m很大时,改变率接近m {sup}( - 1) 。即使在最坏的情况下,秘密比特的量等于主机位的量和超过一半主机位,也可以基于与补码(RMMRWC)的行主要映射关系的建议方案可以减少改变速度。从实际分析和理论诱导中,所有结果表明,我们的小说方案具有与隐写术的优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号