\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={Implementation of AES with Time Complexity Measurement for Various Input},
 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-03-15 (revised: 15 March 2015)}
\def\TheID{\makeatother }
\def\TheDate{2015-03-15}
\title{Implementation of AES with Time Complexity Measurement for Various Input}
\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]{Shraddha  More}

             \affil[1]{  Mumbai university}

\renewcommand\Authands{ and }

\date{\small \em Received: 11 February 2015 Accepted: 2 March 2015 Published: 15 March 2015}

\maketitle


\begin{abstract}
        


Network Security has a major role in the development of data communication system, where more randomization in the secret keys increases the security as well as the complexity of the cryptography algorithms. In the recent years network security has become an important issue. Cryptography has come up as a solution which plays a vital role in the information security system against various attacks. This security mechanism uses the AES algorithm to scramble data into unreadable text which can only be decrypted with the associated key. The AES algorithm is limited only for text as an input. It also has, the more time complexity. So it suffers from vulnerabilities associated with another type of input and time constraints. So its challenge to implement the AES algorithm for various types of input and require less decryption time. The propose work demonstrate implementation of a 128-bit Advanced Encryption Standard (AES), which consists of both symmetric key encryption and decryption algorithms for input as a text, image and audio. It also gives less time complexity as compared to existing one. At the last stage comparing the time complexity for encryption and decryption process for all three types of input. This paper also demonstrates a side channel attack on the standard software implementation of the AES cryptographic algorithm.de

\end{abstract}


\keywords{side channel attack, aes, des, rsa, encryption, decryption, cryptography, network security..}

