.png){kind=icon}
Return
A Huffman compression based text steganography method
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-012-1223-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, capacity and security issues of text steganography have been considered by proposing a compression based approach. Because of using textual data in steganography, firstly, the employed data compression algorithm has to be lossless. Accordingly, Huffmann coding has been chosen due to its frequent use in the literature and significant compression ratio. Besides, the proposed method constructs and uses stego-keys in order to increase security. Secret information has been hidden in the chosen text from the previously constructed text base that consists of naturally generated texts. Email has been chosen as communication channel between the two parties, so the stego cover has been arranged as a forward mail platform. As the result of performed experiments, average capacity has been computed as 7.962 % for the secret message with 300 characters (or 300a (TM) 8 bits). Finally, comparison of the proposed method with the other contemporary methods in the literature has been carried out in Section 5.
Keywords:
Steganography
Text steganography
Data compression
Huffman coding
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more