SteganographyImage Project Report

1/69 Steganography – Project Report
Abstract
Data hiding is a characteristic of object-oriented programming. Because an object can

only be associated with data in predefined classes or templates, the object can only
"know" about the data it needs to know about. There is no possibility that someone
maintaining the code may inadvertently point to or otherwise access the wrong data
unintentionally. Thus, all data not required by an object can be said to be "hidden". Data
hiding in media, in images, video and audio, is of interest for the protection of
copyrighted digital media, and to the government for information systems security and
for covert (steganographic) communications. It can also be used in forensic applications
for inserting hidden data into audio files for the authentication of spoken words and other
sounds, and in the music business for the monitoring of the songs over broadcast radio.
The technology enables the insertion and recovery of hidden data in audio files through
manipulation of the relative phase of harmonically related components of a host audio
signal.
Steganography is the art and science of writing hidden messages in such a way that no
one apart from the intended recipient knows of the existence of the message. The word
"Steganography" is of Greek origin and means "covered, or hidden writing". An
encrypted file may still hide information using Steganography, so even if the encrypted
file is deciphered, the hidden message is not seen. Steganography used in electronic
communication include steganographic coding inside of a transport layer, such as an
image file, or a protocol, such as UDP. The advantage of steganography over
cryptography alone is that messages do not attract attention to themselves, to messengers,
or to recipients. A steganographic message (the plaintext) is often first encrypted by some
traditional means, and then a hiddentext is modified in some way to contain the encrypted
message (ciphertext), resulting in stegotext..
This project report intends to give an overview of image steganography, its uses and
techniques. It also attempts to identify the requirements of a good steganography
algorithm and briefly reflects on which steganographic techniques are more suitable for
which applications. This project report describes the software functional and
nonfunctional requirements for release 1.0 of the Steganography Image system.
1
CHAPTER 1. INTRODUCTION
Steganography is the art of hiding the fact that communication is taking place, by hiding
information in other information. Many different carrier file formats can be used, but
digital images are the most popular because of their frequency on the internet.
One of the reasons that intruders can be successful is the most of the information they
acquire from a system is in a form that they can read and comprehend. Intruders may
reveal the information to others, modify it to misrepresent an individual or organization,
or use it to launch an attack. One solution to this problem is, through the use of
steganography. Steganography is a technique of hiding information in digital media. In
contrast to cryptography, it is not to keep others from knowing the hidden information
but it is to keep others from thinking that the information even exists.
Steganography become more important as more people join the cyberspace revolution.
Steganography is the art of concealing information in ways that prevents the detection of
hidden messages. Steganography include an array of secret communication methods that
hide the message from being seen or discovered.
Due to advances in ICT, most of information is kept electronically. Consequently, the

security of information has become a fundamental issue. Besides cryptography,
steganography can be employed to secure information. In cryptography, the message or
encrypted message is embedded in a digital host before passing it through the network,
thus the existence of the message is unknown. Besides hiding data for confidentiality, this
approach of information hiding can be extended to copyright protection for digital media:
audio, video and images.
The growing possibilities of modern communications need the special means of security
especially on computer network. The network security is becoming more important as the
number of data being exchanged on the internet increases. Therefore, the confidentiality
and data integrity are requires to protect against unauthorized access and use. This has
resulted in an explosive growth of the field of information hiding
2
1.1 Background
Information hiding is an emerging research area, which encompasses applications such as
copyright protection for digital media, watermarking, fingerprinting, and steganography.
In watermarking applications, the message contains information such as owner
identification and a digital time stamp, which usually applied for copyright protection.
Fingerprint, the owner of the data set embeds a serial number that uniquely identifies the
user of the data set. This adds to copyright information to makes it possible to trace any
unauthorized used of the data set back to the user.
Steganography hide the secrete message within the host data set and presence
imperceptible and is to be reliably communicated to a receiver. The host data set is
purposely corrupted, but in a covert way, designed to be invisible to an information
analysis.
1.2 Motivation
Digital representation of media facilitates access and potentially improves the portability,
efficiency, and accuracy of the information presented. Undesirable effects of facile data
access include an increased opportunity for violation of copyright and tampering with or
modification of content. The motivation for this work includes the provision of protection
of intellectual property rights, an indication of content manipulation, and a means of
annotation. Data hiding represents a class of processes used to embed data, such as
copyright information, into various forms of media such as image, audio, or text with a
minimum amount of perceivable degradation to the "host" signal; i.e., the embedded data
should be invisible and inaudible to a human observer. Note that data hiding, while
similar to compression, is distinct from encryption. Its goal is not to restrict or regulate
access to the host signal, but rather to ensure that embedded data remain inviolate and
recoverable.
1.3 Objective
The main objective of the data hiding process using image steganography is to ensure
security and a proper flow between two users.
Two important uses of data hiding in digital media are to provide proof of the copyright,
and assurance of content integrity. Therefore, the data should stay hidden in a host signal,
even if that signal is subjected to manipulation as degrading as filtering, resampling,
3
cropping, or lossy data compression. Other applications of data hiding, such as the
inclusion of augmentation data, need not be invariant to detection or removal, since these
data are there for the benefit of both the author and the content consumer. Thus, the
techniques used for data hiding vary depending on the quantity of data being hidden and
the required invariance of those data to manipulation. Since no one method is capable of
achieving all these goals, a class of processes is needed to span the range of possible
applications.
1.4 Organization of dissertation
Steganography thesis is concentrating in making a better Steganography system with
sufficient and effective Steganography techniques. The art of encrypting confidential
message by a covered medium as audio, picture, video files or text is known as
Steganography. Recent Steganography Thesis is carried by combining of cryptography
and Steganography techniques for secure transmission of digital data. Steganography
thesis relies on analyzing the existing Steganography algorithm and its challenges.
Steganography thesis is based on improving secure transmission of data. The previous
work in Steganography thesis provides a basic concept of Steganography to new
researchers. Excellent technology has been put in to protect personal information. The
powerful Steganography programs for hiding MP4 or quicktime multimedia files are
truecrypt. For Steganography thesis we have good PhD advisors and research scholars to
bring out the best in Steganography thesis. Steganography Thesis editing service is also
accompanied in our concern.
The technical challenges of data hiding are formidable. Any "holes" to fill with data in a
host signal, either statistical or perceptual, are likely targets for removal by lossy signal
compression. The key to successful data hiding is the finding of holes that are not suitable
for exploitation by compression algorithms. A further challenge is to fill these holes with
data in a way that remains invariant to a large class of host signal transformations.Data-
hiding techniques should be capable of embedding data in a host signal with the
following restrictions and features:
1. The host signal should be non objectionally degraded and the embedded data
should be minimally perceptible. (The goal is for the data to remain hidden. As
any magician will tell you, it is possible for something to be hidden while it
4
remains in plain sight; you merely keep the person from looking at it. We will use
the words hidden, inaudible, imperceivable, and invisible to mean that an observer
does not notice the presence of the data, even if they are perceptible.)
2. The embedded data should be directly encoded into the media, rather than into a
header or wrapper, so that the data remain intact across varying data file formats.
3. The embedded data should be immune to modifications ranging from intentional
and intelligent attempts at removal to anticipated manipulations, e.g., channel
noise, filtering, resampling, cropping, encoding, lossy compressing, printing and
scanning, digital-to-analog (D/A) conversion, and analog-to-digital (A/D)
conversion, etc.
4. Asymmetrical coding of the embedded data is desirable, since the purpose of data
hiding is to keep the data in the host signal, but not necessarily to make the data
difficult to access.
5. Error correction coding should be used to ensure data integrity. It is inevitable that
there will be some degradation to the embedded data when the host signal is
modified.
6. The embedded data should be self-clocking or arbitrarily re-entrant. This ensures
that the embedded data can be recovered when only fragments of the host signal
are available, e.g., if a sound bite is extracted from an interview, data embedded
in the audio segment can be recovered. This feature also facilitates automatic
decoding of the hidden data, since there is no need to refer to the original host
signal.
Applications Trade-offs exist between the quantity of embedded data and the degree of
immunity to host signal modification. By constraining the degree of host signal
degradation, a data-hiding method can operate with either high embedded data rate, or
high resistance to modification, but not both. As one increases, the other must decrease.
While this can be shown mathematically for some data-hiding systems such as a spread
spectrum, it seems to hold true for all data-hiding systems. In any system, you can trade
bandwidth for robustness by exploiting redundancy. The quantity of embedded data and
the degree of host signal modification vary from application to application.
5
Consequently, different techniques are employed for different applications. Several

prospective applications of data hiding are discussed in this section. An application that
requires a minimal amount of embedded data is the placement of a digital water mark.
The embedded data are used to place an indication of ownership in the host signal,
serving the same purpose as an author's signature or a company logo. Since the
information is of a critical nature and the signal may face intelligent and intentional
attempts to destroy or remove it, the coding techniques used must be immune to a wide
variety of possible modifications. A second application for data hiding is tamper-
proofing. It is used to indicate that the host signal has been modified from its authored
state. Modification to the embedded data indicates that the host signal has been changed
in some way. A third application, feature location, requires more data to be embedded. In
this application, the embedded data are hidden in specific locations within an image. It
enables one to identify individual content features, e.g., the name of the person on the left
versus the right side of an image. Typically, feature location data are not subject to
intentional removal. However, it is expected that the host signal might be subjected to a
certain degree of modification, e.g., images are routinely modified by scaling, cropping,
and tone-scale enhancement. As a result, feature location data-hiding techniques must be
immune to geometrical and nongeometrical modifications of a host signal.
6
CHAPTER 2. LITERATURE REVIEW
An application that requires a minimal amount of embedded data is the placement of a