\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[{ImplementationofAESwithTimeComplexityMeasurementforVariousInput}]{ImplementationofAESwithTimeComplexityMeasurementforVariousInput}\par
Strictly as per the compliance and regulations of: Introduction ryptography plays an important role in the security of data transmission. Data Security is a challenging concern of data communications that focuses on many areas including secure communication channel and strong data encryption technique. The secure transmission of confidential data enclosed gets a great deal of attention because of the rapid development in information technology. The predictable methods of encryption can only maintain the data security. The development of computing technology imposes stronger requirements on the cryptography schemes. The rapidly growing number of wireless communication users has led to the increasing demand for security measures and devices to protect user data transmitted over wireless channels \hyperref[b0]{[1]}.\par
Two types of cryptographic systems have been developed for that purpose symmetric (secret key) and asymmetric (public key) cryptosystems. Symmetric cryptography, such as in the Data Encryption Standard (DES), 3DES, and Advanced Encryption Standard (AES) uses an identical key of the sender to encrypt the message text and receiver to decrypt the encrypted text. Asymmetric cryptography, such as the Rivest-Shamir-Adleman (RSA) uses different public keys for encryption and decryption, eliminating the key exchange problem. \hyperref[b1]{[2]} Symmetric cryptography is more suitable for the encryption of a large amount of data. The Data Encryption Standard (DES) has been used by the U.S. government standard since 1977. However, now, it can be cracked quickly and inexpensively. The AES algorithm defined by the National Institute of Standards and Technology (NIST) of the United States has widely accepted to replace DES as the new symmetric encryption algorithm \hyperref[b2]{[3]}. This above cryptographic algorithms are not more secure. To overcome the vulnerabilities in network security in 2000, the Advanced Encryption Standard (AES) replaced the DES to meet the ever-increasing requirements for security. In cryptography, the AES, also called as Rijndael, is a block cipher adopted as an encryption standard by the US government, which specifies an encryption algorithm capable of protecting sensitive information \hyperref[b3]{[4]}. The Rijndael algorithm is a symmetric block cipher that can encrypt and decrypt information. Encryption converts data into an unintelligible form called cipher-text. Decryption of the cipher-text converts the data back into its unique form which is called plaintext. The AES algorithm supports 128, 192 and 256 bit key length to encrypt and decrypt data in blocks of 128 bits , hence the name AES-128, AES-192 and AES-256 respectively \hyperref[b4]{[5]}. The hardware implementation of the AES algorithm can provide high performance, low cost for specific applications and trustworthiness compared to its software counterparts \hyperref[b5]{[6]}.\par
The organization of the paper is as follows, Section II describes the design overview of AES algorithm for both encryption and decryption. Section III presents implementation Details, Section IV is discussed on Experimental Results. Section V projects on future scope and conclusion. 
\section[{II.}]{II.} 
\section[{Design Overview of aes}]{Design Overview of aes}\par
AES is a symmetric block cipher with block length of 128 bits. It allows three different key lengths 128,192 and 256 bits. In encryption process processing of 128 bit keys required for 10 rounds, 192 bit keys required for 12 rounds and 256 bit keys required for 14 rounds which is shown in table1. AES is a round based algorithm. For encryption and decryption each round has four functions excepting last round. Last round required three functions. The encryption algorithm has four round functions SubByte( ), ShiftRows( ), MixColumn( )and AddRoundKey( ). The decryption, also has the same number of rounds with reverse transformation, order of round function is different i.e. InvShiftRow( ), InvSubByte( ), AddRoundKey( ) and InvMixColumn( ) \hyperref[b1]{[2]}- \hyperref[b2]{[3]}.  
\section[{a) AES Encryption Algorithm}]{a) AES Encryption Algorithm}\par
The Encryption process consists of a number of different transformations applied consecutively over the data block bits in a fixed number of iterations which is called as rounds. The number of rounds depends on the length of the key used for the encryption process. 10 iterations are required for key length of 128 bits.\par
i. High-level description of the algorithm KeyExpansions -round keys are derived from the cipher key using Rijndael's key schedule. AES requires a separate 128-bit round key block for each round plus one more.\par
ii. InitialRound 1. AddRoundKey( )-Each byte of the state is combined with a block of the round key using bitwise xor. Rounds 2. SubBytes( )-A non-linear substitution step where each byte is replaced with another according to a lookup table. 3. ShiftRows( )-A transposition step where the last three rows of the state are shifted cyclically a certain number of steps. 
\section[{MixColumns( )-A mixing operation which operates}]{MixColumns( )-A mixing operation which operates}\par
on the columns of the state, combining the four bytes in each column. iii. Final Round (No MixColumns) SubBytes( ) ShiftRows( ) AddRoundKey( ).\par
Steps : These steps are used to encrypt128-bit block. 1. The set of round keys from the cipher key. 2. Initialize state array and add the initial round key to the starting state array. 3. Perform round = 1 to 9 : Execute Usual Round.\par
4. Execute Final Round. 
\section[{Corresponding cipher text chunk output of Final Round}]{Corresponding cipher text chunk output of Final Round}\par
Step iv. Encryption process Each round consists of the following four steps: SubBytes Transformation: In this transformation, each of the byte in the state matrix is replaced with another byte as per the S-box (Substitution Box) \hyperref[b6]{[7]}. The S-box is generated by firstly calculating the respective reciprocal of that byte in GF (2\textasciicircum 8) and then affine transform is applied. ShiftRows Transformation: In this transformation, the bytes in the first row of the State do not change. The second, third, fourth and fifth rows shift cyclically to the left by one byte, two bytes, three bytes and four bytes respectively \hyperref[b6]{[7]}. MixColumns Transformation: It is the operation that mixes the bytes in each column by the multiplication of the state with a fixed polynomial matrix \hyperref[b6]{[7]}. It completely changes the scenario of the cipher even if all bytes look very similar. The Inverse Polynomial Matrix does exist in order to reverse the mix column transformation. 
\section[{AddRoundKey}]{AddRoundKey}\par
Transformation:\par
In AddRoundKey transformation, a roundkey is added to the State by bitwise Exclusive-OR (XOR) operation. AddRoundKey proceeds onecolumn at a time. AddRoundKey adds a roundkey word with each state column matrix.The operation performed in AddRoundKey is matrix addition. 
\section[{b) AES Decryption Algorithm}]{b) AES Decryption Algorithm}\par
Decryption is the process of extracting the plaintext from cipher text. For decryption the same process occurs simply in reverse order by taking the 128-bit block of cipher text and converting it to plaintext by the application of the inverse of the four operations. Decryption involves reversing all the steps taken in encryption using following inverse functions. InvSubBytes Transformation: InvSubBytes is the inverse transformation of SubBytes, in which the inverse S-box is applied to individual bytes in the State. The inverse Sbox is constructed by first applying the inverse of the affine transformation, then computing the multiplicative inverse in GF(2\textasciicircum 8).\par
InvShiftRows Transformation: InvShiftRows is the inverse transformation of ShiftRows. In this transformation, the bytes in the first row of the State do not change. The second, third, and fourth and fifth rows are shifted cyclically by one byte, two bytes, three bytes and four bytes to the right respectively \hyperref[b1]{[2]}. InvMixColumns Transformation: InvMixColumns is the inverse transformation of MixColumns. This is a complex procedure as it involves severely the byte multiplication under GF (2\textasciicircum 8) \hyperref[b1]{[2]}. 
\section[{Key Expansion (Keyexpansion Operation)}]{Key Expansion (Keyexpansion Operation)}\par
Keyexpansion refers to the process in which the 128 bits of the original key are expanded into eleven 128-bit round keys.\par
To compute round key (n+1) from round key (n) these steps are performed: 1. Compute the new first column of the next round key.\par
First all the bytes of the old fourth column have to be substituted using the Subbytes operation. These four bytes are shifted vertically by one byte position and then XORed to the old first column. The result of these operations is the new first column. The key expansion algorithm generates 128 bit key for each round and one more key for initial AddRoundKey function. The same expanded key is used for encryption and decryption except for decryption it reads in reverse order. 
\section[{III.}]{III.} 
\section[{Implementation Details}]{Implementation Details}\par
The system proposing aims to achieve network security by implementing appropriate countermeasures based on concept of constant time encryption against side channel timing attack to protect implementations of secret key cryptography. The contribution work includes implementing more suitable countermeasures against side channel attack.\par
The propose system, is intended to provide secure transmission of data over the network by implementing the appropriate countermeasures against side channel attack on AES implementation which is shown in Fig. \hyperref[fig_0]{2}. Here the work implementing AES 128bit algorithm using 10 rounds by taking input as text, image and audio. In AES encryption process, system  performs round functions like SubByte( ), ShiftRows( ), MixColumn( ) and AddRoundKey( ). On the other side, the decryption processperforms round functions like InvShiftRow( ), InvSubByte( ), AddRoundKey( ) and InvMixColumn( ). After that the work implementing side channel attack on the AES implementation in such a way that the receiver cannot decrypt the encrypted data. After successful implementation of side channel attack, research work implementing some appropriate countermeasures against side channel attack on AES implementation and finally evaluating their performance and soundness to prevent possible vulnerabilities and develop more secure systems. The work implemented AES 128-bit, 10 rounds algorithm by taking input as text, image and audio. 
\section[{Encryption Process when input as an Text file Decryption Process when input as an Text file}]{Encryption Process when input as an Text file Decryption Process when input as an Text file}\par
The work implemented 128 bit AES algorithm (10 round) decryption using text as an input by measuring performance parameter as time complexity which is shown in Fig. \hyperref[fig_5]{4}.Time required for decryption process is 2.128282 milliseconds. 
\section[{Encryption Process when input as an audio file}]{Encryption Process when input as an audio file}\par
The work implemented 128 bit AES algorithm (10 round) encryption using audio as an input by measuring performance parameter as time complexity which is shown in Fig. \hyperref[fig_7]{5}.Time required for encryption process is 13.899532 milliseconds. The work implemented 128 bit AES algorithm (10 round) encryption using text as an input by measuring performance parameter as time complexity which is shown in Fig.  {\ref 3}.Time required for encryption process is 1.166557 milliseconds. 
\section[{Decryption Process when input as an audio file}]{Decryption Process when input as an audio file}\par
The work implemented 128 bit AES algorithm (10 round) decryption using audio as an input by measuring performance parameter as time complexity which is shown in Fig. \hyperref[fig_6]{6}.Time required for decryption process is 20.183485milliseconds. 
\section[{Encryption Process when input as an Image file}]{Encryption Process when input as an Image file}\par
The work implemented 128 bit AES algorithm (10 round) encryption using image as an input by measuring performance parameter as time complexity which is shown in Fig. \hyperref[fig_9]{7}. Time required for encryption process is 61.958627 milliseconds.      
\section[{Decryption Process when input as an Image file}]{Decryption Process when input as an Image file} 
\section[{Experimental Results}]{Experimental Results}\par
In this section The work presented result graph of our proposed system, implementation of the AES algorithm by taking text, image and audio as input    
\section[{Conclusion Andfuture Scope}]{Conclusion Andfuture Scope}\par
Due to the increasing needs for secure communications a safer and more secured cryptographic algorithm has to be proposed and implemented. The Advanced Encryption Standard (AES-128bit) is widely used nowadays in many applications. In this paper, the work implemented an efficient AES128 bit encryption and decryption algorithm. The execution time for AES encryption and decryption is calculated by performing 10 round functions. The system presented an attack on AES software implementations. Future work will focus on investigating and implementing a number of countermeasures against side channel attack on AES implementation and have evaluated their performance and soundness to prevent possible vulnerabilities and develop more secure systems.   
\section[{Global}]{Global}\begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-2.png}
\caption{\label{fig_0}2 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}©}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{143}\includegraphics[]{image-6.png}
\caption{\label{fig_4}14 GlobalFigure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{89}\includegraphics[]{image-10.png}
\caption{\label{fig_8}Figure 8 :Fig. 9 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-11.png}
\caption{\label{fig_9}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-12.png}
\caption{\label{fig_10}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{9}\includegraphics[]{image-13.png}
\caption{\label{fig_11}Figure 9 :}\end{figure}
    \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.5084821428571429\textwidth}P{0.11383928571428571\textwidth}P{0.11383928571428571\textwidth}P{0.11383928571428571\textwidth}}
