DOI 10.4010/2016.

1901
ISSN 2321 3361 © 2016 IJESC

Research Article Volume 6 Issue No. 7

Parameter Evaluation and Comparison of algorithms used in

Steganography
Meenakshi Rana
Department of Computer Science and Engineering
Career Point University, Hamirpur, India
mini37980@gmail.com

Abstract:
Steganography is the art of hiding information and an effort to conceal the existence of the embedded information. It serves as a
better way of securing message than cryptography which only conceals the content of the message not the existence of the
message. Combining secret image with the carrier image gives the hidden image. The resultant image so formed is called as a stego
image which just looks like the original image but sometimes during the usage of various methods or algorithms the stego image
produced can have some differences like increase or decrease in the number of colors, repetitive patterns or difference in the file
size between the stego-image and the cover image. The stego image can be then tested by any unauthorized user and he/she can
easily retrieve the confidential information. The most popular technique used to detect the steganography is known as Steganalysis.
Steganalysis is used to analyze the chances of the image being detected. This technique will further help us to analyze the
performance of various algorithms in the field of steganography. Various Parameters i.e. average values in RS Analysis, average
values in Sample Pair Analysis, Mean squared error, PSNR(Peak signal to noise ratio) values will be evaluated and this will
help us in knowing which one is the best algorithm.

Keywords: Steganography, Steganalysis, Stego image, RGB content

1. INTRODUCTION
Steganography is the art of hiding information and an effort to
conceal the existence of the embedded information. In
steganography, the possible cover carriers are innocent looking
carriers (images, audio, video, text, or some other digitally
representative code) which will hold the hidden information.
A message is the information hidden and may be plaintext,2.
cipher text, images, or anything that can be embedded into a bit
stream. Together the cover carrier and the embedded message
create a stego-carrier.
For example, when a secret message is hidden within a cover
image, the resulting product is a stego-image. A possible
formula of the process may be represented as: cover medium +
embedded message + stego key = stego-medium
PRINCIPLE OF STEGANOGRAPHY
The secret message is embedded inside the cover object in
encrypted format by using a hiding algorithm and it is sent to a
receiver over a network.

Hiding information may require a stego key which is additional The receiver then decrypted the message by applying the
secret information, such as a password, required for embedding reverse process on the cover data.
the information.

Fig 2.1

International Journal of Engineering Science and Computing, July 2016 8134 http://ijesc.org/
3. FUNDAMENTALS OF STEGANOGRAPHY
Three fundamental steganographic systems are defined:
a pure steganographic system, a secret key
steganographic system, and a public key steganographic
system. In pure steganography, no keys are needed for
the communicating parties other than the embedding
and extracting algorithms.
While pure steganography does not involve the use or
exchange of any secret information such as stego-keys,
both secret key steganography and public key
steganography rely on the sharing of such keys. In a
secret key steganographic system, a sender hides a
secret message into a cover object using a secret key.
The key used in the embedding process can also be used
to reverse the process in order to extract the hidden data.
In this steganographic system, it is assumed that the
communicating parties are able to transmit secret keys
over a secure channel. Finally, public key
steganography models after public key cryptography.
4. RGB COLOR MODEL
The RGB color model is an additive color model in
which red, green, and blue light are added together in
various ways to reproduce a broad array of colors.
The size of an image can be given in pixels, for
example an image which is 640 x 480 pixels contains
307,200 pixels. Each pixel is generally stored as 24-bit
or 8-bit. A 24-bit pixel has a possibility of 224 color
combination. The 24 bits of a 24-bit image are spread
over three bytes and each byte represents red, green and
blue respectively.
Fig 4.1 RGB Color model
4.1 Numeric representations
A color in the RGB color model is described by
indicating how much of each of the red, green, and blue
is included. The color is expressed as an RGB triplet (r,
g, b), each component of which can vary from zero to a
defined maximum value. If all the components are at
zero the result is black; if all are at maximum, the result
is the brightest represent able white.
International Journal of Engineering Science and Computing, July 2016
These ranges may be quantified in several different
ways:
 From 0 to 1, with any fractional value in between. This
