Digital Encryption through

Steganography
Abstract:
Steganography is art of hiding information in ways that prevent the detection of
hidden messages. Steganography derived from Greek, literally means Covered
Writing. It incldes a vast array of secret commnications methods that conceal
the message!s very e"istence. #hese methods inclde invisi$le inks, microdots,
character arrangement, digital signatre, covert channels and spread spectrm
commnications.
Steganography and Cryptography are cosins in the spy craft family.
Cryptography scram$les a message so it cannot $e nderstood. Steganography
hides the message so it cannot $e seen. A message in cipher te"t, for instance,
might arose sspicion on the part of the recipient while an invisi$le message
created with steganographic will not.
Introduction:
Steganography is a way of em$edding %st a$ot any kind of &le or data within
another 'cover' &le, thogh not noticea$ly altering the cover &le(s content.
)sally this em$edded content is encrypted with a pass phrase of some sort, only
e"tracta$le via special programs. So shold yo em$ed a &le within a *+,G
image, for e"ample, the casal o$server wold only see the image and perhaps
only notice something odd de to the image(s &le si-e.
#his application for Steganography is designed for hiding the information in the
images, where in the information is em$edded with the images. #his em$edded
image is transferred to the destination where in decrypting is not possi$le. #his
application is provided with password where encrypted information can $e
decrypted sing this password which is a secrity featre to the system.
Purpose
STEGANOGRAPH is an application designed for transferring of information
throgh secrity. .ain intention of this application is to em$ed the information
inside the images and to transfer the image which can $e decoded at the
destination place. #his is a form of encrypting the information, which ses
di/erent algorithms for em$edding the information.
Steganography is destined to $ecome increasingly important as more citi-ens are
looking at steganography to thwart policies of reglating or prohi$iting the se of
cryptography for personal privacy prposes and pass messages covertly.
0rthermore the commercial application of steganographic methods which are
implemented in water marks and &nger printing is in continos growth and se
in electronic media. 1o techni2e of information hiding can ensre secrecy3
however, $y com$ining steganography with other techni2es, sch as
cryptography, a higher chance of sccess can $e achieved. 4ne shold think of
steganography, not as a replacement to cryptography $t as a vital spplement
to it.
Scope:
Proposed Syste! "eatures:
#his application gives the featres of em$edding the information with in an
image. #his information is em$edded with the image sing di/erent algorithms.
Algorithms sed are5
6. 7attle steg
8. 7lind side
9. :ynamic $attle Steg and :ynamic &lter &rst
;. 0ilter &rst
<. =ide seek
#attle Steg
#he $est of all worlds. #his algorithm performs 'Battleship Steganography'. It &rst
&lters the image then ses the highest &lter vales as 'ships'. #he algorithm then
randomly 'shoots' at the image >like in =ide Seek? and when it &nds a 'ship' it
clsters it(s shots arond that hit in the hope of 'sinking' the 'ship'. After a while
it moves away to look for other ships. #he e/ect this has is that the message is
randomly hidden, $t often hidden in the '$est' parts to hide in thanks to the
ships. It moves away to look for other ships so that we don(t degrade an area of
an image too greatly. It is secre $ecase yo need a password to retrieve the
message. It is fairly e/ective $ecase it is hiding >if yo set the vales right? the
ma%ority of the information in the $est areas
#$IND SIDE:
7lindside creates slight color in@ections in an image which, althogh
invisi$le to the hman eye, can create a wealth of space in which to store
information. Some stego tilities will in@ect and change every single pi"el
in the image A and althogh this can create larger storage spaces, the
e/ects are often noticea$le in the image. 7y contrast 7lindside calclates
the color di/erences $etween pi"els and will only modify the image where
changes are deemed to $e perceptally insigni&cant. An B4C $ased crypto
algorithm can also $e sed to scram$le the data with a secret pass phrase
>note B4C $ased cryptosystems are not very secre?.
%I$TER %IRST
#he prpose of these &lters is to prepare the image data for optimm
compression.
+1G &lter method D de&nes &ve $asic &lter types5
#ype 1ame

D 1one
6 S$
8 )p
9 Average
; +aeth
#he encoder can choose which of these &lter algorithms to apply on a
scanlineA$yAscanline $asis. In the image data sent to the compression
step, each scan line is preceded $y a &lter type $yte that speci&es the
&lter algorithm sed for that scan line.
0iltering algorithms are applied to bytes, not to pi"els, regardless of the
$it depth or color type of the image. #he &ltering algorithms work on the
$yte se2ence formed $y a scan line that has $een represented as
descri$ed in Image layot. If the image incldes an alpha channel, the
alpha data is &ltered in the same way as the image data.
When the image is interlaced, each pass of the interlace pattern is treated
as an independent image for &ltering prposes. #he &lters work on the
$yte se2ences formed $y the pi"els actally transmitted dring a pass,
and the 'previos scan line' is the one previosly transmitted in the same
pass, not the one ad%acent in the complete image. 1ote that the s$
image transmitted in any one pass is always rectanglar, $t is of smaller
width andEor height than the complete image. 0iltering is not applied when
this s$ image is empty.
0or all &lters, the $ytes 'to the left of' the &rst pi"el in a scan line mst $e
treated as $eing -ero. 0or &lters that refer to the prior scan line, the entire
prior scan line mst $e treated as $eing -eroes for the &rst scan line of an
image >or of a pass of an interlaced image?.
#o reverse the e/ect of a &lter, the decoder mst se the decoded vales
of the prior pi"el on the same line, the pi"el immediately a$ove the crrent
pi"el on the prior line, and the pi"el %st to the left of the pi"el a$ove. #his
implies that at least one scan line(s worth of image data will have to $e
stored $y the decoder at all times. ,ven thogh some &lter types do not
refer to the prior scan line, the decoder will always need to store each
scan line as it is decoded, since the ne"t scan line might se a &lter that
refers to it.
Hide and see&
Feeping compter &les private re2ires only the se of a simple encryption
program most of s have access to on or compters. 0or criminals or
terrorists wanting to conceal their activities, however, attaching an
encrypted &le to an email message is sre to raise sspicion with law
enforcement or government agents monitoring email traGc.
7t what if &les cold $e hidden within the comple" digital code of a
photographic imageH A family snapshot, for e"ample, cold contain secret
information and even a trained eye woldn(t know the di/erence.
#hat a$ility to hide &les within another &le, called steganography, is on the
increase thanks to a nm$er of software programs now on the market. 7t
the emerging science of detecting sch &les I steganalysis.
,lectronic images, sch as %peg &les, provide the perfect cover $ecase
they(re very common I a single compter can contain thosands of %peg
images and they can $e posted on We$ sites or emailed anywhere.
Steganographic, or stego, techni2es allow sers to em$ed a secret &le, or
payload, $y shifting the color vales %st slightly to accont for the '$its'
of data $eing hidden. #he payload &les can $e almost anything from illegal
&nancial transactions and the prover$ial o/Ashore accont information to
sleeper cell commnications or child pornography.
Dyna!ic #attleSteg and %ilter %irst
#hese two algorithms do the same as 7attleSteg and 0ilter 0irst, e"cept
they se dynamic programming to make the hiding process faster and less
memory intensive. #hey are 14# compati$le with the original algorithms
$ecase the order of pi"els kept in the dynamic array is not e"actly the
same.
Auto!ated Process:
6. +icking image to encode data.
8. Simlating ,ncodedE:ecoded data.
9. Analy-e the process of encodingEdecoding.
So"t'are Re(uire!ents:
+resentation Jayer =#.J K :=#.J and *avaScript
1etwork Jayer #C+EI+
We$ Server Jayer We$ logic L.6
#echnologies *S+ and *:7C
Jangage Speci&cation *8,, 6.<
4perating Systems Windows B+ or later