\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Securing Data Using Jpeg Image over Mobile Phone},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2011-06-21 (revised: 21 June 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-06-21}
\title{Securing Data Using Jpeg Image over Mobile Phone}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Roopesh Kumar  }

             \author[2]{Yogendra Kumar  Jain}

             \author[3]{Pankaj  Agarwal}

             \affil[1]{  Samrat Ashok Technological Institute , Vidisha (M.P.) 464001 India}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 May 2011 Accepted: 6 June 2011 Published: 21 June 2011}

\maketitle


\begin{abstract}
        


In recent past years, Internet and Mobile is widely used for communication. Multimedia messaging (MMS) and Short Service Messaging (SMS) are the popular services provided by the telecommunication companies. In MMS we can easily send picture with text message. In SMS we can send text only. These techniques make the communication so fast. As well as the communication became easy attention toward information security increased. Data Security is the main concern for research. Mostly used techniques for secure communication are Cryptography and Steganography. There are so many techniques for steganography and cryptography. Mostly used techniques are image steganography and there are so many algorithms for this. For the cryptography mainly AES techniques is being used. In this paper we are presenting a technique using cryptography and steganography for securing information over mobile in MMS. It is very common practice to hide data in LSB of pixel. Spatial and frequency domains are generally used for image processing. Spatial domain have so many computations comparatively frequency domain. There different transform techniques are used for transformation e.g. DCT, FFT and wavelets. Here we are using Discrete Cosine transform (DCT) for image steganography and tiny encryption algorithm for cryptography. Tiny encryption algorithm (TEA) is block cipher algorithm.It is simple and fast but best for mobile application.

\end{abstract}