representation is used in theoretical analyses, and in
systems that use floating point representations.
 Each color component value can also be written as
a percentage, from 0% to 100%.
 In computers, the component values are often stored
as integer numbers in the range 0 to 255, the range that a
single 8-bit byte can offer. These are often represented
as either decimal or hexadecimal numbers.
 High-end digital image equipment are often able to deal
with larger integer ranges for each primary color, such
as 0..1023 (10 bits), 0..65535 (16 bits) or even larger, by
extending the 24-bits (three 8-bit values) to 32-bit, 48-
bit, or 64-bit units (more or less independent from the
particular computer's word size).
For example, brightest saturated red is written in the
different RGB notations as:
Notation RGB triplet
Arithmetic (1.0, 0.0, 0.0)
Percentage (100%, 0%, 0%)
(255, 0, 0) or
Digital 8-bit per sometimes
channel #FF0000
(hexadecimal)
Digital 16-bit per
(65535, 0, 0)
channel
Table 1 RGB Notations
5. STEGANALYSIS
Steganalysis is "the process of detecting steganography by
looking at variances between bit patterns and unusually large
file sizes”. It is the art of discovering and rendering useless
covert messages. The goal of Steganalysis is to identify
suspected information streams, determine whether or not
they have hidden messages encoded into them, and, if
possible, recover the hidden information.
STEGANALYSIS TECHNIQUES
5.1. Unusual patterns:
Unusual patterns in a stego image are suspicious. For
example, there are some disk analysis utilities that can filter
hidden information in unused partitions in storage devices.
Filters can also be used to identify TCP/IP packets that
contain hidden or invalid information in the packet headers.
TCP/IP packets used to transport information across the
Internet have unused or reserved space in the packet headers.
5.2. Visual detection
8135 http://ijesc.org/
 Analyzing repetitive patterns may reveal the
identification of a steganography tool or hidden
information. To inspect these patterns an approach is to
compare the original cover image with the stego image
and note visible differences.
This is called a known-carrier attack. By comparing
numerous images it is possible that patterns emerge as
signatures to a steganography tool.
Another visual clue to the presence of hidden
information is padding or cropping of an image. With
some stego tools if an image does not fit into a fixed
size
It is cropped or padded with black spaces. There may
also be a difference in the file size between the stego-
image and the cover image. Another indicator is a large
increase or decrease in the number of unique colors, or
colors in a palette which increase incrementally rather
than randomly
6.3. Tools to detect Steganography
The disabling or removal of hidden information in
images is dependent on the image processing
techniques. For example, with LSB methods of inserting
data, simply compressing the image using lossy
compression is enough to disable or remove the hidden
message
There are several available steganographic detection
tools such as Encase by Guidance Software etc.
7. Techniques in Image Steganography
There are numerous methods used in image
steganography each of this method can be applied and
they have different degree of success, discussed below
are they methods:
7.1 Masking and filtering:
Masking and filtering techniques, usually restricted to
24 bits or grayscale images, take a different approach to
hiding a message.
These methods are effectively similar to paper
watermarks, creating markings in an image. This can be
achieved for example by modifying the luminance of
parts of the image. While masking does change the
visible properties of an image, it can be done in such a
way that the human eye will not notice the anomalies
Since masking uses visible aspects of the image, it is
more robust than LSB modification with respect to
compression, cropping and different kinds of image
processing.
The information is not hidden at the ”noise” level but is
inside the visible part of the image, which makes it more
International Journal of Engineering Science and Computing, July 2016
suitable than LSB modifications in case a lossy
compression algorithm like JPEG is being used.
7.2 Least Significant Bit Hiding (LSB) Method:
It is the most widely used technique for image
embedding. This method became very popular due to its
easy implementation. It embeds data in a cover image
by replacing the least significant bits (LSB) of cover
image with most significant bits (MSB) of message
image.
An image is represented as a collection of pixels. Each
pixel is represented by 8 bits. Consider a pixel which is
represented as 0110 1010. Among these 8 bits, the bits
on the left side [0110] are known as MSB and the bits
on the right side [1010] are known as LSB. Replacing
the MSB with secret message will have noticeable
impact on color. However, replacing the LSB will not
be noticeable to the human eye.
It produces high number of near duplicate colors.
Human being can detect 6 or 7 bits of color, whereas
radiologists can detect 8 or more bits of color.
This method needs proper cover image to hide secret
message. This method may use either 8 bit image or 24
bit image as a cover image. Each image has its own
advantages and disadvantages.
When it uses 24 bit color image, large amount of space
is needed to hide secret messages. It needs 24 bits (3
bytes) to represent each pixel. Among the 24 bits 3 bits
(1 bit from each byte) are used to represent red, green,
blue color respectively. Consider the following grid that
represents the 3 pixels of a 24 bit color image
(01101001 11010100 11010001)
(11001000 01011100 11101001)
(00100111 11001001 11101001)
From the above grid the LSB of each byte represents the
red, green, blue color. Suppose we embed the numeric
value’15’
(00001111), the matrix will be modified as,
(01101000 11010100 11010000)
(11001000 01011101 11101001)
(00100111 11001001 11101001)
The above matrix shows that it needs only 3 bits to be
modified to embed the numeric value’15’ successfully.
Since the numeric value is too small it is difficult for the
human eye to recognize the changes.
8136 http://ijesc.org/

Hence the message is hidden successfully. But it needs
large amount of space [72 bits to hide 8 bits] for
embedding. LSB may also use 8 bit image as a cover
image. Even it needs smaller space to hide data, it
requires a careful approach.
Because it needs one byte to represent a pixel, changing
the LSB of that byte will be resulting a visible changing
of color. The changes will be noticeable by human eye.
Human eye cannot differentiate grey values as easy as
with different colors. Gray scale images are preferred
than color images.
Another important aspect is the selection of
compression technique. While using the lossy
compression algorithm, the hidden information might be
lost during decompression.
Hence, it is necessary for the LSB method to use
lossless compression. The Properties of LSB embedding
are:
1. LSB is a simplest method for embedding secret
information into images.
2. Embedding data into least significant bit will not be
perceived by the human eye. Hence the stego image
looks like cover image.
3. But slight image manipulation is vulnerable for cover
images.
4. Conversion from GIF or BMP to JPEG and back
destroy the hidden information in LSB.
5. Statistical analysis with the stego images leads to the
suspicion about the hidden data.
6. As ‘N’ ( no of bits to be replaced) increases,hiding
capacity increases but the appearance of the image
degrades.
Though LSB is simplest and easiest method for
embedding data into images, when more number of
information is hidden, the appearance of image
degrades. Statistical analysis of the stego image leads to
the suspicion of hidden information.
8. ALGORITHMS USED IN STEGANOGRAPHY
There are seven algorithms currently implemented, each
use least significant bit steganography and some filter
the image first.
8.1 BLINDHIDE:
This is the simplest way to hide information in an
image. It blindly hides because it just starts at the top
left corner of the image and works it's way across the
image (then down - in scan lines) pixel by pixel. As it
goes along it changes the least significant bits of the
pixel colors to match the message.
To decode the process the least significant bits starting
at the top left are read off. This is not very secure - it's
International Journal of Engineering Science and Computing, July 2016
really easy to read off the least significant bits. It also
isn't very smart - if the message doesn't completely fill
up the possible space then just the top part of the image
is degraded but the bottom is left unchanged - making it
easy to tell what's been changed.
8.2 HIDE SEEK
This algorithm randomly distributes the message across
the image. It is named after "Hide and Seek" - a
Windows 95 steganography tool that uses a similar
technique. It uses a password to generate a random seed,
then uses this seed to pick the first position to hide in. It
continues to randomly generate positions until it has
finished hiding the message.
It's a little bit smarter about how it hides because you
have to try every combination of pixels in every order to
try and "crack" the algorithm - unless you have the
password.
8.3 FILTER FIRST
This algorithm filters the image using one of the inbuilt
filters and then hides in the highest filter values first.
It is essentially a fancier version of Blind Hide as it
doesn't require a password to retrieve the message.
Because we are changing the pixels we need to be
careful about filtering the picture because we don't want
to use information for filtering that might change.
If we do, then it may be difficult (if not impossible) to
retrieve the message again.
So this algorithm filters the most significant bits, and
leaves the least significant bits to be changed.
It is less noticeable on an image because using the filter
ensures we are hiding in the parts of the image that are
the least noticeable.
8.4 BATTLE STEG
The best of all this algorithm performs "Battleship
Steganography". It first filters the image then uses the
highest filter values as "ships". The algorithm then
randomly "shoots" at the image (like in Hide Seek) and
when it finds a "ship" it clusters it's shots around that hit
in the hope of "sinking" the "ship".
After a while it moves away to look for other ships. The
effect this has is that the message is randomly hidden,
but often hidden in the "best" parts to hide in thanks to
the ships.
8137 http://ijesc.org/
 It moves away to look for other ships so that we don't
degrade an area of an image too greatly. It is secure
because you need a password to retrieve the message.
8.5 DYNAMIC BATTLESTEG
This algorithm do the same as Battle Steg except it use
dynamic programming to make the hiding process faster
and less memory intensive. It is NOT compatible with
the original algorithms because the order of pixels kept
in the dynamic array is not exactly the same.
8.6 DYNAMIC FILTERFIRST
This algorithm do the same as Filter first except it use
dynamic programming to make the hiding process faster
and less memory intensive. It is NOT compatible with
Figure 1 shows the structure of the algorithm SLSB:
Fig 3.1 SLSB procedure
6. RESULTS AND ANALYSIS
We have generated a stego image named cpu.bmp.
Then, Steganalysis is done to check the chances of that
particular hidden message being trapped. So, with the
help of a steganography tool information is embedded
with a particular key and use all the algorithms .We get
seven different stego images as output.
6.1. RS ANALYSIS
RS Analysis makes small modifications to the least
significant bit plane in an image then uses these
modifications and a discrimination function to classify
groups of pixels.
International Journal of Engineering Science and Computing, July 2016
the original algorithms because the order of pixels kept
in the dynamic array is not exactly the same
8.8 SLSB
This algorithm filters the cover image by using a default
filter and hides information in those areas that get a
better rate. The filter is applied to the most significant
bits of every pixel, leaving the less significant to hide
information.
The filter ensures the choice of areas of the image in the
least impact with the inclusion of information, which
affects a greater difficulty of detecting the presence of
hidden messages.
The counts of the groups based on the modifications
allow the calculation of an estimated embedding rate.
Images that do not contain steganography often have a
natural embedding rate of up to 3%, whereas images
containing hidden information usually have estimated
embedding rates which accurately reflects the amount
of hidden information.
These are the important points that I considered for
carrying out this analysis……
8138 http://ijesc.org/
 The higher the increment of original image RGB
content the more likely the embedded message can be
retrieved or noticed….
 So, the best algorithm will be the one which will
produce less increment in RGB content as compared to
original image……
6.2. SAMPLE PAIR ANALYSIS
Sample Pairs Analysis utilizes finite state machines to
classify groups of pixels modified by a given pattern.
Both Steganalysis techniques are very accurate at
predicting the embedding rate on stego-images using
least significant bit embedding.
6.3. PSNR RATIO
This is the ratio between power and corrupting noise
that corrupts the representation of image .Higher is the
value, better is the quality of image.
6.4. MEAN SQUARED ERROR (MSE)
This indicates the degree of similarity or differences
between two images. Lesser the mean square value of
an image better is the quality and less distortion from
original.
Here is the table showing the RS analysis as well as
Sample Analysis on all the seven algorithms .The
values of original image is also given……..

Algorithms Non Overlapping Groups Overlapping groups Average

applied Across all
groups/colors
RGB % % in % % in % in % in
CONTENT in green in red green blue
red blue
Original 6.63 2.39 9.00 8.179 4.872 10.47 6.9
image
SLSB 6.63 2.39 8.9 8.17 4.8 10.51 6.9
Blind Hide 6.76 2.54 9.04 8.23 4.95 10.49 7.008
Battle Steg 6.63 2.39 9.05 8.18 4.90 10.50 6.94
Filter first 6.75 2.42 9.01 8.27 4.88 10.511 6.97
Dynamic 6.67 2.43 9.07 8.25 4.9 10.54 6.98
Battle Steg
Dynamic 6.74 2.46 9.02 8.24 4.92 10.49 6.98
Filter First
Hide seek 6.6 2.42 9.07 8.23 4.9 10.53 6.98
Table 2 RS ANALYSIS
Here is another table of sample pair analysis:

Algorithms applied Color values(in %age) Average Across all

groups/colors
RGB CONTENT % in red % in % in
green blue
Original image 5.69 2.34 7.39 5.14
SLSB 5.69 2.34 7.28 5.10
Blind Hide 5.8 2.42 7.4 5.22
Battle Steg 5.69 2.32 7.49 5.17
Filter first 5.79 2.3 7.37 5.17
Dynamic Battle 5.73 2.43 7.41 5.19
Steg
Dynamic 5.75 2.38 7.41 5.18
Filter First
Hide seek 5.72 2.38 7.44 5.18
Table 3-SAMPLE PAIR ANALYSIS

International Journal of Engineering Science and Computing, July 2016 8139 http://ijesc.org/
 Furthermore when analyzed……We get all the 3 is for Filter First algorithm
values for sample pair analysis as well as PSNR ratio 4 is for Hide seek algorithm
and mean squared error….here are the graphs that 5 is for Battle Steg algorithm
easily represent the minimizing and maximizing 6 is for Dynamic Battle Steg algorithm
values….On the X-AXIS the numbering from 1 to 7 7 is for Dynamic Filter First algorithm
depicts the following algorithms…… Here are the graphs of the parameters showing the
1 is for SLSB algorithm. performances of all the algorithms…..
2 is for Blind hide algorithm

a) RS Analysis

