\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={Data Security using Tree Traversal},
 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{2015-01-15 (revised: 15 January 2015)}
\def\TheID{\makeatother }
\def\TheDate{2015-01-15}
\title{Data Security using Tree Traversal}
\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]{L. Eswara Chandra Vidya  Sagar}

             \affil[1]{  K L University}

\renewcommand\Authands{ and }

\date{\small \em Received: 11 December 2014 Accepted: 31 December 2014 Published: 15 January 2015}

\maketitle


\begin{abstract}
        


We all know that presently in 21st century one of the most emerging problem is Data Security. There is no guarantee that the data we have sent may be hacked by any Hacker or the data we have sent may reach correctly to the receiver or not. So many data security techniques have been emerged from past 2 to 3 years. But still we need a best technique to protect the data from third parties.Cryptography is an art of scrambling the data in order to provide security and confidentiality. Cryptography is being used in order for the securely transmission of the data. This paper provides a new idea for Data encryption and decryption in order to provide security for data.

\end{abstract}


\keywords{cryptography, encryption, decryption, hacker.}

\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 an art of hiding information. A lot of research has been done in the field of cryptography. There are various encryption algorithms used for secure data transmission. For example like security using Random number generator using chipper text and by using symmetric and asymmetric keys.\par
But still a new algorithms are emerging because still we require a better technique for data encryption and decryption. Better technique in a sense stronger the security. For a strong security so many persons are using two encryption algorithms at encryption side. But it takes long time for decryption.\par
Our technique Data security using Tree traversal overcomes the problem of week security because it is more difficult to decrypt the information by any unauthorized user.\par
In this mechanism we are using one of the important part of Data Structures that is Trees. Now let us discuss the topics required to be known in Data Structures to understand this paper.\par
Tree is a widely used abstract data type (ADT) or data structure implementing this ADT that simulates a hierarchical tree structure, with a root value and subtrees of children, represented as a set of linked nodes.\par
For example your family can also be represented in tree like your grandfather will be root your grandfather children's are nodes to your grandfather and your are node to your father like this a family can be represented in the form of a tree.\par
Author: Student K. L.University Vijayawada, India. e-mail: lingamsagar@gmail.com Tree traversal (also called tree search) could be a sort of graph traversal and refers to the method of visiting (examining and/or updating) every node in an exceedingly tree system, precisely once, in an exceedingly systematic method. Such traversals area unit classified by the order within which the nodes area unit visited.\par
There are mainly three types of tree traversals they are INORDER, PREORDER, POSTORDER. Order of visiting nodes by In-order is "Left Root Right" by Preorder is" Root Left Right" by Post-order is "Left Right Root" . These traversals are clearly represented in below diagram.  
\section[{Our Proposed idea}]{Our Proposed idea}\par
The Idea we are going to propose is mainly divided into two types one is mechanism followed at sender for encryption and another mechanism followed The steps to be followed during encryption is explained in below flow chart Arrange the text in the nodes in the form of BFS mechanism after arranging the text we will get an trees structure then apply the in-order and either pre-order or post-order on the arranged tree. Send the traversal outcomes to the receiver then receiver apply the decryption mechanism. This is explained with an example let us consider a text as "Hello World this is the new encryption technique" and node size as "7" means each node can hold 7 character including spaces provided in the text. Tree formed contains 7 nodes since when we divide length on the above string with node size we will get output as 7 i:e No. of Nodes=Abs ((length of string (49)/Node size (7)). 
\section[{Figure 4 : Example for encryption}]{Figure 4 : Example for encryption}\par
Pre-order and post-order is shown in the above diagram now apply in-order traversal to the above then send the in-order and pre-order traversal data to receiver. Receiver can decrypt only when he had inorder and either pre-order or post-order data otherwise no one can decrypt it. The steps to be followed at reception end by the desired receiver are First receiver have to receive both the in-order and either pre-order or post-order data. After that construct a tree with max 2 child for each node. After forming the tree apply the mechanism of BFS (Berth First Search). Detailed information about BFS can be available in Internet. When you apply the BFS for the tree formed from the received traversal data the receiver will get the original data send by the sender.\par
In this way the reception procedure follows the above procedure is explained with an example in below section along with required flow chart. 3\par
Take the sample example that is taken at sender side or for encryption. i:e "Hello World this is the new encryption technique". So receiver receives in-order and post-order for the above text.\par
In-order Data: "he neworld th encrypt Hello W ion tec is is t nique" Post-order Data: "he new encrypt orld th ion techniqueis is t Hellow ". After receiving the data construct a binary tree with the help of in-order and post -order data received after that apply the BFS you will get the required data.\par
Constructing a tree based on the traversal data is explained in this section. Before constructing we need to know is that for in-order the visiting of node sequence is left, root, right and for pre-order is root, left, right for post-order is left, right, root. First take the 7 characters from the received post-order data and match the position of selected data in in-order and keep it as root node for the tree that is to be constructed from the root node the left side text is left tree and right side text is right tree.\par
Follow the procedure till you reach the last node of a tree.\par
In this way a tree is constructed after constructing apply BFS. ? Developing of algorithm for this mechanism is somewhat complex.\par
III. 
\section[{Conclusion}]{Conclusion}\par
According to me this the best encryption and decryption techniques using tree traversal mechanism which provides high end security to the data and the development of the mechanism is explained in this paper completely.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}C}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-6.png}
\caption{\label{fig_4}GlobalCFigure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 6 :}\end{figure}
 			\footnote{© 2015 Global Journals Inc. (US)} 			\footnote{© 2015 Global Journals Inc. (US) 1} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[ Yadav in IJECT (2011)]{b2}\label{b2} 	 		\textit{},  		 ISSN : 2230-9543.  	 	 		\textit{Yadav in IJECT}  		 2230-7109.  		June 2011. 2.  	 	 (Print) 
