Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/657
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJena, S K-
dc.contributor.authorKrishna, G V V-
dc.date.accessioned2008-04-09T02:20:29Z-
dc.date.available2008-04-09T02:20:29Z-
dc.date.issued2007-
dc.identifier.citationInternational Journal of Computers, Communications & Control, Vol 2, Iss 2, P 149-158en
dc.identifier.urihttp://www.journal.univagora.ro/?page=article_details&id=81-
dc.identifier.urihttp://hdl.handle.net/2080/657-
dc.descriptionCopyright belongs to Agora University, Romaniaen
dc.description.abstractSteganography is used to hide the occurrence of communication. Discovering and rendering useless such covert message is an art of steganalysis. The importance of techniques that can reliably detect the presence of secret messages in images is increasing as images can hide a large amount of malicious code that could be activated by a small Trojan horse type of virus and also for tracking criminal activities over Internet. This paper presents an improved blind steganalysis technique. The proposed algorithm reduces the initial-bias, and estimates the LSB embedding message ratios by constructing equations with the statistics of difference image histogram. Experimental results show that this algorithm is more accurate and reliable than the conventional difference image histogram method. It outperforms other powerful steganalysis approaches for embedded ratio greater than 40% and comparable with RS steganalysis technique for shorter hidden message length.en
dc.format.extent171693 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherAgora University Editing House, Romaniaen
dc.subjectSteganographyen
dc.subjectSteganalysisen
dc.subjectHidden message extractionen
dc.titleBlind Steganalysis: Estimation of Hidden Message Lengthen
dc.typeArticleen
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
IJCCC-2007.pdf167.67 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.