F5A Echo Hidding Algorithm

High Capacity Despite Better

Steganalysis
CONTAINTS

1.INTRODUCTION
2.ABSTRACT
3.OBJECTIVE
4.F5-ALGORITHM
5. TOOLS AND PLATFORM
6. MODULE DESCRIPTION
7.CONCLUSION
8.REFERENCES
INTRODUCTION

Secure steganographic algorithms hide confidential messages within

other, more extensive data (carrier media). An attacker should not be
able to find out, that something is embedded in the steganogram (i. e., a
steganographically modified carrier medium) . Visual attacks on
steganographic systems are based on essential information in the carrier
medium that steganographic algorithms overwrite . Adaptive techniques
(that bring the embedding rate in line with the carrier content) prevent
visual attacks, however, they also reduce the proportion of
steganographic information in a carrier medium. Lossy compressed
carrier media (JPEG, MP3, . . . ) are originally adaptive and immune
against visual (and auditory respectively)
attacks.
 The steganographic tool Jsteg embeds messages in lossy
compressed JPEG files. It has a high capacitye. g., 12 % of
the steganograms sizeand, it is immune against visual
attacks. However, a statistical attack discovers changes
made by Jsteg . MP3Stego and IVS-Stego also withstand
auditory and visual attacks respectively. Appart from this, the
extremely low embedding rate prevents all known statistical
attacks. These two steganographic tools offer only a
relatively small capacity
 Remote network monitoring system is also known as
RMON.RMON was developed to help network administrator
monitor and analyze data connected from local area network.
RMON is a part of management information base.
Remote Server
This is the server part which waits for clients connections and for
each connected client, a new frame appears showing the current
client screen. When you move the mouse over the frame, this
results in moving the mouse. When you click any Particular client
screen then it is automatically zoom out. You can easily watch it
is activity. After that when you click on cancelled button then it is
automatically go to previous screen short.
 Remote Client

This the client side, its core function is sending a screen shot of

the client's desktop every predefined amount of time. Also it

receives server commands such as "move the mouse command",

and then executes the command at the client's PC.

It has one more feature you can send any message from server

to any client. If client is following the instruction, it can continue

working otherwise the server can shutdown the client PC form

server side.
 The Faugre F5 algorithm first calculates the Grbner basis of
a pair of generator polynomials of the ideal. Then it uses this
basis to reduce the size of the initial matrices of generators for
the next larger basis:
If Gprev is an already computed Grbner basis (f2, , fm) and we
want to compute a Grbner basis of (f1) + Gprev then we will
construct matrices whose rows are m f1 such that m is a
monomial not divisible by the leading term of an element of Gprev.
This strategy allows the algorithm to apply two new criteria
based on what Faugre calls signatures of polynomials. Thanks to
these criteria, the algorithm can compute Grbner bases for a
large class of interesting polynomial systems, called
regular sequences, without ever simplifying a single polynomial
to zerothe most time-consuming operation in algorithms that
compute Grbner bases. It is also very effective for a large
number of non-regular sequences.
Abstract

Many steganographic systems are weak against visual and

statistical attacks. Systems without these weaknesses offer
only a relatively small capacity for steganographic messages.
The newly developed algorithm F5 withstands visual and
statistical attacks, yet it still offers a large steganographic
capacity. F5 implements matrix encoding to improve the
efficiency of embedding. Thus it reduces the number of nec-
essary changes. F5 employs permutative straddling to
uniformly spread out the changes over the whole steganogram.
 The steganographic tool Jsteg embeds messages in lossy
compressed JPEG files. It has a high capacitye. g., 12 % of
the steganograms sizeand, it is immune against visual
attacks. However, a statistical attack discovers changes
made by Jsteg . MP3Stego and IVS-Stego also withstand
auditory and visual attacks respectively. Appart from this, the
extremely low embedding rate prevents all known statistical
attacks. These two steganographic tools offer only a
relatively small capacity
 OBJECTIVE
The project has the following objectives:
To create a tool that can be used to hide data inside a 24
bit color image.
The tool should be easy to use, and should use a graphical
user interface.
The tool should work cross-platform.
The tool should effectively hide a message using an image
degradation approach, and should be able to retrieve this
message afterwards.
The tool should take into account the original content, to
theoretically more effectively hide the message.
 The tool should be able to provide some information as to the
effectiveness of the hiding i.e. it should be able to evaluate
the degradation of an image. The analysis used will consist of
existing watermarking measures, re- implemented for this tool.
The technique should fall under the category of Secret Key
Steganography -where without the key the hidden message
cannot be retrieved.
The tool should be able to encrypt the message before
embedding it.
RESEARCH PART