AES\tabcellsep AES-128\tabcellsep AES-192\tabcellsep AES-256\\
PARAMETERS\tabcellsep \tabcellsep \tabcellsep \\
Key Size (Bits)\tabcellsep 128\tabcellsep 192\tabcellsep 256\\
Number of\tabcellsep 10\tabcellsep 12\tabcellsep 14\\
rounds\tabcellsep \tabcellsep \tabcellsep \\
Plaintext box\tabcellsep 128\tabcellsep 128\tabcellsep 128\\
size (Bits)\tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 			\footnote{© 2015 Global Journals Inc. (US) 1} 			\footnote{© 2015 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Daemen and Rijmen]{b20}\label{b20} 	 		\textit{},  		 			J Daemen 		,  		 			V Rijmen 		.  	 	 		\textit{Rijndael}  		 (2) .  	 
\bibitem[Su et al. ()]{b2}\label{b2} 	 		‘A high throughput low cost AES processor’.  		 			Chih-Pin Su 		,  		 			Tsung-Fu Lin 		,  		 			Chih-Tsun Huang 		,  		 			Cheng-Wen Wu 		.  	 	 		\textit{IEEE Communications Magazine},  				2003.  	 
\bibitem[Dr et al. ()]{b10}\label{b10} 	 		‘A Study of Encryption Algorithms AES, DES and RSA forSecurity’.  		 			Dr 		,  		 			Prerna Mahajan \& Abhishek 		,  		 			Sachdeva 		.  	 	 		\textit{Global Journal of Computer Science and Technology Network},  				2013. 13 p. .  	 
\bibitem[Hiremath and Suma]{b14}\label{b14} 	 		‘Advanced Encryption Standard Implemented on FPGA’.  		 			S Hiremath 		,  		 			M S Suma 		.  	 	 		\textit{IEEE Inter},  				 	 
\bibitem[Jain et al. (2014)]{b5}\label{b5} 	 		‘AES Algorithm Using 512 Bit Key Implementationfor Secure Communication’.  		 			Rishabh Jain 		,  		 			Rahul Jejurka2 		,  		 			Shrikrishna Chopade 		,  		 			Someshwar Vaidya 		,  		 			Mahesh Sanap 		.  	 	 		\textit{International Journal of Innovative Research in Computerand Communication Engineering}  		March 2014. 2 p. .  	 
\bibitem[Gnanambika et al. (2013)]{b4}\label{b4} 	 		‘AES-128 Bit Algorithm Using Fully Pipelined Architecture for Secret Communication’.  		 			M Gnanambika 		,  		 			S Adilakshmi 		,  		 			Dr Noorbasha 		.  	 	 		\textit{International Journal of Engineering Research and Applications}  		March -April 2013. 3 p. .  	 
\bibitem[Kuo and Verbauwhede (2001)]{b11}\label{b11} 	 		‘Architectural optimization for a 1.82 Gbits/sec VLSIimple mentation of the AES Rijndael algorithm’.  		 			H Kuo 		,  		 			I Verbauwhede 		.  	 	 		\textit{Proc. CHES},  				 (CHESParis, France)  		2001. May 2001. p. .  	 
\bibitem[Khatri et al. (2012)]{b12}\label{b12} 	 		‘Comparison of power consumption and strict avalanche criteria at encryption/Decryption side of Different AES standards’.  		 			Navraj Khatri 		,  		 			Rajeev Dhanda 		,  		 			Jagtar Singh 		.  	 	 		\textit{International Journal Of Computational Engineering Research}  		August 2012. 2.  	 
\bibitem[Conf. Comp Elec Engin. (IECEE) (2009)]{b15}\label{b15} 	 		\textit{Conf. Comp Elec Engin. (IECEE)},  				Dec.2009. 02 p. .  	 
\bibitem[Stallings]{b19}\label{b19} 	 		\textit{Cryptography and network security},  		 			W Stallings 		.  		 	 
\bibitem[Soumya and Shyam Kishore (2013)]{b8}\label{b8} 	 		‘Design and Implementation of Rijndael Encryption Algorithm Based on FPGA’.  		 			K Soumya 		,  		 			G Shyam Kishore 		.  	 	 		\textit{International Journal of Computer Science and Mobile Computing}  		September 2013. 2  (9)  p. .  	 
\bibitem[Ritika and Kuldeep]{b16}\label{b16} 	 		\textit{Efficiency and Security of Data with Symmetric Encryption},  		 			Chehal Ritika 		,  		 			Singh Kuldeep 		.  		 	 
\bibitem[Pahal and Kumar (2013)]{b7}\label{b7} 	 		‘Efficient Implementation of AES’.  		 			Ritu Pahal 		,  		 			Vikas Kumar 		.  	 	 		\textit{International Journal of Advanced Research in Computer Science and Software Engineering}  		July 2013. 3 p. .  	 
\bibitem[Federal Information Processing Standards Publication 197 (2001)]{b3}\label{b3} 	 		\textit{Federal Information Processing Standards Publication 197},  		Nov. 2001.  	 	 (Advanced Encryption Standard (AES)) 
\bibitem[Zhang and Parhi ()]{b1}\label{b1} 	 		‘Implementation approaches for the advanced encryption standard algorithm’.  		 			Xinmiao Zhang 		,  		 			Keshab K Parhi 		.  	 	 		\textit{IEEE Transactions},  				2002.  	 
\bibitem[Vinayak Bajirao Patil et al. (2013)]{b0}\label{b0} 	 		‘Implementation of AES algorithm on ARM processor for wireless network’.  		 			Prof Vinayak Bajirao Patil 		,  		 			Dr 		,  		 			L Uttam 		,  		 			Pallavi Bombale 		,  		 			Hemant Dixit 		.  	 	 		\textit{International Journal of Advanced Research in Computer and Communication Engineering}  		August 2013. 2 p. .  	 
\bibitem[Vinayak Bajirao Patil et al. (2013)]{b6}\label{b6} 	 		‘Implementation of AES algorithm on ARM processor for wireless network’.  		 			Prof Vinayak Bajirao Patil 		,  		 			Dr 		,  		 			L Uttam 		,  		 			Pallavi Bombale 		,  		 			Hemant Dixit 		.  	 	 		\textit{International Journal of Advanced Research in Computer and Communication Engineering}  		August 2013. 2 p. .  	 
\bibitem[Kaushik and Singhal (2012)]{b9}\label{b9} 	 		‘Network Security Using Cryptographic Techniques’.  		 			Sumedha Kaushik 		,  		 			Ankur Singhal 		.  	 	 		\textit{International Journal of Advanced Research in Computer Science and Software Engineering}  		December 2012. 2 p. .  	 
\bibitem[Debasis and Rajiv (2011)]{b13}\label{b13} 	 		‘Programmable Cellular Automata Based Efficient Parallel AES Encryption Algorithm’.  		 			Das Debasis 		,  		 			Misra Rajiv 		.  	 	 		\textit{International Journal of Network Security \& Its Applications (IJNSA)}  		November 2011. 3  (6)  p. 204.  	 
\bibitem[Xinjie et al. (2008)]{b17}\label{b17} 	 		‘Robust First Two Rounds Access Driven Cache Timing Attack on AES’.  		 			Z Xinjie 		,  		 			W Tao 		,  		 			M Dong 		,  		 			Z Yuanyuan 		,  		 			L Zhaoyang 		.  	 	 		\textit{IEEE InternationalConference on Computer Science and Software Engineering},  				 (Wuhan, Hubei, China)  		Dec. 2008. p. .  	 
\bibitem[Kocher ()]{b18}\label{b18} 	 		‘Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems’.  		 			P C Kocher 		.  	 	 		\textit{16th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO)},  				 (London UK)  		1996. Springer-Verlag. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