digital water mark. The embedded data are used to place an indication of ownership in
the host signal, serving the same purpose as an author's signature or a company logo.
Since the information is of a critical nature and the signal may face intelligent and
intentional attempts to destroy or remove it, the coding techniques used must be immune
to a wide variety of possible modifications. A second application for data hiding is
tamper-proofing. It is used to indicate that the host signal has been modified from its
authored state. Modification to the embedded data indicates that the host signal has been
changed in some way. A third application, feature location, requires more data to be
embedded. In this application, the embedded data are hidden in specific locations within
an image. It enables one to identify individual content features, e.g., the name of the
person on the left versus the right side of an image. Typically, feature location data are
not subject to intentional removal. However, it is expected that the host signal might be
subjected to a certain degree of modification, e.g., images are routinely modified by
scaling, cropping, and tone-scale enhancement. As a result, feature location data-hiding
techniques must be immune to geometrical and nongeometrical modifications of a host
signal. Image and audio captions (or annotations) may require a large amount of data.
Annotations often travel separately from the host signal, thus requiring additional
channels and storage. Annotations stored in file headers or resource sections are often lost
if the file format is changed, e.g., the annotations created in a Tagged Image File Format
(TIFF) may not be present when the image is transformed to a Graphic Interchange
Format (GIF). These problems are resolved by embedding annotations directly into the
data structure of a host signal. Prior work. Adelson describes a method of data hiding that
exploits the human visual system's varying sensitivity to contrast versus spatial
frequency. Adelson substitutes high-spatial frequency image data for hidden data in a
pyramid-encoded still image. While he is able to encode a large amount of data
efficiently, there is no provision to make the data immune to detection or removal by
typical manipulations such as filtering and rescaling. Stego, one of several widely
available software packages, simply encodes data in the least-significant bit of the host
7
signal. This technique suffers from all of the same problems as Adelson's method but
creates an additional problem of degrading image or audio quality. Bender modifies
Adelson's technique by using chaos as a means to encrypt the embedded data, deterring
detection, but providing no improvement to immunity to host signal manipulation.
Lippman hides data in the chrominance channel of the National Television Standards
Committee (NTSC) television signal by exploiting the temporal over-sampling of color in
such signals. Typical of Enhanced Definition Television Systems, this method encodes a
large amount of data, but the data are lost to most recording, compression, and
transcoding processes. Other techniques, such as Hecht's Data-Glyph, which adds a bar
code to images, are engineered in light of a predetermined set of geometric modifications.
Spread-spectrum, a promising technology for data hiding, is difficult to intercept and
remove but often introduces perceivable distortion into the host signal. Problem space.
Each application of data hiding requires a different level of resistance to modification and
a different embedded data rate. These form the theoretical data-hiding problem space.
There is an inherent trade-off between bandwidth and "robustness," or the degree to
which the data are immune to attack or transformations that occur to the host signal
through normal usage, e.g., compression, resampling, etc. The more data to be hidden,
e.g., a caption for a photograph, the less secure the encoding. The less data to be hidden,
e.g., a watermark, the more secure the encoding.For the following analysis, we make the
following simplifying assumptions (these assumptions are not limiting, as is shown later):
We are operating in a 256 level, linearly quantized system starting at 0; all brightness
levels are equally likely; all samples are independent of all other samples. The Patchwork
algorithm proceeds as follows: take any two points, A and B, chosen at random in an
image. Let a equal the brightness at point A and b the brightness at point B. Now, let
S = a - b (1)
The expected value of S is 0, i.e., the average value of S after repeating this procedure a
large number of times is expected to be 0. Although the expected value is 0, this does not
tell us much about what S will be for a specific case. This is because the variance is quite
high for this procedure. The variance of S, is a measure of how tightly samples of S will
cluster around the expected value of 0. To compute this, we make the following
8
observation: Since S = a - b and a and b are assumed independent, ² can be computed as

follows (this, and all other probability equations are from Drake):
²= ²+ ² (2)
where ² for a uniform S is:
² 5418 (3)
Now, ²= ² since a and b are samples from the same set, taken with replacement.
Thus:
which yields a standard deviation 104. This means that more than half the time, S will
be greater than 43 or less than - 43. Assuming a Gaussian clustering, a single iteration
does not tell us much. However, this is not the case if we perform the procedure many
times.
Let us repeat this procedure n times, letting ai and bi be the values a and b take on during
the ith iteration, Si. Now let Sn be defined as:
The expected value of Sn is:
Sn = n × S = n × 0 = 0 (6)
This makes intuitive sense, since the number of times ai is greater than bi should be offset
by the number of times the reverse is true. Now the variance is:
9
And the standard deviation is:
Now, we can compute S10000 for a picture, and if it varies by more than a few standard
deviations, we can be fairly certain that this did not happen by chance. In fact, since as
we will show later Sn for large n has a Gaussian distribution, a deviation of even a few
s indicates to a high degree of certainty the presence of encoding.
The Patchwork method artificially modifies S for a given picture, such that Sn is many
deviations away from expected. To encode a picture, we:
1. Use a specific key for a known pseudorandom number generator to choose (ai,
bi). This is important, because the encoder needs to visit the same points during
decoding.
2. Raise the brightness in the patch ai by an amount , typically in the range of 1 to 5
parts in 256.
3. Lower the brightness in bi by this same amount (the amounts do not have to be
the same, as long as they are in opposite directions).
4. Repeat this for n steps (n typically ~10000).
Now, when decoded, Sn will be:
or:
So each step of the way we accumulate an expectation of 2 × . Thus after n repetitions,

we expect Sn to be:
10
As n or increases, the distribution of Sn shifts over to the right (Figure 3). In Figure 3, as
or n increases, the distribution of Sn shifts further to the right. If we shift it far enough,
any point that is likely to fall into one distribution is highly unlikely to be near the center
of the other distribution.
Figure 1
While this basic method works well by itself, we have made a number of modifications to
improve performance including:
1. Treating patches of several points rather than single points. This has the effect of
shifting the noise introduced by Patchwork into the lower spatial frequencies,
where it is less likely to be removed by lossy compression and typical Finite
Impulse Response (FIR) filters.
2. Making Patchwork more robust by using a combination with either affine coding
(described later) or some heuristic based upon feature recognition (e.g., alignment
using the interocular line of a face). Patchwork decoding is sensitive to affine
transformations of the host image. If the points in the picture visited during
encoding are offset by translation, rotation, or scaling before decoding, the code is
lost.
3. Taking advantage of the fact that Patchwork is fairly resistant to cropping. By
disregarding points outside of the known picture area, Patchwork degrades in
accuracy approximately as the log of the picture size. Patchwork is also resistant
to gamma and tone scale correction since values of comparable luminance move
roughly the same way under such modifications.
11
Patch shape. The shape of the patches deserves some comment. Figure 4 shows three
possible one-dimensional patch shapes, and next to them a very approximate spectrum of
what a line with these patches dropped onto it pseudorandomly would look like. In Figure
4, the patch is very small, with sharp edges. This results in the majority of the energy of
the patch being concentrated in the high frequency portion of the image spectrum. This
makes the distortion hard to see, but also makes it a likely candidate for removal by lossy
compressors. If one goes to the other extreme, as in Figure 4, the majority of the
information is contained in the low-frequency spectrum. The last choice, Figure 4 shows
a wide, sharp-edged patch, which tends to distribute the energy around the entire
frequency spectrum.
Figure 2
The optimal choice of patch shape is dependent upon the expected image modifications.
If JPEG (Joint Photographic Experts Group) encoding is likely, then a patch that places
its energy in the low frequencies is preferable. If contrast enhancement is to be done,
placing energy in higher frequencies would be better. If the potential image modifications
are unknown, then spreading the patch energy across the spectrum would make sense.
The arrangement of patches has an impact on patch visibility. For illustration, three
possibilities are considered (Figure 5). The simplest method is shown in Figure 5, a
simple rectilinear lattice. While simple, this arrangement is often a poor choice if a high n
is to be used. As the grid is filled in, continuous edges of gradient are formed. The HVS
is very sensitive to such edges. A second choice, Figure 5B breaks this symmetry by
using hexagons for the patch shape. A preferred solution, shown in Figure 5C, is a
completely random placement of patches. An intelligent selection of patch shape in both
12
the horizontal and vertical dimensions will enhance the effectiveness of patchwork for a
given picture.
Figure 3
Uniformity. A simplifying assumption of a uniform luminance histogram was made

above, but this is not a requirement of Patchwork. The only assumption Patchwork makes
is that the expected value of Si = ai -bi is zero.
It can be shown that this condition is always met through the following argument:
1. Let ar be the time reversed series of a.

2. Ar = A* by definition (A* is the complex conjugate of A).
3. F(a*ar) = AA* (F is the Fourier transform).
4. AA* is everywhere real by definition of the complex conjugate.
5. F-1(AA*) is even by definition.
6. Even sequences are symmetric around zero by definition.
An image histogram (Figure 6, top) is a somewhat random distribution. The result of