F5
Unlike stream media (like in video conferences), image files
only provide a limited steganographic capacity. In many cases,
an embedded message does not require the full capacity (if it
fits). Therefore, a part of the file remains unused. shows, that
(with continuous embedding) the changes () concentrate on
the start of the file, and the unused rest resides on the end. To
prevent attacks, the embedding function should use the carrier
medium as regular as possible. The embedding density should
be the same everywhere.
 1.Permutative Straddling
Some well-known steganographic algorithms scatter the message over the whole
carrier medium. Many of them have a bad time complexity. They get slower if we
try to exhaust the steganographic capacity completely. Straddling is easy, if the
capacity of the carrier medium is known exactly. However, we can not predict the
shrinkage for F4, because it depends on which bit is embedded in which position.
We merely can estimate the expected capacity. The straddling mechanism used
with F5 shuffles all coefficients using a permutation first. Then, F5 embeds into
the permuted sequence. The shrinkage does not change the number of
coefficients (only their values). The permutation depends on a key derived from
a password. F5 delivers the steganographically changed coefficients in its original
sequence to the Huffman coder. With the correct key, the receiver is able to
repeat the permutation. The permutation has linear time complexity O(n).
 2.Matrix Encoding
Ron Crandall introduced matrix encoding as a new technique to improve the
embedding efficiency. F5 possibly is the first implementation of matrix
encoding. If most of the capacity is unused in a steganogram, matrix
encoding decreases the necessary number of changes. Let us assume that
we have a uniformly distributed secret message and uniformly distributed
values at the positions to be changed. One half of the message causes
changes, the other half does not. Without matrix encoding, we have an
embedding efficiency of 2 bits per change. Because of the shrinkage
produced by F4, the embedding efficiency is even a bit lower, e. g. 1.5 bits
per change. (Shrinkage means to change without to embed sometimes, cf.
Sect. 4.) 298 Andreas Westfeld.
Software requirement
In order to carry out the development of this
project, many software are needed, these
include Microsoft Windows XP, which shall be
the operating system for the project to be
developed;
Front End: JDK, Java
IDE : Netbeans 6.9 and Above
Backend: MySql
HARDWARE requirement
HARDWARE REQUIREMENTS
PROCESSOR III AND ABOVE
20 GB HARD DISK
256 DDR RAM
MODULE DESCRIPTION
The project consists of mainly four modules encryption, hide message,
retrieve message and decryption. Encryption and hide message form
the modules. retrieve message and decryption form the modules .
Encryption
Encryption includes a message or a file encrypting. Encryption involves
converting the message to be hidden into a cipher text. Encryption can
be done by passing a secret key.Secret key can be used for encryption
of the message to be hidden.It provides security by converting it into a
cipher text,which will be difficult for hackers to decrypt. Moreover if the
message is password protected,then while retrieving message,the
retriever has to enter the correct password for viewing the message.
 Hide Message
Hiding message is the most important module of steganography.It involves
embedding the message into the cover text. Each pixel typically has three
numbers associated with it, one each for red, green, and blue intensities, and
these values often range from 0-255.In order to hide the message,data is first
converted into byte format and stored in a byte array.The message is then
encrypted and then embed each bits into the LSB position of each pixel position.
The least significant (rightmost) bit of each 8-bit byte has been co-opted to hide
a text message.
Retrieve Message
It involves retrieving the embed message from the file independent of the file
format. Once the message has been retrieved it has to be converted into original
message or file.
 Decryption
Decryption includes a message or a file decrypting. Decryption
involves converting the cipher text into decrypted format.
Decryption can be done by passing a secret key. Secret key
can be used for decryption of the message that is hidden. It
provides security by converting the cipher text, into the
original data message or file . Moreover if the message is
password protected, then while retrieving message, the
retriever has to enter the correct password for viewing the
message.
 CONCLUSION
Many steganographic algorithms offer a high capacity for hidden
messages, but are weak against visual and statistical attacks. Tools
withstanding these attacks provide only a very small capacity. The
algorithm F4 combines both preferences: resistance against visual and
statistical attacks as well as high capacity. Matrix encoding and
permutative straddling enable the user to decrease the necessary
number of steganographic changes and to equalise the embedding rate
in the steganogram. F5 accomplishes a steganographic proportion that
exceeds 13% of the JPEG file size (cf.Table3). Please understand this
result as a friendly provocation for security analysts. On the other hand
F5 is able to decrease the embedding rate arbitrarily. The software
with its source code is public.
References
Computer Networks by Tanenbaum
Java 2: The Complete Reference, Fifth Edition
(Paperback) by Herbert Schildt .
Java Unleashed (Unleashed S.) by Michael
Morrison.
Java 2 Bible by Justin Couch and Daniel H.
Steinberg