Steganography Technique with Huffman Code
Nilambar Sethi1, Padmaja Patel2

1Nilambar Sethi, Department of CSE, GIET University, Gunupur (Odisha), India.
2Padmaja Patel, Department of CSE, GIET University, Gunupur (Odisha), India.
Manuscript received on 07 July 2019 | Revised Manuscript received on 17 August 2019 | Manuscript Published on 27 August 2019 | PP: 867-870 | Volume-8 Issue-2S4 July 2019 | Retrieval Number: B11730782S419/2019©BEIESP | DOI: 10.35940/ijrte.B1173.0782S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: The growth of modern communication technologies imposes a particular means of security mechanisms in particular in case of data networks. In order to protect sensitive data while these are en route, applications call up different methods. Here we are trying to code the message by Huffman coding technique and applying the Steganography using differencing and substitution mechanisms with encryption to the original message which can give multi label security. Here we are trying to communicate in two phases such as (1) Encrypt the message by Huffman code and (2) applying the In Steganography. We divide the image into multiple blocks which are non-overlapped in nature and the block size is 3×3 pixel that will consider as matrix. For every value from the matrix can be represented in eight bit where two bit will use as least significant bit (LSB) substitution and quotient value differencing (QVD) is applied for other bits. We are trying to process in three levels: (i) Huffman tree through message is encrypted which is secret (ii) LSB substitution at lower bit planes and (iii) QVD at higher bit planes.
Keywords: Steganography, LSB Substitution, QVD, Huffman Code, Encryption, Decryption.
Scope of the Article: Encryption Methods and Tools