taking the complex conjugate (Figure 6, bottom) is symmetric around zero.
Figure 4
13
Variance. When searching through a large number of images with data embedded using
the Patchwork method, such as when a robot is looking for copyright violations on the
Internet World Wide Web (WWW), the use of a generic estimation of variance is
desirable. This avoids the necessity of calculating the variance of every image. Suspect
images can then be examined thoroughly.
When, in the analysis above, the number of points needed in Equation 3 was computed,
the variance of the luminance was assumed to be 5418. This assumption turns out to be
higher than the average observed values (see Figure 7). The question is, then, what value
should be used.
Figure 5
An examination of the variance of 365 Associated Press photos from March 1996 yielded
an average value of 3877.4 and a distribution that can be seen in Figure 7. While some
pictures do have variances as high as two-thirds of the maximum, most are clustered
around the lower variance values. Thus, 5418, the estimate derived from the uniformity
assumption, is a conservative but reasonable value to use for a generic picture.
A minimum value is that for a solid color picture (Figure 8). This has a variance of 0, a
standard deviation of 0, and thus works very well for Patchwork, since any modification
is evident. The other extreme is that of a two-color, black and white picture. For these,
the variance is:
14
Figure 6
These two values, 0 and 16256, define the extremes of the variance to consider when
calculating the likelihood that a picture is encoded. What is the correct assumption to use
for a given picture? The actual variance of the picture being examined is a sensible
choice, since in most cases Patchwork will increase the variance only slightly. (This
depends on the size and depth of the patch, the number of patches, and the histogram of
the original image.) However, if a large number of pictures are to examined, a generic
value is a practical choice.
There are several limitations inherent to the Patchwork technique. The first is the
extremely low embedded data rate it yields, usually a one-bit signature per image. This
limits its usefulness to low bit-rate applications such as the digital watermark. Second, it
is necessary to register where the pixels in the image lie. While a number of methods
have been investigated, it is still somewhat difficult to decode the image in the presence
of severe affine transformations. These disadvantages aside, without the key for the
pseudorandom number generator, it is extremely difficult to remove the Patchwork
coding without degrading the picture beyond recognition.
The Patchwork method is subject to cryptographic attack if it is used to encode a large

number of identically sized images using the same key. If the images are averaged
together, the patches will show up as lighter or darker than average regions. This
weakness is a common one in cryptography, and points to the truism that for a static key,
as the amount of traffic increases, it becomes easier to "crack" the encryption. One
solution is to use multiple pseudorandom patterns for the patches. Even the use of just
two keys, while increasing decoding time, will make Patchwork much more robust to
attack. Another solution is to use the same pattern, but to reverse the polarity of the
patches. Both solutions deter cryptographic attack by averaging.
15
Texture Block Coding: A visual approach
A second method for low bit-rate data hiding in images is Texture Block Coding. This
method hides data within the continuous random texture patterns of a picture. The
Texture Block Coding technique is implemented by copying a region from a random
texture pattern found in a picture to an area that has similar texture. This results in a pair
of identically textured regions in the image (see Figure 9).
These regions can be detected as follows:
1. Autocorrelate the image with itself. This will produce peaks at every point in the
autocorrelation where identical regions of the image overlap. If large enough
areas of an image are copied, this will produce an additional large autocorrelation
peak at the correct alignment for decoding.
2. Shift the image as indicated by the peaks in Step 1. Now subtract the image from
its shifted copy, padding the edges with zeros as needed.
3. Square the result and threshold it to recover only those values quite close to zero.
The copied region will be visible as these values.
Since the two regions are identical, they are modified in the same way if the picture is
uniformly transformed. By making the regions reasonably large, the inner part of the
block changes identically under most nongeometric transformations. In our experiments,
coded 16 × 16 pixel blocks can be decoded when the picture is subjected to a
combination of filtering, compression, and rotation.
Texture Block Coding is not without its disadvantages. Currently it requires a human
operator to choose the source and destination regions, and to evaluate the visual impact of
the modifications on the image. It should be possible to automate this process by
allowing a computer to identify possible texture regions in the image to copy from and
paste to. However, this technique will not work on images that lack moderately large
areas of continuous texture from which to draw.
16
Future research in this area includes the possibility of cutting and pasting blocks from
only part of the image frequency spectrum (this would allow less noticeable blocks to be
moved around, and a final encoding that is considerably more robust to various image
compression algorithms) along with automatic texture region selection and analysis of
perceivability of the final result.
High bit-rate coding
High bit-rate methods can be designed to have minimal impact upon the perception of the
host signal, but they do not tend to be immune to image modifications. In return, there is
an expectation that a relatively large amount of data are able to be encoded. The most
common form of high bit-rate encoding is the replacement of the least significant
luminance bit of image data with the embedded data. Other techniques include the
introduction of high-frequency, low-amplitude noise and the use of direct sequence
spread spectrum coding. All high bit-rate methods can be made more robust through the
use of error-correction coding, at the expense of data rate. High bit-rate codes are only
appropriate where it is reasonable to expect that a great deal of control will be maintained
over the images.
Individually, none of the known techniques for data hiding are resistant to all possible
transforms or combinations of transforms. In combination, often one technique can
supplement another. Supplementary techniques are particularly important for recovery
from geometric modifications such as affine transformations, and maintaining
synchronization for spread-spectrum encoding.
Affine coding. Some of the data-hiding techniques, such as Patchwork, are vulnerable to
affine transforms. It makes sense to develop methods that can be used to facilitate the
recovery of embedded data after affine application. Affine coding is one such method: A
predefined reference pattern is embedded into a host image using any of the high bit-rate
coding techniques. Estimation of geometric transformation of the image is achieved by
comparing the original shape, size, and orientation of the reference pattern to that found
in the transformed image. Since affine transforms are linear, the inverse transform can be
17
applied to recover the original image. Once this is done, the image is ready for further
extraction of embedded data.
Placing data in images is useful in a variety of applications. We highlight below four

applications that differ in the quantity of data to be embedded and the type of transforms
to which the data are likely to be subjected.
Digital watermark. The objective of a digital watermark is to place an indelible mark on

an image. Usually, this means encoding only a handful of bits, sometimes as few as one.
This "signature" could be used as a means of tracing the distribution of images for an on-
line news service and for photographers who are selling their work for digital publication.
One could build a digital camera that places a watermark on every photograph it takes.
Theoretically, this would allow photographers to employ a "web-searching agent" to
locate sites where their photographs appear. It can be expected that if information about
legal ownership is to be included in an image, it is likely that someone might want to
remove it. A requirement of a digital watermark is that it must be difficult to remove.
Both the Patchwork and Texture Block Coding techniques show promise as digital
watermarks. Patchwork, being the more secure of the two, answers the question "Is this
my picture?" Texture Block Coding, which can be made readily accessible to the public,
answers the question "Whose picture is this?" Tamper-proofing. The objective of tamper-
proofing is to answer the question, "Has this image been modified?" Tamper-proofing
techniques are related, but distinct from the other data-hiding technologies. What
differentiates them is the degree to which information is secured from the host signal. In
Figure 7, the difference between tamper-proofing and other data-hiding techniques is
characterized. Figure 7 illustrates that data hiding requires a deep information well that is
resilient to large displacements. Figure 7 illustrates that tamper-proofing requires a
shallow well that is only resilient to small displacements, but is triggered by large
displacements. Most data-hiding techniques attempt to secure data in the face of all
modifications. Tamper-proofing techniques must be resilient to small modifications
(e.g.,croppin
g, tone-scale or gamma correction for images or balance or equalization for sounds) but
18
not to large modifications (e.g., removing or inserting people from an image or taking
words out of context in an audio recording).
Figure 7
There are several ways to implement tamper-proofing. The easiest way is to encode a
check-sum of the image within the image. However, this method is triggered by small
changes in the image. This suggests an approach involving a pattern overlaid on the
image. The key to a successful overlay is to find a pattern resilient to simple
modifications such as filtering and gamma correction, yet is not easily removed. The
search for such patterns and other methods of detecting tampering remains an active area
of research.
Feature tagging. Another application of data hiding is tagging the location of features
within an image. Using data hiding it is possible for an editor (or machine) to encode
descriptive information, such as the location and identification of features of interest,
directly into specific regions of an image. This enables retrieval of the descriptive
information wherever the image goes. Since the embedded information is spatially
located in the image, it is not removed unless the feature of interest is removed. It also
translates, scales, and rotates exactly as the feature of interest does.
This application does not have the same requirements for robustness as the digital
watermark. It can be assumed that, since feature location is providing a service, it is
unlikely someone will maliciously try to remove the encoded information.
Embedded captions. Typical news photograph captions contain one KB of data. Thus
embedded captions is a relatively high bit-rate application for data hiding. As with feature
tagging, caption data are usually not subject to malicious removal.
19
While captions are useful by themselves, they become even more useful when combined
with feature location. It is then possible for portions of the caption to directly reference
items in the picture. Captions can become self-editing once this is done. If an item
referenced in the caption is cropped out of the picture, then the reference to that item in
the caption can be removed automatically.
Spread spectrum
In a normal communication channel, it is often desirable to concentrate the information in

as narrow a region of the frequency spectrum as possible in order to conserve available
bandwidth and to reduce power. The basic spread spectrum technique, on the other hand,
is designed to encode a stream of information by spreading the encoded data across as
much of the frequency spectrum as possible. This allows the signal reception, even if
there is interference on some frequencies.
While there are many variations on spread spectrum communication, we concentrated on