\keywords{Steganography, DCT, Messaging.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
he most important characteristics of (digital) information are that it is very easy to create and distribute unlimited number of its copies. There may be different type of areas like music, film, book and software which requires protection or security. It is a very big problem dealing with the protection of the intellectual and production rights. The fact that an unlimited number of perfect copies of text, audio and video data can be illegally produced and distributed requires studying ways of embedding copyright information and serial numbers in audio and video data. Steganography and watermarking bring a variety of very important techniques how to hide important information in an undetectable and irremovable way in audio and video data.Steganography and watermarking are main parts of the fast developing area of information hiding. Steganography emphasize on hiding of existence of message. Watermarking emphasize on protection in such way that no one can remove or change the information. Other way of information security is cryptography. Cryptography hides the message from attacker not the existence of that message. The word steganography originally derived from Greek word which means "covered writing" \hyperref[b1]{[2]}. 
\section[{II. RELATED WORK}]{II. RELATED WORK}\par
Most of the work has been carried out in the steganography field. Mainly steganography has been done on bit map pictures, gif pictures and on gray scale pictures. Researchers have given so many methods for image steganography as follows The purpose of steganography is hiding of data in to another data. As defined by Cachin \hyperref[b0]{[1]}, steganography is the art and science of communicating in such a way that the presence of a message cannot be detected. Steganography refers to the science of "invisible" communication. Unlike cryptography, where the goal is to secure communications from an eavesdropper, steganographic techniques strive to hide the very presence of the message itself from an observer \hyperref[b2]{[3]}. In recent years mobile phones are widely useful devices for communication. MMS (Multimedia Messaging Service) is a technology that allows a user of a properly enabled mobile phone to create, send, receive and store messages that include text, images, audio and video clips \hyperref[b5]{[6]}. Now a day's people are using cell phones and wireless technology too much. It is very convenient way for communication by sending SMS or MMS. We can also send MMS while we are talking over phone. There is not such application have been developed for mobile phone to hide the data. Hiding data in text message has implemented. In this paper mms technologies are used for sending message and data hiding technique for jpeg images is used as well as text hiding technique is used for steganography. Moreover, there are some constraints for the size of media text cannot exceed 30kB, an image must be below 100kB and a video must be smaller than 300kB \hyperref[b3]{[4]}.So many research have already been done in the field of image steganography but till now not any technique implemented for mobile jpeg steganography, in this paper Steganography has implemented for jpeg image on mobile. 
\section[{August}]{August}\par
, a) Ancient steganography\par
The first recorded use of steganography found from 440 BC back when Herodotus informed to Greece about forthcoming attack by writing a message on the wooden and covered it by wax. Another example of ancient steganography is Histiaeus who shaved the head of his slave and tattooed the message on it after hair grown message was hidden  {\ref [13]}.\par
Several steganography methods were used during II world war. Microdots developed by the Nazis are essentially microfilm chips created at highly magnification. These dots could contain pages of information and drawing etc. The Nazis also employed invisible ink and null ciphers \hyperref[b12]{[14]}.\par
Later on steganography came in the form of digital steganography .Digital steganography has been performed by various methods some of commonly used methods are as follows. 
\section[{b) Jsteg Algorithm}]{b) Jsteg Algorithm}\par
This algorithm made by Derek Upham. It was the first publicly available steganography system for JPEG. Its embedding algorithm sequentially replaces the least significant bit of DCT coefficient with message's data.\par
Jsteg algorithm: Input : message, cover images Output: stego image While data left to embed do Get next DCT coefficient from cover image if DCT ? 0 and DCT?1 then get next lsb from message replace DCT LSB with message LSB end if insert DCT into stego image end while \hyperref[b11]{[12]} c) F3 Algorithm It differs in double respect from jsteg: 1. Instead of overwriting bits it decrement the coefficient's absolute values in case their LSB does not match-except coefficient with the value zero, where we cannot decrement the absolute value. 2. Some embedded bits fall victim to shrinkage. due to receiver could not distinguish a zero coefficient, it skips all zero coefficients. Hence sender repeatedly embed the affected bits since he notice when he produces a zero \hyperref[b4]{[5]}. 
\section[{d) F4 Algorithm}]{d) F4 Algorithm}\par
It uses invert steganography and removes the drawback of F3 algorithm. Even positive coefficient shows zero and odd shows positive one. Even negative coefficient shows one and odd negative zero. \hyperref[b4]{[5]} e) F5 Algorithm This is developed by Andreas Westfield researcher specialized in steganography. Provably one of the most advance program publicly available. It uses matrix encoding technique. The best suitable technique for jpeg steganography is considered F5 algorithm \hyperref[b4]{[5]}. 
\section[{ALGORITHM:}]{ALGORITHM:}\par
1. JPEG compression. Stop after quantization. 2. Using password key initialize random number generator 3. Instantiate permutation 4. Determine the parameter k from the capacity of carrier medium and the length of secret message 5. Calculate the code word length n=2 k -1 6. Embed the secret message with (I, N, K) matrix encoding. 7. Continue JPEG compression \hyperref[b4]{[5]}.\par
In the mobile computation very less work has been done for steganography. Some research are as follows:\par
1. Text Steganography : In 2007 Mohammad Shirali Shahreza and M.Hassan Hasan Shirali Shahreza have given the new method for text steganography in SMS (Short Messaging Service). The purpose of this project is to hide information in SMS by abbreviations text steganography and with the use of SMS texting language \hyperref[b13]{[15]}. 2. Steganography in MMS : This work is also carried out by M. Shirali Shareza. He has given the algorithm for steganography in MMS using PNG format. He has described the new method of steganography using both text and images. First the data is broken into two parts. Each part size is proportionate to the capacity of the text and the image for hiding data. For example if the text has 10 bits capacity and the image has more than 200 bits capacity for hiding data, and the data which we want to hide is 60 bits, then we hide the data as follows: First we save the size of information which is stored in the MMS in the image, because knowing the size of the information is necessary for decoding correctly the information. Then we hide the first bit in the text. After that we hide 5 next bits in the image. Then we hide the 7th bit in the text. After that we hide 5 next bits in the image again. We do this loop until reach the end of data. For hiding data in the text part of MMS message, the mentioned text steganography method is used; and for hiding the data in image part of MMS message, the image steganography method is used \hyperref[b5]{[6]}. 
\section[{Steganography in SMS by Sudoku puzzle :}]{Steganography in SMS by Sudoku puzzle :}\par
This technique also presented by Shahreza and Shahreza \hyperref[b14]{[16]}. In this paper, they proposed a method of hiding data in Sudoku puzzle and arranged number in each row and column of Sudoku by permutations of 9!. For hiding the data, they place the numbers accordance with the desired permutations in a row or column of 9 x 9 sudoku puzzle. In view of this, we solve the Sudoku puzzle in which we want to hide the data. Then we replace certain row or column of this Sudoku puzzle in accordance with the permutation 1 through 9 which created \hyperref[b14]{[16]}. 
\section[{III. PEAK TO SIGNAL RATIO}]{III. PEAK TO SIGNAL RATIO}\par
Signal to noise (SNR) measures are estimates of the quality of a reconstructed image compared with an original image. The basic idea is to compute a single number that reflect the quality of the reconstructed image. The actual metric we compute is the peak signal to noise ratio of reconstructed image measure which is called PSNR \hyperref[b9]{[10]}.The PSNR is most commonly used as a measure of quality of reconstruction of lossy compression codec. The signal in this case is original data and the noise is the error introduced by the compression. When comparing compression codec it is used as an approximation to human perception of reconstruction quality, therefore in some cases one reconstruction may appear to be closer to the original than another, even though it has a lower PSNR (a higher PSNR would normally indicate that the reconstruction is of higher quality). It is most easily defined by the mean squared error (MSE) which for two m x n monochrome images I and K where one of the image is considered as a noisy expression of the other is defined as:\par
The PSNR in decibels (db) is computed using Here MAX I is the maximum possible pixel value of the image. When the pixels are represented using 8 bit per sample, this is 255 \hyperref[b10]{[11]}.\par
IV. 
\section[{PROPOSED METHOD}]{PROPOSED METHOD}\par
Previous work is carried out using text steganography and image steganography and for this purpose PNG (Portable Network Graphic) image is used. In the future work Author suggested that it could be implemented on JPEG file. So in this paper we have done the JPEG steganography-using concept of F5 algorithm \hyperref[b4]{[5]} we can summarize the method as follows:\par
In the first step partitioned plan in 8x8 pixel blocks. Secondly generate DCT [Discrete Cosine transform] Coefficient block. The basic idea for a steganography algorithm is that, embeds a secret message into a JPEG image is to alter the quantization step, the algorithm embeds more zeroes than ones, and this could be statistically detectable. Moreover, the histogram of the coefficients contains much odd than even coefficients. We also embedded text in text using text steganography \hyperref[b13]{[15]} a) Steps for procedure: Get the original message which is combination of text SMS and JPEG image Get the text to hide (Text which has to be hidden in original message) Encrypt the message before hiding. Count the length of message which has to be hide Check the possibility of receiving text to hide (limitation of hiding text) Hide the bits according to the order of (1,2,4,16,?) in the text. After completion in text part remaining bits hide in the image. For receiver side follow the procedure in reverse order. b) Step to hide in text: In all four cases we do not change more than one bit \hyperref[b4]{[5]}. 
\section[{d) Encryption for text:}]{d) Encryption for text:}\par
In this paper for encryption in text which has to be hide, "Tiny encryption Algorithm" has been used. It can be used as replacement of DES, and short enough to write in to almost any program on any computer \hyperref[b8]{[9]}.It has 32 rounds of simple processes which are shifts, additions and XORs. It is suitable encryption for J2ME implementation.  
\section[{RESULT}]{RESULT}\par
We have used different images to embed the data inside. Here one message is conveyed and text is hidden inside it. After embedding the whole message converted in capital letters and replacement has done according to few matching word list shown in table  {\ref 1}.\par
Table  {\ref 3} shows the PSNR value for different images hiding the same data. Original image contain the hidden data "Roopesh" which produce stego image. The PSNR value gives peak signal to nose ratio. Usually PSNR more than 35db is considered good quality so our results have the good values.    \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{I} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_1}Table I :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_2}Table 2 :}\end{figure}
 			\footnote{© 2011 Global Journals Inc. (US)} 			\footnote{August} 			\footnote{Domain", IEEE, Consumer Communications and Networking Conference (CCNC),pp.1-5,Jan2010.} 		 		\backmatter  			 
\subsection[{CONCLUSION}]{CONCLUSION}\par
Previously steganography was implemented using PNG images. Images contain different formats. Most widely used format is JPEG.F5 is the algorithm for JPEG steganography. In this paper it is implemented for steganography in MMS using JPEG over mobile communication. It is too much secure because data which has to be hide is encrypted first than embed in to message in both text as well as image. We can also develop the algorithm using wavelet transformation. Further study can be applied on audio steganography in MMS. 			 			  				\begin{bibitemlist}{1}
\bibitem[Wu et al. ()]{b11}\label{b11} 	 		‘A New Steganalytic Algorithm for Detecting Jsteg’.  		 			M Wu 		,  		 			Z Zhu 		,  		 			S Jin 		.  	 	 		\textit{Proceeding of the Network and Distributed System Symposium},  		Lecture Notes in Computer Scienceon Networking and Mobile Computing  		 (eeding of the Network and Distributed System SymposiumSanDiego,CA; Washington, D.C)  		2005. 2005. February 2002. NDSS2002 Internet Society. 3619 p. .  	 	 (Detecting Stegaraphic Content on the Internet) 
\bibitem[Wheeler et al. ()]{b8}\label{b8} 	 		‘A Tiny Encryption Algorithm’.  		 			R Wheeler 		,  		 			Needham 		,  		 			Tea 		.  	 	 		\textit{Proceeding of the 1995 Fast Software Encryption Workshop},  				 (eeding of the 1995 Fast Software Encryption Workshop)  		1995. Springer-Verlag. p. .  	 
\bibitem[Papapanagiotou et al. (2005)]{b3}\label{b3} 	 		‘Alternatives for multimedia messaging system steganography’.  		 			K Papapanagiotou 		,  		 			E Kellinis 		,  		 			G F Marias 		,  		 			P Georgiadis 		.  	 	 		\textit{IEEE International Conference on Computational Intelligence and Security (CIS 2005), Part II},  				 (Xian, China)  		Dec. 2005. 3802 p. .  	 
\bibitem[Cachin (2004)]{b0}\label{b0} 	 		‘An Information -Theoretic Model for Steganography’.  		 			Cachin 		.  	 	 		\textit{Journal of Information and Computation}  		July 2004. 192  (1)  p. .  	 
\bibitem[Zhang et al. (2009)]{b16}\label{b16} 	 		‘Classification Method of Jsteg Stego Images and F5 Stego-Images’.  		 			Q Zhang 		,  		 			Y Liu 		,  		 			S Zhang 		,  		 			K Chen 		.  	 	 		\textit{Fourth International Conference},  				Dec 2009. p. .  	 	 (Innovative Computing Information and control (ICICIC) 
\bibitem[Jain (1989)]{b9}\label{b9} 	 		\textit{Computer Vision, Graphics and image processing},  		 			A K Jain 		.  		June 1989. 46 p. 400.  	 	 (Fundamental of digital image processing) 
\bibitem[Dhobale et al. (2010)]{b15}\label{b15} 	 		 			D Dhobale 		,  		 			S B Patil 		,  		 			H S Patil 		.  		\textit{MMS Steganography for Smartphone Devices "Computer Engineering and Technology (ICCET), 2 nd International Conference},  				April 2010. 4 p. .  	 
\bibitem[Cheddad et al. (2010)]{b1}\label{b1} 	 		‘Digital image steganography: Survey and analysis of current Methods’.  		 			A Cheddad 		,  		 			J Condell 		,  		 			K Curran 		,  		 			P M Kevitt 		.  	 	 		\textit{Journal Signal Processing}  		March 2010. Elsevier. 90 p. .  	 
\bibitem[Hernandez et al.]{b7}\label{b7} 	 		‘Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers’.  		 			J C Hernandez 		,  		 			J M Sierra 		,  		 			A Ribagorda 		,  		 			B Ramos 		,  		 			J C Mex-Perera 		.  	 	 		\textit{Proceeding of the 8 th IMA international conference on Cryptography and Coding},  				 (eeding of the 8 th IMA international conference on Cryptography and Coding)  		p. .  	 
\bibitem[Hasan Shirali et al. (1998)]{b14}\label{b14} 	 		‘Exploring Steganography: Seeing the unseen’.  		 			M Hasan Shirali 		,  		 			M Shahreza 		,  		 			Sirali 		,  		 			Shahreza 		.  	 	 		\textit{Computer System and Applications, AICCSA, IEEE International Conference},  				 			. N F Johnson,  			S Jajodia 		 (ed.)  		March 2008. Feb-1998. p. .  	 	 (Steganography in SMS by Sudoku puzzle) 
\bibitem[Westfield ()]{b4}\label{b4} 	 		‘F5-steganographic algorithm: High capacity despite better steganalysis’.  		 			Westfield 		.  	 	 		Lecture Notes in Computer Science  		2001. Springer Verlag. 2137 p. .  	 
\bibitem[Chandramouli et al. ()]{b2}\label{b2} 	 		‘Image Steganography and Steganalysis: Concepts and Practice’.  		 			R Chandramouli 		,  		 			M Kharrazi 		,  		 			N Memon 		.  	 	 		\textit{International workshop on digital watermarking, IWDW 2003},  				2004. 2939 p. .  	 
\bibitem[Petitcolas et al. (1999)]{b12}\label{b12} 	 		‘Information Hiding -A Survey’.  		 			A P Petitcolas 		,  		 			R J Anderson 		,  		 			M G Kuhn 		.  	 	 		\textit{Proceeding of the IEEE},  				 (eeding of the IEEE)  		Jul 1999. 87 p. .  	 
\bibitem[Amoroso and Masotti (2006)]{b6}\label{b6} 	 		‘Lightweight steganography on smart phones’.  		 			M Amoroso 		,  		 			Masotti 		.  	 	 		\textit{3 rd IEEE Conference on Consumer Communications and Networking},  				2006. Jan. 2006. 2 p. .  	 
\bibitem[Mohsen and Marzieh (2008)]{b10}\label{b10} 	 		‘Performance evaluation of a JPEG-based multipledescription image coder’.  		 			M Mohsen 		,  		 			A Marzieh 		.  	 	 		\textit{Information Technology, ITSIM2008, International Symposium},  				August 2008. 4 p. .  	 
\bibitem[Sarreshtedari and Ghaemmaghami]{b17}\label{b17} 	 		 			S Sarreshtedari 		,  		 			S Ghaemmaghami 		.  		\textit{High Capacity Image Steganography in Wavelet},  				 	 
\bibitem[Shareja ()]{b5}\label{b5} 	 		‘Steganography in MMS’.  		 			Shirali Shareja 		,  		 			M 		.  	 	 		\textit{IEEE International Multitopic Conference},  				2007. 2007. p. .  	 
\bibitem[Shahreza et al. ()]{b13}\label{b13} 	 		‘Text Steganography in SMS’.  		 			M Shirali Shahreza 		,  		 			M H Shirali 		,  		 			Shahreza 		.  	 	 		\textit{Convergence Information Technology, International Conference},  				2007. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