\bibitem[2. Data Encryption and Decryption using Deterministic Random Key for Transmission: A Review" by Er Obaida Mohammad Awad Al-Hazaimeh in International Journal of Computer Networks & Communications (IJCNC) (2013)]{b0}\label{b0} 	 		‘2. Data Encryption and Decryption using Deterministic Random Key for Transmission: A Review" by Er’.  	 	 		\textit{Obaida Mohammad Awad Al-Hazaimeh in International Journal of Computer Networks \& Communications (IJCNC)}  		 2277 128X.  		March 2013. August 2013. 5  (2) .  	 	 (A New Approach For Complex Encrypting And Decrypting Data. Vidiksha1 in JARCSSE) 
\bibitem[Bhati1 Bhati2 Sharma3 ()]{b3}\label{b3} 	 		‘A New Approach towards Encryption Schemes: Byte -Rotation Encryption Algorithm’.  	 	 		\textit{WCECS 2012},  				 			Sunita Bhati1,  			Anita Bhati2,  			S K Sharma3 		 (ed.)  		 (San Francisco, USA)  		October 24-26, 2012.  	 
\bibitem[A Novel Approach for Data Security Enhancement Using Multi Level Encryption scheme Sai ram Natarajan #1 ()]{b4}\label{b4} 	 		‘A Novel Approach for Data Security Enhancement Using Multi Level Encryption scheme’.  	 	 		\textit{Sai ram Natarajan \#1},  				2011. 2.  	 	 (Research paper, IJCSIT) 
\bibitem[Vinod Shokeen (ed.)]{b1}\label{b1} 	 		\textit{Encryption and Decryption Technique for Message Communication},  		Vinod Shokeen (ed.)  		p. 2N.  	 
\bibitem[Trinca ()]{b5}\label{b5} 	 		‘Sequential and Parallel Cascaded Convolution Encryption with Local Propagation: Toward Future Directions in Cryptography’.  		 			Dragos Trinca 		.  	 	 		\textit{Proceedings of The third International Conference on information Technology-New Generations. (ITNG'06)},  				 (The third International Conference on information Technology-New Generations. (ITNG'06))  		2006. IEEE Computer Society.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