Direct Sequence Spread Spectrum encoding (DSSS). The DSSS method spreads the
signal by multiplying it by a chip, a maximal length pseudorandom sequence modulated
at a known rate. Since the host signals are in discrete-time format, we can use the
sampling rate as the chip rate for coding. The result is that the most difficult problem in
DSSS receiving, that of establishing the correct start and end of the chip quanta for phase
locking purposes, is taken care of by the discrete nature of the signal. Consequently, a
much higher chip rate, and therefore a higher associated data rate, is possible. Without
this, a variety of signal locking algorithms may be used, but these are computationally
expensive.
Procedure. In DSSS, a key is needed to encode the information and the same key is
needed to decode it. The key is pseudorandom noise that ideally has flat frequency
response over the frequency range, i.e., white noise. The key is applied to the coded
information to modulate the sequence into a spread spectrum sequence.
The DSSS method is as follows: The code is multiplied by the carrier wave and the
pseudorandom noise sequence, which has a wide frequency spectrum. As a consequence,
20
the spectrum of the data is spread over the available band. Then, the spread data sequence
is attenuated and added to the original file as additive random noise (see Figure 8). DSSS
employs bi-phase shift keying since the phase of the signal alternates each time the
modulated code alternates (see Figure 9). For decoding, phase values 0 and 0 + are
interpreted as a "0" or a "1," which is a coded binary string.
Figure 8 Figure 9
In the decoding stage, the following is assumed:
1. The pseudorandom key is maximal (it has as many combinations as possible and
does not repeat for as long as possible). Consequently it has a relatively flat
frequency spectrum.
2. The key stream for the encoding is known by the receiver. Signal synchronization
is done, and the start/stop point of the spread data are known.
3. The following parameters are known by the receiver: chip rate, data rate, and
carrier frequency.
Results. Unlike phase coding, DSSS introduces additive random noise to the sound. To
keep the noise level low and inaudible, the spread code is attenuated (without adaptation)
to roughly 0.5 percent of the dynamic range of the host sound file. The combination of
simple repetition technique and error correction coding ensure the integrity of the code. A
short segment of the binary code string is concatenated and added to the host signal so
that transient noise can be reduced by averaging over the segment in the decoding stage.
The resulting data rate of the DSSS experiments is 4 bps.
Echo data hiding
Echo data hiding embeds data into a host audio signal by introducing an echo. The data
are hidden by varying three parameters of the echo: initial amplitude, decay rate, and
21
offset (see Figure 10). As the offset (or delay) between the original and the echo
decreases, the two signals blend. At a certain point, the human ear cannot distinguish
between the two signals. The echo is perceived as added resonance. (This point is hard to
determine exactly. It depends on the quality of the original recording, the type of sound
being echoed, and the listener. In general, we find that this fusion occurs around 1/1000
of a second for most sounds and most listeners.)
Figure 10
The coder uses two delay times, one to represent a binary one (offset) and another to
represent a binary zero (offset + delta). Both delay times are below the threshold at which
the human ear can resolve the echo. In addition to decreasing the delay time, we can also
ensure that the information is not perceivable by setting the initial amplitude and the
decay rate below the audible threshold of the human ear.
Encoding. The encoding process can be represented as a system that has one of two
possible system functions. In the time domain, the system functions are discrete time
exponentials (see Figure 11) differing only in the delay between impulses.
Figure 11
For simplicity, we chose an example with only two impulses (one to copy the original
signal and one to create an echo). Increasing the number of impulses is what increases the
number of echoes.
22
We let the kernel shown in Figure 12 represent the system function for encoding a binary
one and we use the system function defined in Figure 18 to encode a zero. Processing a
signal through Figures 18 will result in an encoded signal (see Figure 13).
Figure 12 Figure 13
The delay ( b) between the original signal and the echo is dependent on which kernel or
system function we use in Figure 13. The "one" kernel (Figure 12) is created with a delay
of ( 1) seconds while the "zero" kernel (Figure 12) has a ( 0) second delay.
In order to encode more than one bit, the original signal is divided into smaller portions.
Each individual portion can then be echoed with the desired bit by considering each as an
independent signal. The final encoded signal (containing several bits) is the
recombination of all independently encoded signal portions.
In Figure 14, the example signal has been divided into seven equal portions labeled a, b,
c, d, e, f, and g. We want portions a, c, d, and g to contain a one. Therefore, we use the
"one" kernel (Figure 18) as the system function for each of these portions. Each portion is
individually convolved with the system function. The zeros encoded into sections b, e,
and f are encoded in a similar manner using the "zero" kernel (Figure 18). Once each
section has been individually convolved with the appropriate system function, the results
are recombined. To achieve a less noticeable mix, we create a "one" echo signal by
echoing the original signal using the "one" kernel. The "zero" kernel is used to create the
"zero" echo signal. The resulting signals are shown in Figure 15.
Figure 14 Figure 15
The "one" echo signal and the "zero" echo signal contain only ones and zeros,
respectively. In order to combine the two signals, two mixer signals (see Figure 16) are
23
created. The mixer signals are either one or zero depending on the bit we would like to
hide in that portion of the original signal.
Figure 16
The "one" mixer signal is multiplied by the "one" echo signal while the "zero" mixer
signal is multiplied by "zero" echo signal. In other words, the echo signals are scaled by
either 1 or 0 throughout the signal depending on what bit any particular portion is
supposed to contain. Then the two results are added. Note that the "zero" mixer signal is
the complement of the "one" mixer signal and that the transitions within each signal are
ramps. The sum of the two mixer signals is always one. This gives us a smooth transition
between portions encoded with different bits and prevents abrupt changes in the
resonance of the final (mixed) signal.
A block diagram representing the entire encoding process is illustrated in Figure 17.
Figure 17
Decoding. Information is embedded into a signal by echoing the original signal with one
of two delay kernels. A binary one is represented by an echo kernel with a ( 1) second
delay. A binary zero is represented by a ( 0) second delay. Extraction of the embedded
information involves the detection of spacing between the echoes. In order to do this, we
examine the magnitude (at two locations) of the autocorrelation of the encoded signal's
cepstrum:
24
The following procedure is an example of the decoding process. We begin with a sample
signal that is a series of impulses such that the impulses are separated by a set interval
and have exponentially decaying amplitudes. The signal is zero elsewhere (see Figure
18).
Figure 18
The next step is to find the cepstrum of the echoed version. The result of taking the
cepstrum makes the spacing between the echo and the original signal a little clearer.
Unfortunately, the result of the cepstrum also duplicates the echo every ( ) seconds. In
Figure 18, this is illustrated by the impulse train in the output. Furthermore, the
magnitude of the impulses representing the echoes are small relative to the original
signal. As such, they are difficult to detect. The solution to this problem is to take the
autocorrelation of the cepstrum.
Figure 19
We echo the signal once with delay ( ) using the kernel depicted in Figure 20. The result
is illustrated in Figure 21.
25
Figure 20 Figure 21
Only the first impulse is significantly amplified as it is reinforced by subsequent

impulses. Therefore, we get a spike in the position of the first impulse. Like the first
impulse, the spike is either ( 1) or ( 0) seconds after the original signal. The remainder
of the impulses approach zero. Conveniently, random noise suffers the same fate as all
the impulses after the first.
The rule for deciding on a one or a zero is based on the time delay between the original
signal and the delay ( ) before the spike in the autocorrelation. Recall that a one was
encoded by placing an echo ( 1) seconds after the original and a zero was placed ( 0)
seconds after the original. When decoding, we assign a one if the magnitude of the
autocorrelation function is greater at ( 1) seconds than it is at ( 0) seconds. A zero is
assigned if the reverse is true. This is the same as deciding which kernel we used utilizing
the fact that the "one" and "zero" kernel differ only in the delay before the echo (Figure
18).
Results. Using the methods described, it is indeed possible to encode and decode
information in the form of binary digits into a media stream with minimal alteration to
the original signal at approximately 16 bps (see Figure 28). By minimal alteration, we
mean that the output of the encoding process is changed in such a way so that the average
human cannot hear any significant difference between the altered and the original signal.
There is little, if any, degradation of the original signal. Instead, the addition of resonance
simply gives the signal a slightly richer sound. While the addition of resonance may be
problematic in some music applications, studio engineers may be able to fine-tune the
echo hiding parameters during the mastering process, enabling its use.
26
Figure 22
Supplemental techniques
Three supplemental techniques are discussed next.
Adaptive data attenuation. The optimum attenuation factor varies as the noise level of the
host sound changes. By adapting the attenuation to the short-term changes of the sound or
noise level, we can keep the coded noise extremely low during the silent segments and
increase the coded noise during the noisy segments. In our experiments, the quantized
magnitude envelope of the host sound wave is used as a reference value for the adaptive
attenuation; and the maximum noise level is set to 2 percent of the dynamic range of the
host signal.
Redundancy and error correction coding. In order to compensate for errors due to channel
noise and host signal modification, it is useful to apply error-correction coding (ECC)1 to
the data to be embedded. While there exist some efficient methods of ECC, its
application always results in a trade-off between robustness and data rate.
Sound context analysis. The detectability of white noise inserted into a host audio signal
is linearly dependent upon the original noise level of the host signal. To maximize the
quantity of embedded data, while ensuring the data are unnoticed, it is useful to express
the noise level quantitatively. The noise level is characterized by computing the
magnitude of change in adjacent samples of the host signal:
27
where N is the number of sample points in the sequence and Smax is the maximum
magnitude in the sequence. We use this measure to categorize host audio signals by noise
level
Data hiding in Text
Soft-copy text is in many ways the most difficult place to hide data. (Hard-copy text can
be treated as a highly structured image and is readily amenable to a variety of techniques
such as slight variations in letter forms, kerning, baseline, etc.) This is due largely to the
relative lack of redundant information in a text file as compared with a picture or a sound
bite. While it is often possible to make imperceptible modifications to a picture, even an
extra letter or period in text may be noticed by a casual reader. Data hiding in text is an
exercise in the discovery of modifications that are not noticed by readers. We considered
three major methods of encoding data: open space methods that encode through
manipulation of white space (unused space on the printed page), syntactic methods that
utilize punctuation, and semantic methods that encode using manipulation of the words
themselves.
Open space methods. There are two reasons why the manipulation of white space in
particular yields useful results. First, changing the number of trailing spaces has little
chance of changing the meaning of a phrase or sentence. Second, a casual reader is
unlikely to take notice of slight modifications to white space. We describe three methods
of using white space to encode data. The methods exploit inter-sentence spacing, end-of-
line spaces, and inter-word spacing in justified text.
The first method encodes a binary message into a text by placing either one or two spaces
after each terminating character, e.g., a period for English prose, a semicolon for C-code,
etc. A single space encodes a "0," while two spaces encode a "1." This method has a
number of inherent problems. It is inefficient, requiring a great deal of text to encode a
28
very few bits. (One bit per sentence equates to a data rate of approximately one bit per
160 bytes assuming sentences are on average two 80-character lines of text.) Its ability to
encode depends on the structure of the text. (Some text, such as free-verse poetry, lacks
consistent or well-defined termination characters.) Many word processors automatically
set the number of spaces after periods to one or two characters. Finally, inconsistent use
of white space is not transparent.
A second method of exploiting white space to encode data is to insert spaces at the end of
lines. The data are encoded allowing for a predetermined number of spaces at the end of
each line (see Figure 29). Two spaces encode one bit per line, four encode two, eight
encode three, etc., dramatically increasing the amount of information we can encode over
the previous method. In Figure 23, the text has been selectively justified, and has then
had spaces added to the end of lines to encode more data. Rules have been added to
reveal the white space at the end of lines. Additional advantages of this method are that it
can be done with any text, and it will go unnoticed by readers, since this additional white
space is peripheral to the text. As with the previous method, some programs, e.g.,
"sendmail," may inadvertently remove the extra space characters. A problem unique to
this method is that the hidden data cannot be retrieved from hard copy.
Figure 23
A third method of using white space to encode data involves right-justification of text.
Data are encoded by controlling where the extra spaces are placed. One space between
words is interpreted as a "0." Two spaces are interpreted as a "1." This method results in
several bits encoded on each line (see Figure 30). Because of constraints upon
justification, not every inter-word space can be used as data. In order to determine which
of the inter-word spaces represent hidden data bits and which are part of the original text,
we have employed a Manchester-like encoding method. Manchester encoding groups bits
in sets of two, interpreting "01" as a "1" and "10" as a "0." The bit strings "00" and "11"
29
are null. For example, the encoded message "1000101101" is reduced to "001," while
"110011" is a null string.
Figure 30
Open space methods are useful as long as the text remains in an ASCII (American
Standard Character Interchange) format. As mentioned above, some data may be lost
when the text is printed. Printed documents present opportunities for data hiding far
beyond the capability of an ASCII text file. Data hiding in hard copy is accomplished by
making slight variations in word and letter spacing, changes to the baseline position of
letters or punctuation, changes to the letter forms themselves, etc. Also, image data-
hiding techniques such as those used by Patchwork can be modified to work with printed
text.
Syntactic methods. That white space is considered arbitrary is both its strength and its
weakness where data hiding is concerned. While the reader may not notice its
manipulation, a word processor may inadvertently change the number of spaces,
destroying the hidden data. Robustness, in light of document reformatting, is one reason
to look for other methods of data hiding in text. In addition, the use of syntactic and
semantic methods generally does not interfere with the open space methods. These
methods can be applied in parallel.
There are many circumstances where punctuation is ambiguous or when mispunctuation

