\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={Enhancement of Confidentiality of Data Transmitted Over Covert Channel Using Grid Cipher Scheme},
 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{2012-01-15 (revised: 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01-15}
\title{Enhancement of Confidentiality of Data Transmitted Over Covert Channel Using Grid Cipher Scheme}
\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]{Dr. Raju Singh  Kushwaha}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 6 December 2011 Accepted: 31 December 2011 Published: 15 January 2012}

\maketitle


\begin{abstract}
        


In this fast developing world, the interchange of information is playing a key role. Everything needs information and processes them. This interchange of information needs an authentication, confidentiality and integrity. The security of information is provided many algorithms. There are vast numbers of algorithms for symmetry key cipher. All these algorithms have used either complicated keys to encrypt the plain text to cipher text or a complicated algorithms used for it. The level of security of algorithms is dependent on either number of iterations or length of keys. A comparative study have been made with RSA, DES, IDEA, BAM and other algorithms with frequency distribution, bit ratio to check the security level of proposed algorithm. Finally, a comparison has been made for time complexity for encryption of plain text and decryption from cipher text with above existing algorithms.

\end{abstract}


\keywords{Plain text, cipher text, symmetric key algorithm, grid, RSA Algorithm time complexity and frequency distributions.}

\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
ryptography is the study of transmitting secret messages securely from sender to receiver. \hyperref[b3]{[4]}The original text, called plain text it's encrypted form is called cipher text, which is sent to the receiver. The recipient decrypts the text to get the plain text. The model of secret key system, first proposed by Shannon ( \hyperref[b3]{[4]}) is shown in figure1.\par
Figure  {\ref 1}: The model of secret key system proposed by shannon There are many algorithms had developed to providing security of information but each of them having some merits and demerits. There is no single algorithm is sufficient to provide security. In this paper, an effort has been made to develop a new block cipher algorithms using a set of 16 grids where each grid is 4X4 matrix \hyperref[b1]{[2]}. Each grid is capable to store 16 characters and finally, all ASCII characters value has Author : Assistant Professor Department of Computer Science Sri Ram Murti Smarak College of Engineering \& Technology, Bareilly, (U.P.), India. . E-mail : rajukushwaha36@gmail.com been stored in grid set. The algorithm has been performing two steps. In first step, the plaintext has been broken into number of block eight characters. Each character from each block has been converted into bit stream and placed in the grid set. After placing all characters, new bit stream for each character of the block has been calculated using grid number, row number and column number. In second step, the stream bit is consist of eight bit for single character, calculate their decimal value and assigns the ASCII character for this decimal value. [6]To ensure the security of encryption algorithm many effects have done. These are avalanche, bit ratio, non-homogeneity and time complexity. The avalanche effect means a small change in plain text (or key) should produce a significant change in cipher text. \hyperref[b3]{[4]}The bit ratio effect means the changes the bit values from same position between plain text and cipher text. The non-homogeneity test is a technique to test nonhomogeneity of the source and encrypted file. The time complexity defines how efficiently the proposed algorithm will encrypt the plain text and decrypt from encrypted text. 
\section[{II.}]{II.}\par
Literature survey \hyperref[b3]{[4]} In this paper, the Frame based encryption process is proposed, this is also block cipher scheme which break the plain text into eight character size block. Find their positional value from the frame and put their corresponding ASCII value. This forms a 8-bit stream of data which is swapped with another string and generate their ASCII character. This character is send to the receiver.\par
[2] In this paper, the proposed algorithm used the 26 characters, 10 numerals and single space character. This form a block of 37 characters, when plain text is encrypted into cipher text the plain text character is taken their value from this block of 37 character and form a matrix of order 3*3. Select a Key matrix of same order and encrypt the data with this process and result is taken modulus by 37. Cipher text is generated and sends to the receiver. \hyperref[b4]{[5]} In this paper, the proposed algorithm compress the plain text with arithmetic algorithm the resultant value of compress data is encrypt with RSA algorithm, the cipher text is generated and send to the receiver.\par
Hill cipher's or linear block cipher is susceptible to cryptanalysis and unusable in practice, still serves an important pedagogical role in both cryptology and linear algebra. It is this role in linear algebra that raises several interesting questions \hyperref[b0]{[1]}.\par
In this paper, the proposed algorithm is a modified form of RSA algorithm named RSA1, which enhance the security of RSA algorithm. The resultant value of RSA algorithm is converted into corresponding ASCII character value and then send to the receiver. \hyperref[b6]{[7]} III. 
\section[{Proposed work}]{Proposed work}\par
The algorithms are based on the grid. A single grid consists of 16 characters. Then total number of grid is16 required for representing ASCII set. The total ASCII character are 256. 
\section[{Algorithms: a) Sender Prospects: Encryption}]{Algorithms: a) Sender Prospects: Encryption}\par
Step 1: Represent each character of plain text by another character which is equivalent a number, generated from reference grid model .Then, the substitute character is represented by the bit sequence (x,y,frame no).\par
Step 2: Grouping the modified plain text into blocks of eight characters. If modified test is not properly divided by eight then blank characters will be padded with last block.\par
Step 3: Convert each block into equivalent bit streams.\par
Step 4: This bit stream converted into Decimal equivalent.\par
Step 5: Apply RSA algorithm to encrypt this decimal value.\par
Step 5.1: Select two prime number P,Q; Calculate n=P*Q;; Calculate \textunderscore (n)= (P-1)*(Q-1); Select integer e; gcd(f(n),e)=1; 1<e<f(n); Calculate d; d=e\textasciicircum -1 mod f(n); Public key KU= \{e, n\}; Private Key KR= \{d, n\};\par
Step 5.2: Encryption Plain text : M< n Cipher Text : C=M\textasciicircum e (mod n);\par
Step 6: This Decimal value is changed into ASCII character. This is cipher Text.\par
Step 7: Repeat steps 2 to 5 until all characters of plain text become converted into cipher text. 
\section[{b) Receiver Prospects}]{b) Receiver Prospects} 
\section[{Decryption}]{Decryption}\par
Step 1: Take cipher text and extract ASCII Character Value individual.\par
Step 2: Change this value into decimal Equivalent.\par
Step 2.1: Decryption Cipher Text : C Plain Text : M = C\textasciicircum d (mod n);\par
Step 3: Convert this decimal into bit stream.\par
Step 4: First Two bit represent X-axis, Second two bit Represent Y-axis and remaining four bit represent grid number. Match bit stream with above process and take the ASCII value.\par
Step 5: Convert This ASCII Value into Character set.\par
Step V. 
\section[{Conclusion \& future scope}]{Conclusion \& future scope}\par
It is observed from the result the proposed algorithm is extremely efficient and a sufficiently strong encryption algorithm enhance the security of data transmitted over covert channel. A degree of freedom value of 256 ensures the maximum variety of characters in the cipher text which ensures its strength against an attack. Frequency Distribution also speaks the encrypted character evenly distributed from 0 to 255. So, it has been made more difficult for attacker to recover plain text from cipher text. This algorithm provide security over data in two ways , Firstly the arrangement of grid is only known by both parties only and secondly the key is used in RSA algorithm is also unpredictable by the intruders. There is some extra effort have made in grid and their storage format then this algorithm give more better result in terms of security and speed of encryption \& Decryption.\begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Part 2}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{figure3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.021794871794871794\textwidth}P{0.4762179487179487\textwidth}P{0.09589743589743589\textwidth}P{0.05230769230769231\textwidth}P{0.05448717948717948\textwidth}P{0.06538461538461539\textwidth}P{0.04141025641025641\textwidth}P{0.0425\textwidth}}
\tabcellsep \tabcellsep \tabcellsep IV.\tabcellsep \multicolumn{2}{l}{Result}\\
\tabcellsep \multicolumn{3}{l}{a) Sender Prospects}\tabcellsep \tabcellsep \\
\tabcellsep \multicolumn{6}{l}{Take the word "Crypto" encrypt this with the}\\
\tabcellsep \multicolumn{3}{l}{help of above algorithm.}\tabcellsep \tabcellsep \\
\tabcellsep Plain\tabcellsep ASCII\tabcellsep \multicolumn{2}{l}{(X,Y,}\tabcellsep \multicolumn{2}{l}{Bit stream}\tabcellsep Convert\\
\tabcellsep text\tabcellsep Value\tabcellsep \multicolumn{2}{l}{Grid No)}\tabcellsep \tabcellsep decimal No\\
\tabcellsep C\tabcellsep 67\tabcellsep \multicolumn{2}{l}{0,3,3}\tabcellsep \multicolumn{2}{l}{00110011}\tabcellsep 51\\
\tabcellsep R\tabcellsep 114\tabcellsep \multicolumn{2}{l}{0,2,6}\tabcellsep \multicolumn{2}{l}{00100110}\tabcellsep 38\\
2012\tabcellsep Y P T\tabcellsep 121 112 116\tabcellsep \multicolumn{2}{l}{2,1,6 0,0,6 1,0,6}\tabcellsep \multicolumn{2}{l}{10010110 00000110 01000110}\tabcellsep 150 70 06\\
May\tabcellsep O\tabcellsep 111\tabcellsep \multicolumn{2}{l}{3,3,5}\tabcellsep \multicolumn{2}{l}{11110101}\tabcellsep 245\\
\tabcellsep \multicolumn{6}{l}{Apply RSA algorithm to encrypt this decimal}\\
\tabcellsep \multicolumn{6}{l}{value and the resultant cipher text is== 3\&--F<õ}\\
\tabcellsep \multicolumn{3}{l}{b) Receiver Prospects}\tabcellsep \tabcellsep \\
\tabcellsep \multicolumn{6}{l}{Sender \& Receiver both are well known}\\
\tabcellsep \multicolumn{6}{l}{algorithm \& encrypted text is in ASCII Format. Receive}\\
\tabcellsep \multicolumn{6}{l}{the Cipher Text C= 3\&--F<õ , Apply RSA algorithm to}\\
\tabcellsep \multicolumn{6}{l}{decrypt the cipher text in Decimal value format.}\\
\tabcellsep Decimal\tabcellsep \multicolumn{2}{l}{Bit Stream}\tabcellsep \multicolumn{2}{l}{(X, Y,}\tabcellsep ASCII\tabcellsep Plain\\
\tabcellsep Value\tabcellsep \tabcellsep \tabcellsep \multicolumn{2}{l}{Grid}\tabcellsep Value\tabcellsep Text\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \multicolumn{2}{l}{No)}\\
\tabcellsep 51\tabcellsep \multicolumn{2}{l}{00110011}\tabcellsep \multicolumn{2}{l}{0,3,3}\tabcellsep 67\tabcellsep C\\
\tabcellsep 38\tabcellsep \multicolumn{2}{l}{00100110}\tabcellsep \multicolumn{2}{l}{0,2,6}\tabcellsep 114\tabcellsep R\\
\tabcellsep 150\tabcellsep \multicolumn{2}{l}{10010110}\tabcellsep \multicolumn{2}{l}{2,1,6}\tabcellsep 121\tabcellsep Y\\
\tabcellsep 70\tabcellsep \multicolumn{2}{l}{00000110}\tabcellsep \multicolumn{2}{l}{0,0,6}\tabcellsep 112\tabcellsep P\\
( D D D D ) E\tabcellsep 06 245\tabcellsep \multicolumn{2}{l}{01000110 11110101}\tabcellsep \multicolumn{2}{l}{1,0,6 3,3,5}\tabcellsep 116 111\tabcellsep T O\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Nalini and Rao]{b1}\label{b1} 	 		\textit{A New Encryption and Decryption Algorithm Combining the Features of Genetic Algorithms(GA) and Cryptography},  		 			G Nalini 		,  		 			Raghavendra Rao 		.  		 	 
\bibitem[Bowman]{b5}\label{b5} 	 		 			John C Bowman 		.  		\textit{Math 422 Coding Theory \& Cryptography},  				 (Edmonton, Canada)  		 		 			University of Alberta 		 	 
\bibitem[Shannan ()]{b0}\label{b0} 	 		‘Communication Theory of Security System’.  		 			C E Shannan 		.  	 	 		\textit{Bell, System Technical Journal}  		1949. 28 p. .  	 
\bibitem[Singh and Vatsa]{b4}\label{b4} 	 		‘Confidentiality \& Authentication Mechanism For Bio-Metrics Information transmitted over Low Bandwidth channel’.  		 			Raju Singh 		,  		 			A K Vatsa 		.  	 	 		\textit{International Journal of Network Security \& it's Application}  		3 p. 3.  	 
\bibitem[Feistel ()]{b2}\label{b2} 	 		‘Cryptography and Computer Privacy’.  		 			H Feistel 		.  	 	 		\textit{Scientific American}  		1973. 228  (5)  p. .  	 
\bibitem[Uttam Kr Mondal and Mondal ()]{b3}\label{b3} 	 		‘Frame Based Symmetric Key Cryptography’.  		 			Satyendranath Uttam Kr Mondal 		,  		 			Mondal 		.  	 	 		\textit{Int. J. Advanced Networking and Applications}  		2011. p. .  	 
\bibitem[RSA-2 Algorithm Speed and Security enhancement through public key cryptography International Journal of Engineering Science & Technology ()]{b6}\label{b6} 	 		‘RSA-2 Algorithm Speed and Security enhancement through public key cryptography’.  	 	 		\textit{International Journal of Engineering Science \& Technology}  		2010. 2  (8)  p. .  	 	 (J. SaiGeethaet. al.) 
\end{bibitemlist}
 			 		 	 
\end{document}
