PAPER PRESENTED BY

NAME: O.BHASKAR VRAO NAME: M.MANEESH

3/4B.Tech (CSE) 3/4B.Tech (CSE)
Ph NO: 9030548751 Ph NO: 9030172341
bhaskaremperor@gmail.com maturimanish@gmail.com
NAME: P.DINESH
3/4 B.TECH (CSE)
Ph NO: 9030178346
dineshpurini110@gmail.com

GITAM UNIVERSITY
VISAKHAPATNAM-43
ABSTRACT- And so on. This trick is continued till the
end of the encrypted data. Now this total
In a steganographic system the confidential image should be sent to the receiver and
text or confidential image is hidden inside a receiver should decrypt and get the
cover image in redundant bit positions. After confidential text or image.
the confidential information is embedded
into the cover image the change in Keywords-cipher,steganography,
appearance of the cover image should not be cryptography, encryption, decryption, stego,
apparent to naked eye; so that nobody will embedding, intruder.
suspect that something is there inside. To
make it still secure the confidential text or
image can be encrypted and embedded.
After it is obtained at the receiver it can be
decrypted. In this paper I have used
International data encryption algorithm to
encrypt the confidential information and the
encrypted text or image is embedded into
the cover image in the following manner.
The cover image is divided into bytes. In
each byte one bit of the encrypted data is to
be embedded. In the first byte the first bit
position, in the second byte the second bit
position, in the third byte the third bit
position and so on till the 8th byte. Again in
the 9th byte the first bit position, in the 10th
byte the second bit position and so on till the
16th byte. Again in the 17th byte the 1st bit
position, in the 18th byte the 2nd bit position I. INTRODUCTION

Steganography is the practice of hiding private