has low impact on the meaning of the text. For example, the phrases "bread, butter, and
milk" and "bread, butter and milk" are both considered correct usage of commas in a list.
We can exploit the fact that the choice of form is arbitrary. Alternation between forms
can represent binary data, e.g., anytime the first phrase structure (characterized by a
comma appearing before the "and") occurs, a "1" is inferred, and anytime the second
phrase structure is found, a "0" is inferred. Other examples include the controlled use of
contractions and abbreviations. While written English affords numerous cases for the
30
application of syntactic data hiding, these situations occur infrequently in typical prose.
The expected data rate of these methods is on the order of only several bits per kilobyte
of text.
Although many of the rules of punctuation are ambiguous or redundant, inconsistent use
of punctuation is noticeable to even casual readers. Finally, there are cases where
changing the punctuation will impact the clarity, or even meaning, of the text
considerably. This method should be used with caution.
Syntactic methods include changing the diction and structure of text without significantly
altering meaning or tone. For example, the sentence "Before the night is over, I will have
finished" could be stated "I will have finished before the night is over." These methods
are more transparent than the punctuation methods, but the opportunity to exploit them is
limited.
Semantic methods. A final category of data hiding in text involves changing the words
themselves. Semantic methods are similar to the syntactic method. Rather than encoding
binary data by exploiting ambiguity of form, these methods assign two synonyms
primary or secondary value. For example, the word "big" could be considered primary
and "large" secondary. Whether a word has primary or secondary value bears no
relevance to how often it will be used, but, when decoding, primary words will be read as
ones, secondary words as zeros.
Word webs such as WordNet can be used to automatically generate synonym tables.
Where there are many synonyms, more than one bit can be encoded per substitution. (The
choice between "propensity," "predilection," "penchant," and "proclivity" represents two
bits of data.) Problems occur when the nuances of meaning interfere with the desire to
encode data. For example, there is a problem with choice of the synonym pair "cool" and
"chilly." Calling someone "cool" has very different connotations than calling them
"chilly." The sentence "The students in line for registration are spaced-out" is also
ambiguous.
31
Applications
Data hidden in text has a variety of applications, including copyright verification,

authentication, and annotation. Making copyright information inseparable from the text is
one way for publishers to protect their products in an era of increasing electronic
distribution. Annotation can be used for tamper protection. For example, if a
cryptographic hash of the paper is encoded into the paper, it is a simple matter to
determine whether or not the file has been changed. Verification is among the tasks that
could easily be performed by a server which, in this case, would return the judgment
"authentic" or "unauthentic" as appropriate.
Other uses of data hiding in text involve embedding instructions for an autonomous
program in a text. For example, a mail server can be programmed to check for hidden
messages when transmitting an electronic message. The message is rejected or approved
depending on whether or not any hidden data are found. In this way a company running
its own mail server can keep confidential documents from being inadvertently exported.
Conclusion
In this paper, several techniques are discussed as possible methods for embedding data in
host text, image, and audio signals. While we have had some degree of success, all of the
proposed methods have limitations. The goal of achieving protection of large amounts of
embedded data against intentional attempts at removal may be unobtainable.
Automatic detection of geometric and nongeometric modifications applied to the host

signal after data hiding is a key data-hiding technology. The optimum trade-offs between
bit rate, robustness, and perceivability need to be defined experimentally. The interaction
between various data-hiding technologies needs to be better understood.
While compression of image and audio content continues to reduce the necessary
bandwidth associated with image and audio content, the need for a better contextual
description of that content is increasing. Despite its current shortcomings, data-hiding
technology is important as a carrier of these descriptions.
32
2.1 Existing System:
1. Petrovic, R.Winograd,”Data hiding within audio signals”, 1999.
This paper presents the general principles of steganography, basic

terminology, and an overview of applications and techniques. In particular we will
consider data hiding within audio signals, the basic requirements and the state of
the art techniques. We propose a novel technique, short-term autocorrelation
modulation, with several variations. The proposed method is characterized by perfect
transparency, robustness, high bit rate, low processing load, and, particularly,
high security.
2. Jamil, T. “Steganography: the art of hiding information in plain sight”,

Feb/Mar 1999
Steganography is the art (as well as the science) of communicating in a hidden way. It
is referred to as “transmission security” or TRANSEC in military literature. Its goal is
to hide messages inside other “harmless” messages in such a way that an “enemy”
would not even know a second secret message was present. The history of
steganography is discussed as is the design principle of steganographic systems.
3. Chandramouli, R. Memon, “Analysis of LSB based image steganography

techniques”, 2001
4. There have been many techniques for hiding messages in images in such a
manner that the alterations made to the image are perceptually indiscernible.
However, the question whether they result in images that are statistically
indistinguishable from unhampered images has not been adequately explored.
We look at some specific image based steganography techniques and show that an
observer can indeed distinguish between images carrying a hidden message and
images which do not carry a message. We derive a closed form expression of the
probability of detection and false alarm in terms of the number of bits that are
hidden. This leads us to the notion of steganographic capacity, that is, how many
bits can we hide in a message without causing statistically significant
33
modifications? Our results are able to provide an upper bound on the capacity.
Our ongoing work relates to adaptive steganographic techniques that take explicit
steps to foil the detection mechanisms.
4. Amin, M.M. Salleh,” Information hiding using steganography”, 2003.
Due to advances in ICT, most information is kept electronically. Consequently, the

security of information has become a fundamental issue. Besides cryptography,
steganography can be employed to secure information. Steganography is a technique
of hiding information in digital media. In contrast to cryptography, the message or
encrypted message is embedded in a digital host before passing it through the
network, thus the existence of the message is unknown. Besides hiding data for
confidentiality, this approach of information hiding can be extended to copyright
protection for digital media: audio, video, and images.
34
CHAPTER 3. ANALYSIS
Fact finding techniques refer to the ways in which a software team discovers the various
facts required for the development of the Steganography project. There are four
techniques namely,
3.1. Questionnaire
3.2. Record Review
3.3. Customer Interviews
3.4. On-sight Observation
The fact finding techniques followed for Steganography project are Customer Interviews,
and Questionnaires. We were provided with some brief presentations regarding the
present conditions at user premises. Significant information about the current situation
was derived from these presentations.
 INTERVIEWS
Information about the required software was collected using the Customer
Interviews. The user of the software was enquired about the features which he
might want to include in the software. Thus, a major part of the analysis was
carried out successfully by following these fact finding techniques.
 QUESTIONNAIRES
