一种有效的F5断裂算法

2005 IEEE 7th Workshop on Multimedia Signal Processing Pub Date : 2005-10-01 DOI:10.1109/MMSP.2005.248568

Hong Cai, S. Agaian, Yufeng Wang

{"title":"一种有效的F5断裂算法","authors":"Hong Cai, S. Agaian, Yufeng Wang","doi":"10.1109/MMSP.2005.248568","DOIUrl":null,"url":null,"abstract":"By thwarting visual and chi2 attacks, the F5 steganographic algorithm is viewed as a challenge to steganalysis. This paper presents a novel algorithm that can break F5, even with low embedding rates. The test results show that the proposed method can accurately break F5 when relatively short messages (82 bytes) are embedded into a 256times256 gray image","PeriodicalId":191719,"journal":{"name":"2005 IEEE 7th Workshop on Multimedia Signal Processing","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An Effective Algorithm for Breaking F5\",\"authors\":\"Hong Cai, S. Agaian, Yufeng Wang\",\"doi\":\"10.1109/MMSP.2005.248568\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By thwarting visual and chi2 attacks, the F5 steganographic algorithm is viewed as a challenge to steganalysis. This paper presents a novel algorithm that can break F5, even with low embedding rates. The test results show that the proposed method can accurately break F5 when relatively short messages (82 bytes) are embedded into a 256times256 gray image\",\"PeriodicalId\":191719,\"journal\":{\"name\":\"2005 IEEE 7th Workshop on Multimedia Signal Processing\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 IEEE 7th Workshop on Multimedia Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMSP.2005.248568\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE 7th Workshop on Multimedia Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2005.248568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

通过挫败视觉和chi2攻击，F5隐写算法被视为对隐写分析的挑战。本文提出了一种新的算法，即使在低嵌入率下也能打破F5。测试结果表明，在灰度图像256times256的情况下，该方法可以较准确地打破F5

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Effective Algorithm for Breaking F5

By thwarting visual and chi2 attacks, the F5 steganographic algorithm is viewed as a challenge to steganalysis. This paper presents a novel algorithm that can break F5, even with low embedding rates. The test results show that the proposed method can accurately break F5 when relatively short messages (82 bytes) are embedded into a 256times256 gray image

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2005 IEEE 7th Workshop on Multimedia Signal Processing

自引率

0.00%

发文量