The capacity of arithmetic compression based text steganography method

R. Saniei, K. Faez
{"title":"The capacity of arithmetic compression based text steganography method","authors":"R. Saniei, K. Faez","doi":"10.1109/IRANIANMVIP.2013.6779946","DOIUrl":null,"url":null,"abstract":"Application of the lossless compression method to hide texts is considered as a novel trend in research projects. Evaluation of the proposed methods in the field of steganography reflects a variety of approaches to create covert communication via text files. The extensiveness of steganographic issues and the presence of a huge variety of approaches make it difficult to precisely compare and evaluate these methods. Therefore, in this article a new steganography method that uses a statistical compression technique called `arithmetic coding', will be presented. In addition, the comparison of this method capacity with other methods will be explained. The arithmetic coding technique that has very high compression rates, shall guarantee even a higher growth capacity and higher security compared to its similar techniques. Meanwhile, the secret messages were not revealed through rewriting or syntax/semantic checking and compared with similar methods, increased the capacity by up to 68.9%, and compared with other methods; this method improved the capacity of fifteen times.","PeriodicalId":297204,"journal":{"name":"2013 8th Iranian Conference on Machine Vision and Image Processing (MVIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th Iranian Conference on Machine Vision and Image Processing (MVIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRANIANMVIP.2013.6779946","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Application of the lossless compression method to hide texts is considered as a novel trend in research projects. Evaluation of the proposed methods in the field of steganography reflects a variety of approaches to create covert communication via text files. The extensiveness of steganographic issues and the presence of a huge variety of approaches make it difficult to precisely compare and evaluate these methods. Therefore, in this article a new steganography method that uses a statistical compression technique called `arithmetic coding', will be presented. In addition, the comparison of this method capacity with other methods will be explained. The arithmetic coding technique that has very high compression rates, shall guarantee even a higher growth capacity and higher security compared to its similar techniques. Meanwhile, the secret messages were not revealed through rewriting or syntax/semantic checking and compared with similar methods, increased the capacity by up to 68.9%, and compared with other methods; this method improved the capacity of fifteen times.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于容量算法压缩的文本隐写方法
应用无损压缩方法隐藏文本被认为是研究项目中的一个新趋势。对隐写术领域中提出的方法的评估反映了通过文本文件创建隐蔽通信的各种方法。隐写问题的广泛性和各种方法的存在使得很难精确地比较和评估这些方法。因此,在这篇文章中,一个新的隐写方法,使用统计压缩技术称为“算术编码”,将提出。此外,还将说明该方法的容量与其他方法的比较。算术编码技术具有很高的压缩率,与同类技术相比,它需要保证更高的增长能力和更高的安全性。同时,与同类方法相比,未通过重写或语法/语义检查对秘密信息进行披露,容量提高了68.9%,与其他方法相比;这种方法使容量提高了15倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automated lung CT image segmentation using kernel mean shift analysis A simple and efficient approach for 3D model decomposition MRI image reconstruction via new K-space sampling scheme based on separable transform Fusion of SPECT and MRI images using back and fore ground information Real time occlusion handling using Kalman Filter and mean-shift
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1