Based on the system concept developed, a set of questionnaire was developed to
eliminate all possible doubts regarding the requirements of the customer and
development of the system. It is important to get answers to some important
questions before we proceed with the actual detailed design process. The
questionnaires consist of mostly those questions, which were not answered clearly
in the problem statement and some important facts and figures that are required to
be considered while system development process.
35
Sample Questionnaires
o Are there any limitations bounding the system?
Yes No
o What is the main use of the system?
Internal Commercial
o What is the number of users(concurrent/Independent) of the system?
10 >10
o Is there any recommended tool to be used for software development?

Yes No
o Who all are the end users of the system?
o What is the recommended front-end?
o What is the recommended back-end?
o What is the time limit for development of the system?
o Is there any recommended format of User Interface?
o Is there any existing system working in the organization for the same
purpose?
36
o What are the Hardware Specifications of the machines on which the

system will work?
o What are the Software Specifications on which the system will be

installed?
o How many machines are available for running the system?
37
CHAPTER 4. DESIGN
4.1 Introduction
The system design is the most creative and challenging phase of the system development
life cycle. It is an approach for the creation of the proposed system, which still helps the
system coding. It provides the understanding and procedural details necessary for
implementing the system. A number of subsystems are to be identified which constitutes
the whole system. In this phase the data organization is to be discussed, in which the
output formats are to be designed. The system design is composed of several steps.
Here the emphasis is on translating the performance requirements in to the design
specification. Steganography system requires any type of image file and the information
or message that is to be hidden. It has two modules encrypt and decrypt. Microsoft .Net
framework prepares a huge amount of tool and options for programmers that they simples
programming.
One of .Net tools for pictures and images is auto-converting most types of pictures to
BMP format. I used this tool in this software called “Steganography” that is written in
C#.Net language and you can use this software to hide your information in any type of
pictures without any converting its format to BMP (software converts inside it).
The algorithm used for Encryption and Decryption in this application provides using
several layers lieu of using only LSB layer of image. Writing data starts from last layer
(8st or LSB layer); because significant of this layer is least and every upper layer has
doubled significant from its down layer. So every step we go to upper layer image quality
decreases and image retouching transpires.
The encrypt module is used to hide information into the image; no one can see that
information or file. This module requires any type of image and message and gives the
only one image file in destination.
38
The decrypt module is used to get the hidden information in an image file. It take the
image file as an output, and give two file at destination folder, one is the same image file
and another is the message file that is hidden it that.
Before encrypting file inside image we must save name and size of file in a definite place
of image. We could save file name before file information in LSB layer and save file size
and file name size in most right-down pixels of image. Writing this information is needed
to retrieve file from encrypted image in decryption state.
The graphical representation of this system is as follows:
Start Application
Encryption Decryption
Image Message Image file

file
BMP image file
39
4.2 Data Flow Diagram
LEVEL O
User Data Encryption & Image Steganograped
Steganography Image file
Steganograped
DeStegnographed / User Data
Iamge file
Decryption
Fig: 4.2 Level 0 DFD
LEVEL 1
Secret Key
Secret Key
Encryption Steganography
User Data
Secret Key Secret Key

File
Plain text
DeCryption DeSteganography
Fig 4.3 Level 1 DFD
The level 0 of DFD specifies the user data that is encrypted and then the cipher text is
hiding into the image file using steganography. The output obtained is steganographed
40
audio file. Using steganographic algorithm the encrypted text is separated from the image
file. Using decryption the cipher text is converted to user data.
The level 1 of DFD specifies the user data which is encrypted using secret key and then
the cipher text is hiding into the image file using steganography with the help of secret
key. Thus the image file with encrypted data is stored in a file. The image file is
steganographed with the help of secret key. Thus the encrypted text is separated from
image file. Using decryption cipher text is converted to plain text using secret key.
CHAPTER 5. IMPLEMENTATION
Implementation is one of the most important tasks in project implementation is the phase,
in which one has to be cautious, because all the efforts undertaken during the project will
be fruitful only if the software is properly implemented according to the plans made.
The implementation phase is less creative than system design. It is primarily concerned
with user-training, site preparation and file-sites, the tests of the network along with the
systems are also included under implementation.
Depending on the nature of the systems extensive user training may be required.
Programming is itself a design works. The initial parameters of the management
information systems should be modified as a result of programming efforts. Programming
provides a real test for the assumption made by the analyst.
System testing checks the readiness and accuracy of the system to access, update and
retrieve data from the new files. Once the programs become available the test data are
read into the computer and processed. In most conventions parallel run was conducted to
establish the efficiency of the system.
Implementation is used here to mean the process of converting a new or revised system in
to an operational one. Conversion is one aspect of one implementation.
There are two types of Implementation
41
 Implementation of a computer system to replace a manual one.

 Implementation of a new computer system to replace an existing one.
The methodology is basically your approach to solve the problem. This deals with the
process model used. A process model for software engineering is chosen based on the
nature of project and application, the methods and tools to be used, and the controls and
deliverables that are required. Hence looking at the objectives and goals of the system,
we have chosen spiral model for it.
5.1 Spiral Model:

The spiral model is a software development process combining elements of both
design and prototyping-in-stages, in an effort to combine advantages of top-down
and bottom-up concepts. Also known as the spiral lifecycle model (or spiral
development), it is a system’s development method (SDM) used in information
technology (IT). This model of development combines the features of the
prototyping model and the waterfall model. The spiral model is intended for large,
expensive and complicated projects.
 ADVANTAGES:
1. Estimates (i.e. budget, schedule, etc.) become more realistic as work
progresses, because important issues are discovered earlier.
2. It is more able to cope with the (nearly inevitable) changes that software
development generally entails.
3. Software engineers (who can get restless with protracted design processes) can
get their hands in and start working on a project earlier.
 DISADVANTAGES:
1.Highly customized limiting re-usability
2.Applied differently for each application
3. Risk of not meeting budget or schedule
42
This model includes the following steps in the course of software development:
[SPIRAL MODEL]
43
5.1.1 Phases of Spiral Model:
5.1.1.1 Planning Phase:

 The planning phase establishes a bird's eye view of the intended software product
and uses this to establish the basic project structure, evaluate feasibility and risks
associated with the project, and describe appropriate management and technical
approaches. The outputs of the project planning phase are the configuration
management plan, the quality assurance plan, and the project plan and schedule,
with a detailed listing of scheduled activities for the upcoming Requirements
stage, and high-level estimates of effort for the out stages.
 The requirements gathering process takes as its input the goals identified in the
high-level requirements section of the project plan. Each goal will be refined into
a set of one or more requirements. These requirements define the major functions
of the intended application, define operational data areas and reference data areas,
and define the initial data entities.
Major functions include critical processes to be managed, as well as mission
critical inputs, outputs and reports. A user class hierarchy is developed and
associated with these major functions, data areas, and data entities. Each of these
definitions is termed a Requirement. Requirements are identified by unique
requirement identifiers and, at minimum, contain a requirement title and textual
description.
5.1.1.2 Risk Analysis Phase:

This phase is the most important part of "Spiral Model". In this phase all possible
(and available) alternatives, which can help in developing a cost effective project
are analyzed and strategies are decided to use them. This phase has been added
specially in order to identify and resolve all the possible risks in the project
development. If risks indicate any kind of uncertainty in requirements,
prototyping may be used to proceed with the available data and find out possible
solution in order to deal with the potential changes in the requirements.
44
5.1.1.3 Engineering Phase:

This phase which includes development stage takes as its primary input the design
elements described in the approved design document. For each design element, a
set of one or more software artifacts will be produced. Software artifacts include
but are not limited to menus, dialogs, data management forms, data reporting
formats, and specialized procedures and functions. Appropriate test cases will be
developed for each set of functionally related software artifacts, and an online
help system will be developed to guide users in their interactions with the
software.
5.1.1.4 Customer Evaluation Phase:

 During the construction phase the software artifacts, online help, and test data are
migrated from the development environment to a separate test environment. At
this point, all test cases are run to verify the correctness and completeness of the
software. Successful execution of the test suite confirms a robust and complete
migration capability. During this stage, reference data is finalized for production
use and production users are identified and linked to their appropriate roles. The
final reference data (or links to reference data source files) and production user
list are compiled into the Production Initiation Plan.
 During the deployment phase, the software artifacts, online help, and initial
production data are loaded onto the production server. At this point, all test cases
are run to verify the correctness and completeness of the software. Successful
execution of the test suite is a prerequisite to acceptance of the software by the
customer. After customer personnel have verified that the initial production data
load is correct and the test suite has been executed with satisfactory results, the
customer formally accepts the delivery of the software.
45
 The customer evaluation phase - to obtain customer feedback based on the