b) Sample pair analysis

International Journal of Engineering Science and Computing, July 2016 8140 http://ijesc.org/
c) PSNR values

d) MSE values
7. The flow of the system
Basically what happens here is that a plain image that
does not contain any hidden data is been embedded with
a secret data (this can be either image or text) using a
Steganography studio, after embedding the data the
image now becomes a stego-image.
For you to know that this image has a hidden data you
do a Steganalysis using a tool comparing the RS
analysis or sample pair data of the original image and
the stego-image.
You will notice a change in the RGB percentage of the
image with higher RGB from the original image is
normal the now with hidden data.

International Journal of Engineering Science and Computing, July 2016 8141 http://ijesc.org/
 Fig 9.1
8. CONCLUSION & RECOMMENDATIONS
We got the result using two detection techniques which
are RS (Regular/Singular) analysis and Sample pair
analysis these are statistical Steganalysis which is seen
to be more powerful than the other type of Steganalysis
(signature Steganalysis).Also I compared the
performance on the basis of two parameters….PSNR
which is higher is better and MSE which is lower is
better.
The comparison of the RGB (red, green and blue
colors) content in every image for both detection
method was used to know which algorithm is the best,
the higher the increment of the original image RGB
content the more likely embedded message can be
retrieve or noticed. SLSB (Selected Least Significant
Bit) Algorithm happen to be the best algorithm
We will recommend for Steganography because it
produced little increment in RGB (red, green and blue
colors) compared to that of the original image in both
the analysis and it has highest PSNR value (85.75) and
lowest mean square error as shown in the graphs.
Though some other algorithms also produce lowest
MSE values but they failed on another parameters and
SLSB gives the best performance among all……it
means that:
Less increment in RGB means SLSB will us an image
without any noisy distortion….
PSNR is high means the visual quality of the stego
image will be very clear…..
So SLSB is concluded as the best algorithms among
all……
9. FUTURE SCOPE
From my findings there is growing interest in
Steganography due to the fact that communication over
the internet has out grown the way it used to be in the
last century. The fact that Steganography fully supports
International Journal of Engineering Science and Computing, July 2016
hiding information under different mediums (e.g.
images) makes this an area of keen interest.
Further new algorithms can be developed and bulk
Steganalysis can also be done in which we can take
large number of images. New and strong techniques can
also be developed in Steganalysis that can help in lesser
unauthorized detection of the hidden information.
References:
1. Arvin Kumar Km. Pooja, “Steganography- A Data
Hiding Technique” International Journal of Computer
Applications (0975 – 8887) Volume 9– No.7, November
2010.
2. Nick Nab avian, “CPSC 350 Data Structures: Image
Steganography” Nov. 28, 2007
3. Kevin Curran, “An Evaluation of Image Based
Steganography Methods” International Journal of
Digital Evidence Fall 2003, Volume 2, Issue 2
4. Mr. Falesh M. Shelke, “Comparison of different
techniques for Steganography in images” International
Journal of Application or Innovation in Engineering &
Management Volume 3, Issue 2, February 2014
5. Sangeeta Dhal , “An In-depth Analysis of Various
Steganography Techniques” International Journal of
Security and Its Applications Vol.9, No.8 (2015), pp.67-
94
6. Pooja Raw at, “Advanced Image Steganographic
Algorithms and Breaking strategies” International
Journal of Computer Applications® (IJCA) (0975 –
8887)
8142 http://ijesc.org/
7. Kavita Kadam, “Steganography Using Least Significant
Bit Algorithm” International Journal of Engineering
Research and Applications (IJERA) Vol. 2, Issue 3,
May-Jun 2012, pp. 338-341