information with in something that appears to be
nothing out of the usual. Steganography is
confused with cryptography; both are to protect
private information. Cryptography uses
encryption and decryption. Where as
steganography uses encryption, embedding into
a cover image and decryption. So steganography
is a two level security mechanism. Even in
steganography no body will suspect that some
hidden data is there [5]. Steganography can be
three types [4]. Those are: Steganography in
images, steganography in audio and
steganography in video. This paper represents
steganography in image i.e. the first category. In
this type the covering file is an image where the
private information is to be embedded. Here
private information means private text or private
image. In second category the cover file is a
video inside which the private information is to
be embedded. In third category the cover file is
an audio.
When hiding information inside images
usually LSB (least significant bit) method is
used. To a computer an image is simply a
file that shows the different colors and
intensities of light on different areas of an
image. But in my work I have used a
different approach. In the first byte the first
bit position, in the second byte the second
Bit position, in the third byte the third bit
position and so on till the 8th byte. Again in
The 9th byte the first bit position, in the 10th
byte the second bit position and so on till the
16th byte. Again in the 17th byte the 1st bit
position, in the 18th byte the 2nd bit position
and so on. This trick is continued till the end
of the encrypted data. Here one point we can
note is the length of the cover image should
be 8 times than the cipher data. We have
different types of image files like BMP,
JPEG etc. I have used JPEG. JPEG gives
good performance [6]
When information is hidden inside video the
program or person hiding the information
will usually use the DCT (discrete cosine
transform) method. DCT works by slightly
changing the each of the images in the
video, such that it is not noticeable.
Steganography in video is similar to
steganography in image. When a small
amount of information is hidden inside of
video it is not noticeable at all, however the
more information it is hidden the more
noticeable it become [4].
When hiding information inside audio files
the technique usually used is low bit
encoding which is somewhat similar to LSB
that is generally used in images. The
problem with low bit encoding is that it is
usually noticeable to the human ear so that it
is a risky method. This method works by
adding random noises to the signal the
information is conceal inside a carrier and
spread across the frequency spectrum. Echo
hiding is yet another method of hiding
information inside an audio file. This
method uses the echoes in sound files in
order to try and hide the information. By
simply adding extra sound to an echo in
audio file information can be concealed.
Instead of hiding the direct information, if
we hide its cipher by using a complex
algorithm the system can attain another level
of security. In my work I have used
International data encryption algorithm to
encrypt at sender and decrypt at receiver.
The sender and receiver should share the
key as per the algorithm. In section 2, I have
clearly mentioned how IDEA is working and
how my proposed stego system is working.
II. THE PROPOSED SYSTEM
The entire process can be understood by
referring the following three sections. Here I
have discussed about IDEA and the
embedding process.
IDEA Algorithm
The IDEA cipher was developed by Xuejia
Lai and James Massey in 1990. It was called
PES (Proposed Encryption Standard). The
next year, after some careful verification it
was called IPES (Improved PES). It’s name
was changed to IDEA in 1992. IDEA is
based on some impressive theoretical
foundations and, although cryptanalysis has
made some progress against reduced-round
variants, the algorithm still seems strong. In
my opinion it is the best and most secure
block cipher algorithm available to the
public at this time. The future of IDEA is
not clear. There has been no rush to adopt it
as a replacement to DES, partly because
people are still waiting, to see how well the
algorithm fares during the coming years of
cryptanalysis.
IDEA is a block cipher; it operates on 64 –
bit plaintext blocks. The key is 128 bits
long. The same algorithm is used for both
encryption and decryption. The design
philosophy behind the algorithm is three
algebraic operations are used; all can be
easily implemented in both hardware and
software [2]. The operations are: XOR,
Addition modulo 216 and Multiplication
modulo (216 + 1). These operations operate
on 16 bit sub-blocks.
Fig.1 represents an overview of IDEA. The
64-bit data block is divided into four 16 bit
sub blocks: X1, X2, X3 and X4. These four
sub blocks become the input to the first
round of the algorithm. There are eight
rounds total. In each round the four sub
blocks are XORed, added and multiplied
with one another and with 16-bit sub keys.
Between rounds, the second and third sub
blocks are swapped. Finally, the four sub
blocks are combined with four sub keys in
an output transformation.
Fig.1 IDEA algorithm
In each round the sequence of calculations is
as follows:
1. Multiply X1 and the first sub key Z1.
2. Add X2 and second sub key Z2.
3. Add X3 and the third sub key Z3.
4. Multiply X4 and the fourth sub key Z4.
5. XOR the results of steps 1 and 3.
6. XOR the results of steps 2 and 4.
7. Multiply the results of step 5 with the fifth
Sub key Z5.
8. Add the results of steps 6 and 7.
9. Multiply the results of step 8 with the
sixth
sub key Z6.
10. Add the results of steps 7 and 9.
11. XOR the results of steps 1 and 9.
12. XOR the results of steps 3 and 9.
13. XOR the results of steps 2 and 10.
14. XOR the results of steps 4 and 10.
The output of the round is the four sub
blocks that are the results of steps 11, 12, 13,
and 14. Swap the two inner blocks except
for the last round and that is the input to the
next round. After the eighth round, there is a
final output transformation:
1. Multiply X1 and the first sub key Z1.
2. Add X2 and second sub key Z2.
3. Add X3 and the third sub key Z3.
4. Multiply X4 and the fourth sub key Z4.
Finally the four sub blocks are reattached to
produce the cipher text. Creating the sub
keys is also easy. The algorithm uses 52 of
them (six for each of the eight rounds and
four more for the output transformation.
First, the 128-bit key is divided into eight
16-bit sub keys. These are the first eight sub
keys for the algorithm (the six for the first
round and the first two for the second
round). Then the key is rotated 25 bits to the
left and again divided into eight sub keys.
The first four are used in round 2; the last
four are used in round 3. The key is rotated
another 25 bits to the left for the next eight
sub keys, and so on until the end of the
algorithm. Decryption is exactly the same,
except that the sub keys are reversed and
slightly different. The decryption sub keys
are either the additive or multiplicative
inverses of the encryption sub keys. [For the
purpose of IDEA, the all zero sub block is
considered to represent 216 = -1 for
multiplication modulo 216 +1; thus the
multiplicative inverse of 0 is 0]. Calculating
these keys takes some doing, but you only
have to do it once for each decryption key.
The Embedding Process
The cover image is to be converted to
binary. The private information is to be
converted to binary. Then it should be
encrypted by IDEA algorithm to get the
cipher text. The cipher text can be embedded
into the cover image. There are many ways
of embedding. The most usual way is LSB
(least significant bit) insertion [1]. One bit of
the cipher is embedded into the 1st bit of
each byte of the cover image. In this paper I
used a different approach. In the first byte
the first bit position, in the second byte the
second bit position, in the third byte the
third bit position and so on till the 8th byte.
Again in the 9th byte the first bit position, in
the 10th byte the second bit position and so
on till the 16th byte. Again in the 17th byte
the 1st bit position, in the 18th byte the 2nd bit
position and so on. This trick is continued
till the end of the encrypted data. Here one
point we can note is the length of the cover
image should be 8 times than the cipher
data. Also if the length of the cipher data is
less than 1/8th of the cover image then zeros
are to be added to the cipher to make its
length 1/8th of the cover image. The receiver
will collect the cipher from the respective bit
positions and decrypt it to get the actual
information. The IDEA algorithm uses a
very complex calculation so it will be very
difficult for the intruder to hack the data.
III. ALGORITHMS
Algorithm1 (Text in Image)
Step1- Convert the cover image to binary
Step2 – Convert the private data to binary.
Step3 – Make sure that the length of cover
image is exactly 8 times than that of the
private data. If the cover image is less than 8
times, then a bigger image can be taken, or
if the length of private data is less than 1/8th
of the cover image than zeroes can be
padded.
Step4 – Applying IDEA algorithm to
encrypt the private data by using the 128-bit
key. Now we got the cipher.
Step5 – Embed the cipher into the cover
image as discussed in section II.
Step6 – Now send the total image to receiver
Step7 – Receiver collects the bits from each
byte from the different bit positions as he
knows the positions and applies the IDEA
algorithm with the same 128-bit (as used by
sender) key to decrypt and get the hidden
information.
Algorithm2 (Image in Image)
Step1- Convert the cover image to binary
Step2 – Convert the private image to binary.
Step3 – Make sure that the length of cover
image is exactly 8 times than that of the
private image. If the cover image is less than
8 times then a bigger image can be taken, or
if the length of private image is less than
1/8th of the cover image than zeroes can be
padded.
Step 4– Applying IDEA algorithm to
encrypt the private image by using the 128-
bit key. Now we got the cipher.
Step5 – Embed the cipher into the cover
image as discussed in section II.
Step6 – Now send the total image to receiver
Step7 – Receiver collects the bits from each
byte from the different bit positions as he
knows the positions and applies the IDEA
algorithm with the same 128-bit (as used by
sender) key to decrypt and get the hidden
image.
IV THE SECURITY OF THE SYSTEM
There are two levels of security in this
proposed stego system. Firstly the intruder
cannot suspect by seeing the image that
there is something hidden inside it. If at all
he suspects then what are the bit positions,
how he will identify. If the bit positions
identified how he can get the key to decrypt
the cipher. If the intruder will try to hack by
hit and trial method he may take years
together.

V. EXPERIMENTAL RESULTS

Algorithm1- Fig.2 represents how the text is

hidden inside the image. Fig.3 represents the
transmitted image and fig.4 represents the
decryption at the receiver.

Fig.2 hiding the text in the image

The private text to be hidden is: “we will
meet tomorrow at 9 AM”. The cover image

Fig.4 Decryption at the receiver

Algorithm2-Fig.5 represents how the private
image is hidden inside the cover image.
Fig.-6 represents the transmitted total image
and fig.7 represents the decryption at the
receiver.

Fig.3 Transmitted Image(Text is hidden)

 Fig.6 Transmitted total Image

Fig.5 hiding of the image inside the cover

image

The left side image shown in fig.5 is the

private image to be hidden in side the right
side image.

Fig.7 Decryption at the receiver

VI CONCLUSION REFERENCES
• As we can observe from the results
both the algoriths works very fine.
Of course I have observed by taking [1] Mohammad Ali Bani Younes, Aman
other samples also. Jantan, “A New Steganography Approach
• It provides multiple levels of for Image Encryption Exchange by using the
security. If at all the intruder LSB insertion”, IJCSNS International
suspects it is very very difficult for Journal of Computer Science & Network
him to hack the data. Security, Vol 8, No 6 , June 2008.

• But the main demerit is the sender

and receiver should agree the bit [2] Antti Hamalanen, Matti Tommiska and

insertion positions and the key. The Jorma Skytta, “6.78 Gigabits

image quality slightly degrades. Implementation of the IDEA Cryptographic

• This process can be extended to send Algorithm”, 12th conference on Field

private image in cover image. Programmable Logic and Applications,

• It can also be referred to devise new Montpellier, France, Sept 2002.

process how to send private

data/image in audio as well as video. [3] Alphaeis Mangarae, In Article “[Zone-
H.org]” March 18th 2006.

[4] Miroslav Dobsicek, In Article “Modern

Cryptography”, Czeck Technical University
in Prague.

[5] Ross J. Anderson, Fabian A.P.

Petitcolas,
“On The Limits of steganography”, IEEE
Journal of selected Areas in communication,
16(4), 474-481, May 1998.
6] Lei Zhang, Ingemar J. Cox, In article
“JPEG Based conditional entropy coding for

Correlated Steganography”, University

College London, United Kingdom.