evaluation of the software representation created during the engineering stage and
implemented during the install stage. This can help in identifying and resolving
potential problems/errors in the software developed. This phase is very much
similar to testing phase.
5.1.2 Nature of Spiral Model:
There are four phases in the "Spiral Model" as discussed above. These four phases are
iteratively followed one after other in order to eliminate all the problems, which were
faced in "The Waterfall Model". Iterating the phases helps in understanding the problems
associated with a phase and dealing with those problems when the same phase is repeated
next time, planning and developing strategies to be followed while iterating through the
phases. The process progresses in spiral sense to indicate iterative path followed,
progressively more complete software is built as we go on iterating through all four
phases. The first iteration in this model is considered to be most important, as in the first
iteration almost all possible risk factors, constraints, requirements are identified
Planning
Planning is very important in every aspect of development work. Software project plan
indicated scope of the project, milestones and deliverables, project estimates, resource
allocation, risk management, scheduling techniques and quality control and standard.
Software project plan can be viewed as the following:
User Interfaces
The use of Textbox and File and Folder browsing component for accepting input data.
The input data are then used for processing the files.
Hardware Interfaces
Large amount of binary data are processed in system; hence processor having free space
will be useful for faster storage and retrieval of data. Here we have used 3.6 GHz P4
processor, which will have an additional support for our software.
46
Software Interfaces
This software is operated in a WINDOWS XP environment. This will help for firewall
security provisions if the software is used along with internet connection.
Cost of Implementation
This project can be implemented in the organization in one to two weeks. The cost of
this project is derived from effort, hardware cost, travel expenses, training cost,
telecommunication costs etc.
Effort:
It includes the total number of manpower per months. As this project is completely
computerized hence less number of manpower will be used to successfully run this
project. At least 2-3 persons will be enough to maintain this project.
Hardware cost:
It includes 2 INTEL P4 Standalone Computers. Cost around 60,000.
Training Cost:
One Software personnel will be allotted for providing training to the manpower allotted
Project duration:
It will take complete 2 months for completion. After that it will take another 2-3 weeks
for implementation and testing. Another 1-2 weeks is kept in hand for any inconvenience.
47
With respect to the customer:

Weekly or timely meetings will be scheduled with the customers for getting time to time
feedback. These meetings will be accompanied with presentation reports. After getting
feedback further modifications and developments will be done.
5.2 Scheduling
Scheduling of a project can be correlated to prioritizing various jobs with respect to their
cost, time and duration. Scheduling can be done with resource constraint or time
constraint in mind.
Steganography
Testing
Requirement Analysis
Maintenance
Coding
Problem
System testing
Definition
Unit
Requirement Design
Planning testing
specification
and Integration testing
scheduling
g Data Design Modular
design
S/w and h/w
requirement
48
5.2.1 Gantt chart:
PHASE TIME REQUIRED(IN weeks)
WK1 WK2 WK3 WK4 WK5 WK6
Requirement
Gathering
Requirement
Analysis
Design
Coding
Testing
Implementation
49
5.2.2 PERT chart:
Req.Gathering Analysis Design
01 Feb – 08 Feb 08 Feb-15 Feb 15 Feb-25 Feb

Wk 1 Wk2 Wk3+4days
Coding
25 Feb – 03 Mar
Wk 4
Testing
03 Mar –13Mar
Wk5+4days
Implementation
13 Mar–20Mar
Wk6
50
CHAPTER 6. TESTING
Testing is the process of evaluating a system by manual or automatic means to verify that
it satisfies the specified requirements or to identify differences between the actual and
expected results. During system testing, the system is used experimentally to ensure that
the software does not fail. Special test data are input for processing and the results are
examined. If the program fails to behave as expected, then the conditions under which
such a failure occurs are noted for debugging and correction. Program testing represents
the logical elements of the system. The testing ultimately leads to suffice the quality
factors such as correctness, reliability, efficiency, usability, maintainability, portability,
accuracy, error tolerance and expandability.
6.1 Different Types of Testing
Test strategies:
For testing software, various test strategies can be used such as Unit Testing, Integration
Testing, Black-box Testing, White-box Testing, Regression Testing, and Acceptance
Testing etc.
Unit Testing:
Unit test focuses verification effort on the smallest unit of software design, the software
components or modules. By testing in this method we should be very clear of the bugs
occurred. The module interface is tested to ensure that information property flows into and
out of the program under test.
Integration Testing:
Integration testing is a systematic technique for constructing the program structure while at
the same time conducting tests to uncover errors associated with interfacing. The objective
is to take unit tested components and build a program structure that has been dedicated by
design.
51
Black-box Testing:
Black box testing alludes to test that are conducted at the software interface. Although they
are designed to uncover errors, black-box tests are used to demonstrate that software
functions are operational, that input is properly accepted and the output is correctly
produced. A black-box test examines some fundamental aspect of a system with title regard
for the internal logical structure of the software.
White box testing is predicated on close examination of procedural detail. Logical paths
through software are tested by providing test cases that exercise specific set of conditions
and loops.
Regression Testing:
Regression testing involves executing old test cases to test that no new errors have been
introduced. This testing is performed when some changes are made to an existing system.
The modified system needs to be tested to make sure that the new features to be added to
work.
Acceptance Testing:
Acceptance testing involves planning and execution of functional tests, performance test to
verify that implemented system satisfies its requirements. Acceptance tests are typically
performed by the quality assurance and customer organization.
Test Scope
The scope of the user acceptance testing covers:
 Version 1 of the Steganography System

 Fnctionality defined by a set of use cases
The aim of the testing is to determine how well the application meets its functional
requirements from the perspective of the user, and to identify any issues so they can be
52
resolved. Also, the testing serves to compile a set of test data and results that can be used
during subsequent test cycles, to test for non-regression of the software in later releases
or after the application is in maintenance.
Working practices might vary from user to user and are considered outside the scope of
the testing.
Test Strategy
The basis of user acceptance testing is that other tests were completed successfully, so the
application and its required infrastructure are considered to be stable and reliable.
Acceptance testing concentrates on the application from the user’s perspective, that is,
how the application is used and whether it meets the necessary quality criteria.
Change requests will be sent to the development team as the actionable documentation.
Change criteria will be determined by the Test team and the Development team prior to
the beginning of testing. For instance, criteria may include impact to desired
functionality, amount of code impacted by proposed change, and design required by
proposed change. The tester will evaluate the criteria. The test lead will determine
Change Required or not. Once a bug has been determined as Change Required, the bug
report will be translated into a Change Request and passed on to development.
The customer of the acceptance testing is the System Users. The progress of the
acceptance testing will be reported to the customer, together with any issues that are
discovered and their planned resolutions. Sign-off of the tests, and therefore the
acceptance of the application, will be performed by the customer or a selected
representative.
6.2 Preconditions
53
The following items are required before testing can take place:
 A complete and coherent functional specification of the Steganography System

expressed as use cases and usage scenarios
 A complete and validation-tested release of Steganography System, delivered
according to the delivery plan
 An agreed-upon procedure for dealing with any anomalies that are discovered
during the testing process
 A set of test specifications describing how each functional area of the
Steganography System is to be acceptance tested
 An implemented test environment for the testing
 Sufficient, suitable resources to carry out the testing
 Available standards for the acceptance testing
6.3 Test Priorities
During testing of the Steganography System, the following qualities will be tested in
order of priority:
 Functionality—whether the required functions are available and working as
expected
 Usability—how user-friendly and intuitive the Steganography System is
 Security—how well-protected and guaranteed corporate and user data is
 Performance—whether the response times are within acceptable limits
 Customization—how straightforward it is to use the application in new,
unpredicted ways
6.4 Test Techniques
The following techniques will be applied:
54
 Scripted tests—sequences of user interactions (based on the use case and usage
scenarios) using predefined data sets against predicted results
 Unscripted tests—based on scripted tests, the tester tries to modify the scenarios
to explore what-if possibilities
 Penetration tests—scripted tests to attempt unauthorized entry into the system
 Usability checklists—tests to determine the complexity of interactions
 Performance statistics—generation of performance information to check against
desired performance criteria
6.5 Test Organization
6.5.1 Roles and Responsibilities
The following roles are defined:
 QA lead/test manager—responsible for planning and ensuring the smooth running

of the test process
 Tester—carries out the tests according to the test plan, and then reports the results
 Product manager—ensures that the tests are carried out successfully from a user
perspective
 Project sponsor/client—acts as main stakeholder, and ensures that the needs of the
customer community as a whole are considered
 Test support—provides technical assistance, such as test environment
configuration, and non-technical assistance, such as methodological support
Weekly team meetings will be held involving the test manager, testers, and product
managers. At these meetings, the progress of the testing process will be reported, any
issues will be discussed, and actions will be agreed upon.
55
Deliverables
The following deliverables will be expected from the user acceptance testing process:
 Test plan—this document, together with any updates that have occurred during
the testing process
 Change requests—any bugs, defects, or other changes required to the Retail and
Steganography as a result of the testing process
 Weekly reports—progress reports to enable the status of the testing process to be
determined
 Completion report—a report to be signed off by the customer, to signify the
successful completion of the user acceptance testing
6.6 Test Environment
6.6.1 Hardware and Software
The test environment will consist of:
Server
 Microsoft Windows
 Steganography System components
 One laser printer to print reports
 One color printer (laser or inkjet) to print screen dumps
 One CD-ROM drive to enable clean installation of the Steganography System
Testing Automation Software
No testing automation software packages are selected at present.
56
Application Configuration
The following user accounts will be configured on the server:
 System Users 1
 System Users 2
6.7 Test Management
Tests shall be managed according to the corporate test management standards, which
cover:
 Conduct of tests
 Reporting of test results
 Defect tracking and resolution
 Configuration management of the test environment
 Configuration control of test deliverables.
Testing Schedules
The user acceptance testing schedules are shown in the project structure document and
resulting Gantt charts.
57
6.8 Test Case
1. Splash Screen (FrmSplash.cs)
Description
A splash screen display at the start of the application and display application name and
version no.
Test Actions
 User Start the application

 After 10 seconds system must close the application and displays main screen.
 Check returned information against expected results
Test Cases
Table 6.1
Test Test Condition Test Data Expected Result Actual Result
Case in Test Cycle /
Id Description
1 Splash Screen. System should Ok
display
Application
name and
version no.
2 Splash Screen. Splash Screen Ok
should close in
seconds
3 Splash Screen After closing the Ok