8. Dr. M. Uma maheshwari, “Analysis of Different

Steganographic Algorithms for Secured Data Hiding”
IJCSNS International Journal of Computer Science and
Network Security, VOL.10 No.8, August 2010

9. Champ kamala .B.S & Radhika D. K Asst Professors,

“Least Significant Bit algorithm for image
steganography” International Journal of Advanced
Computer Technology (IJACT)

10. Kathryn Hemp stalk, “Hiding Behind Corners: Using

Edges in Images for Better Steganography” University
of Waikato Department of Computer Science

11. Shashikala Channalli, “Steganography An Art of Hiding

Data” International Journal on Computer Science and
Engineering Vol.1(3),2009,

12. Juan José Roque, “SLSB: Improving the

Steganographic Algorithm LSB” Universidad National
de Education a Distance (Spain)

13. Farah R. Patel, “Performance Evaluation of

Steganography and AES encryption based on different
formats of the Image” International Journal of
Advanced Research in Computer and Communication
Engineering Vol. 4, Issue 5, May 2015.

14. Andrew D. Ker, “Quantitative Evaluation of Pairs and

RS Steganalysis Oxford University Computing
Laboratory”

15. Abbas Cheddad, “A Comparative Analysis of

Steganographic Tools” School of Computing and
Intelligent Systems, Faculty of Engineering University
of Ulster. Londonderry, Northern Ireland, United
Kingdom

16. NIELS PROVOS AND PETER HONEYMAN , “Hide

and Seek: An Introduction to Steganography”
University of Michigan

International Journal of Engineering Science and Computing, July 2016 8143 http://ijesc.org/