A Huffman compression based text steganography method

Şatır, Esra; Işık, Hakan

doi:10.1007/s11042-012-1223-9

Cited by 42 publications

(33 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the study of [2] the authors didn't make use of complexity of obtaining decompressed text. In order to make comparison with this study only the complexities contribution of k1, k2 and Vigenere cipher were used.…”

Section: Resultsmentioning

confidence: 99%

“…In order to make comparison with this study only the complexities contribution of k1, k2 and Vigenere cipher were used. In [2] complexity was followed as 8 × ∏ 2…”

Section: Resultsmentioning

confidence: 99%

“…In [1], [2], Satir and Isik used email to be the cover of the secret data. Sending same e-mail to many recipients were the key idea of their studies.…”

Section: Related Workmentioning

confidence: 99%

“…There may not be a proper method to validate whether the email address of each recipient is valid but sending an email to the respective address. In those papers [1], [2], email addresses are used to hide the stego keys, regardless they are valid addresses or not [3]. In [3] the authors proposed improvement of the study [2], such as the randomity of the generated email addresses.…”

Section: Related Workmentioning

confidence: 99%

“…Step1. Construct difference matrix D in order to select most suitable or relevant text from the T. the D is calculated by having difference of index of last matched symbol of S with current index of match symbol in T iteratively except for the first symbol of S as in case of first symbol, the last symbol index is 0 as in [1,2,3,4]. Step2.…”

Section: Embedding Phasementioning

confidence: 99%

See 4 more Smart Citations

New Approach in E-mail Based Text Steganography

Tutuncu¹,

Hassan²

2015

Int J Intell Syst Appl Eng

View full text Add to dashboard Cite

Abstract:In this study combination of lossless compression techniques and Vigenere cipher was used in the e-mail based text steganography. It makes use of email addresses to be the keys to embed/to extract the secret message into/from the email text (cover text). After selecting the cover text that has highest repetition pattern regarding to the secret message the distance matrix was formed. The members of distance matrix were compressed by following lossless compression algorithms as in written sequence; Run Length Encoding (RLE) + Burrows Wheeler Transform (BWT) + Move to Front (MTF) + Run Length Encoding (RLE) + Arithmetic Encoding (ARI). Later on Latin Square was used to form stego key 1and then Vigenere cipher was used to increase complexity of extracting stego key 1. Final step was to choose e-mail addresses by using stego key 1 (K1) and stego key 2 (K2) to embed secret message into forward email platform. The experimental results showed that proposed method has reasonable performance in terms of capacity and also higher security in terms of complexity.

show abstract

Section: Resultsmentioning

confidence: 99%

“…In order to make comparison with this study only the complexities contribution of k1, k2 and Vigenere cipher were used. In [2] complexity was followed as 8 × ∏ 2…”

Section: Resultsmentioning

confidence: 99%

“…In [1], [2], Satir and Isik used email to be the cover of the secret data. Sending same e-mail to many recipients were the key idea of their studies.…”

Section: Related Workmentioning

confidence: 99%