splash screen,
system should
displays main
screen
58
2 Image Steganography (FrmSteganographyImage.cs)
Description
User browse image file and data file to hide data file into image file and save new bitmap
file in encryption option, User browse encrypted bitmap file and decrypt the file to get
hidden data file by using decrypt option.
.
Test Actions
 Click Encrypt button

 Browse the Bitmap file.
 Browse the data file.
 Click on Encrypt button.
 System save the new encrypted file
 Click on Decrypt button
 Browse encrypted bitmap file.
 Browse folder to get hidden data
 Click on Decrypt button to get the hidden data file.
Test Cases
Table 6.2
Test Test Condition Test Data Expected Result Actual Result
Case in Test Cycle /
Id Description
1 Click on Encrypt Button System should display Ok
[Left Side] Encrypt tab.
2 Click on Image Browse System should display Ok

button only Bitmap file as
open dialog filter
3 Click on Encrypt System Should OK

display Save As box
for new bitmap file
59
4 Click on Decrypt Button System should display Ok

[Left Side] decrypt tab
5 Click on Decrypt Button System should display Ok

extract hidden data
file and save it in
folder
60
CHAPTER 7. CRITICAL EVALUATION
The former consists of linguistic or language forms of hidden writing. The later, such as
invisible ink, try of hide messages physically. One disadvantage of linguistic
steganography is that users must equip themselves to have a good knowledge of
inguistry. In recent years, everything is trending toward digitization. And with the
development of the internet technology, digital media can be transmitted conveniently
over the network. Therefore, messages can be secretly carried by digital media by using
the steganography techniques, and then be transmitted through the internet rapidly
Steganography is the art of hiding the fact that communication is taking place, by hiding
information in other information. Many different carrier file formats can be used, but
digital images are the most popular because of their frequency on the internet. For hiding
secret information in images, there exists a large variety of steganography techniques
some are more complex than others and all of them have respective strong and weak
points.
So we prepare this application, to make the information hiding more simple and user
friendly. Basically, the model for steganography is shown on following figure:
Cover-object,
C
F(X,M,K)
Message, M Stego Object, Z
Stego-key, K
Message is the data that the sender wishes to remain it confidential. It can be plain text,
ciphertext, other image, or anything that can be embedded in a bit stream such as a
copyright mark, a covert communication, or a serial number. Password is known as
61
stego-key, which ensures that only recipient who know the corresponding decoding key
will be able to extract the message from a cover-object. The cover-object with the
secretly embedded message is then called the Stego-object.
Recovering message from a stego-object requires the cover-object itselt and a
corresponding decoding key if a stego-key was used during the encoding process. The
original image may or may not be required in most applications to extract the message.
7.1 Encryption Process
IMAGE FILE INFORMATION FILE
BMP FILE
62
7.2 Decryption Process
BMP FILE
INFORMATION FILE IMAGE FILE
63
CHAPTER 8. FUTURE ENHANCEMENT AND CONCLUSION
Steganography is a really interesting subject and outside of the mainstream cryptography

and system administration that most of us deal with day after day.
Steganography can be used for hidden communication. We have explored the limits of
steganography theory and practice. We printed out the enhancement of the image
steganography system using LSB approach to provide a means of secure communication.
A stego-key has been applied to the system during embedment of the message into the
cover image.
This steganography application software provided for the purpose to how to use any type
of image formats to hiding any type of files inside their. The master work of this
application is in supporting any type of pictures without need to convert to bitmap, and
lower limitation on file size to hide, because of using maximum memory space in
pictures to hide the file.
Since ancient times, man has found a desire in the ability to communicate covertly. The
recent explosion of research in watermarking to protect intellectual property is evidence
that steganography is not just limited to military or espionage applications.
Steganography, like cryptography, will play an increasing role in the future of secure
communication in the “digital world”.
64
REFERENCES
T.Morkel , J.H.P. Eloff, M.S.Olivier - “An overview of image Steganography” -

Information and Computer Security Architecture (ICSA) Research Group Department of
Computer Science University of Pretoria, 0002, Pretoria, South Africa.
F. L Bauer, “Decrypted Secrets - Methods and Maxims of Cryptology,” Berlin,

Heidelberg, Germany, Springer-Verlag (1997).
Birgit Pfitzmannn, rInformation Hiding Terminologyr, in Proceedings of FirstWork- shop

of Information Hiding, Cambridge, U.K. May 30 - June 1, 1996. Lecture Notes in
Computer Science, Vol.1174, pp 347-350. Springer-Verlag (1996).
Gustavus J. Simmons, “The Prisonersr Problem and the Subliminal Channel”, in

Proceedings of CRYPTO ‘83, pp 51-67. Plenum Press (1984).
Stefan Katzenbeisser and Fabien A. P. Petitcolas, “Information Hiding Techniques for

Steganography and Digital Watermarking,” Artech House (2000).
Neil F. Johnson and Sushil Jajodia, “Steganalysis of Images Created using Current
Steganography Software/’ in Proceedings of 2nd International Workshop on Information
Hiding, April 1998, Portland, Oregon, USA. pp. 273 - 289.
Ross J. Anderson and Fabien A.P. Petitcolas, ron the limits of steganography,r IEEE
Journal on Selected Areas in Communications (J-SAC), Special Issue on Copyright &
Privacy Protection, vol. 16 no. 4, pp 474-481, May 1998.
Scott Craver, “On Public-key Steganography in the Presence of an Active Warden,” in

Proceedings of 2nd International Workshop on Information Hiding, April 1998, Portland,
Oregon, USA. pp. 355 - 368.
Yeuan-Kuen Lee and Ling-Hwei Chen, “An Adaptive Image Steganographic Model
Based on Minimum-Error LSB Replacement,r in Proceedings of the Ninth National
Conference on Information Security, pp. 8-15. Taichung, Taiwan, May 14-15, 1999.
Yeuan-Kuen Lee and Ling-Hwei Chen, “A High Capacity Image Steganographic Model,r
accepted by lEE Proceedings Vision, Image and Signal Processing. (2000).
65
APPENDICES
User Manual
To start the application, double click on SteganographyImage.exe
66
System will display splash screen as below
After splash screen It displays Main Screen as below
67
To encrypt , hide the data in image file click on Encrypt Button – Left Side
Click browse button to select .BMP file from disk. After selecting file, image will display
in image preview tab and image details are displays in left side.
Select browse button to load any type of file, however file size must be less than the BMP
file.
Finally click on encrypt button, it asks for save the new file new file will combine bitmap
and data file and create new file.
68
To Decrypt select encrypted. Click on Decrypt Button – Left Side. Browse encrypted
.BMP file and select folder and click on decrypt button. After successfully decryption
loaded file extracted from image file.
69

SteganographyImage Project Report

Uploaded by

Copyright:

Available Formats

SteganographyImage Project Report

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

SteganographyImage Project Report

Uploaded by

Copyright:

Available Formats

1/69 Steganography – Project Report

Data hiding is a characteristic of object-oriented programming. Because an object can

Due to advances in ICT, most of information is kept electronically. Consequently, the

Consequently, different techniques are employed for different applications. Several

CHAPTER 2. LITERATURE REVIEW

An application that requires a minimal amount of embedded data is the placement of a

observation: Since S = a - b and a and b are assumed independent, ² can be computed as

where ² for a uniform S is:

The expected value of Sn is:

And the standard deviation is:

Now, when decoded, Sn will be:

So each step of the way we accumulate an expectation of 2 × . Thus after n repetitions,

Uniformity. A simplifying assumption of a uniform luminance histogram was made

1. Let ar be the time reversed series of a.

An image histogram (Figure 6, top) is a somewhat random distribution. The result of

The Patchwork method is subject to cryptographic attack if it is used to encode a large

Texture Block Coding: A visual approach

These regions can be detected as follows:

High bit-rate coding

Placing data in images is useful in a variety of applications. We highlight below four

Digital watermark. The objective of a digital watermark is to place an indelible mark on

In a normal communication channel, it is often desirable to concentrate the information in

While there are many variations on spread spectrum communication, we concentrated on

In the decoding stage, the following is assumed:

Echo data hiding

Only the first impulse is significantly amplified as it is reinforced by subsequent

Three supplemental techniques are discussed next.

Data hiding in Text

There are many circumstances where punctuation is ambiguous or when mispunctuation

Data hidden in text has a variety of applications, including copyright verification,

Automatic detection of geometric and nongeometric modifications applied to the host

2.1 Existing System:

1. Petrovic, R.Winograd,”Data hiding within audio signals”, 1999.

This paper presents the general principles of steganography, basic

2. Jamil, T. “Steganography: the art of hiding information in plain sight”,

3. Chandramouli, R. Memon, “Analysis of LSB based image steganography

4. Amin, M.M. Salleh,” Information hiding using steganography”, 2003.

Due to advances in ICT, most information is kept electronically. Consequently, the

o Is there any recommended tool to be used for software development?

o What is the recommended front-end?

o What is the recommended back-end?

o What is the time limit for development of the system?

o Is there any recommended format of User Interface?

o What are the Hardware Specifications of the machines on which the

o What are the Software Specifications on which the system will be

o How many machines are available for running the system?

The graphical representation of this system is as follows:

Image Message Image file

BMP image file

4.2 Data Flow Diagram

Fig: 4.2 Level 0 DFD

Secret Key Secret Key

Fig 4.3 Level 1 DFD

There are two types of Implementation

 Implementation of a computer system to replace a manual one.

5.1 Spiral Model:

5.1.1 Phases of Spiral Model:

5.1.1.1 Planning Phase:

5.1.1.2 Risk Analysis Phase:

5.1.1.3 Engineering Phase: