\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={A Study of Encryption Algorithms AES, DES and RSA for Security}, 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{2013-01-15 (revised: 15 January 2013)} \def\TheID{\makeatother } \def\TheDate{2013-01-15} \title{A Study of Encryption Algorithms AES, DES and RSA for Security} \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]{Abhishek Sachdeva} \affil[1]{ IITM} \renewcommand\Authands{ and } \date{\small \em Received: 12 December 2012 Accepted: 2 January 2013 Published: 15 January 2013} \maketitle \begin{abstract} In recent years network security has become an important issue. Encryption has come up as a solution, and plays an important role in information security system. Many techniques are needed to protect the shared data. The present work focus on cryptography to secure the data while transmitting in the network. Firstly the data which is to be transmitted from sender to receiver in the network must be encrypted using the encryption algorithm in cryptography. Secondly, by using decryption technique the receiver can view the original data. In this paper we implemented three encrypt techniques like AES, DES and RSA algorithms and compared their performance of encrypt techniques based on the analysis of its stimulated time at the time of encryption and decryption. Experiments results are given to analyses the effectiveness of each algorithm. \end{abstract} \keywords{DES, RSA, AES, encryption, decryption, private key encryption, public key encryption, cryptography.} \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 any encryption algorithms are widely available and used in information security. They can be categorized into Symmetric (private) and Asymmetric (public) keys encryption. In Symmetric keys encryption or secret key encryption, only one key is used to encrypt and decrypt data. In Asymmetric keys, two keys are used; private and public keys \hyperref[b0]{[1]}. Public key is used for encryption and private key is used for decryption (e.g. RSA). Public key encryption is based on mathematical functions, computationally intensive. There are many examples of strong and weak keys of cryptography algorithms like DES, AES. DES uses one 64-bits key while AES uses various 128,192,256 bits keys \hyperref[b1]{[2]}.\par Asymmetric key encryption or public key encryption is used to solve the problem of key distribution. In Asymmetric keys, two keys are used; private and public keys. Public key is used for encryption and private key is used for decryption (E.g. RSA and Digital Signatures). Because users tend to use two keys: public key, which is known to the public and private key which is known only to the user \hyperref[b1]{[2]}. There is no need for distributing them prior to transmission. However, public key encryption is based on mathematical functions, computationally intensive and is not very efficient for small mobile devices \hyperref[b2]{[3]}. \section[{Asymmetric encryption techniques are almost 1000}]{Asymmetric encryption techniques are almost 1000}\par Authors ? ? : e-mail: aabhi616@yahoo.in times slower than Symmetric techniques, because they require more computational processing power \hyperref[b3]{[4]}.\par This study evaluates three different encryption algorithms namely; AES, DES and RSA. The performance measure of encryption schemes will be conducted in terms of encryption and decryption time such as text or document \hyperref[b4]{[5]}. \section[{II.}]{II.} \section[{Encryption Algorithms}]{Encryption Algorithms}\par Encryption is a well known technology for protecting sensitive data. Use of the combination of Public and Private Key encryption to hide the sensitive data of users, and cipher text retrieval \hyperref[b5]{[6]}. a) Data Encryption Standard (DES) DES (Data Encryption Standard) algorithm purpose is to provide a standard method for protecting sensitive commercial and unclassified data. In this same key used for encryption and decryption process \hyperref[b6]{[7]}. DES algorithm consists of the following steps i. Encryption 1. DES accepts an input of 64-bit long plaintext and 56-bitkey (8 bits of parity) and produce output of 64 bit block. 2. The plaintext block has to shift the bits around. 3. The 8 parity bits are removed from the key by subjecting the key to its Key Permutation. 4. The plaintext and key will processed by following i. The key is split into two 28 halves ii. Each half of the key is shifted (rotated) by one or two bits, depending on the round. iii. The halves are recombined and subject to a compression permutation to reduce the key from 56 bits to 48 bits. This compressed keys used to encrypt this round's plaintext block. iv. The rotated key halves from step 2 are used in next round. v. The data block is split into two 32-bit halves. vi. One half is subject to an expansion permutation to increase its size to 48 bits. vii. Output of step 6 is exclusive-OR'ed with the 48itcompressed key from step 3. viii. Output of step 7 is fed into an S-box, which substitutes key bits and reduces the 48-bit block back down to 32-bits. ix. Output of step 8 is subject to a P-box to permute the bits. ii. Usual Round : Execute the following operations which are described above. The last step consists of XO Ring the output of the previous three steps with four words from the key schedule. And the last round for encryption does not involve the "Mix columns" step. RSA is widely used Public-Key algorithm. RSA firstly described in 1977. In our proposed work, we are using RSA algorithm to encrypt the data to provide security so that only the concerned user can access it. RSA algorithm involves these steps: 1. Key Generation 2. Encryption 3. Decryption i Key Generation Before the data is encrypted, Key generation should be done. \hyperref[b8]{[9]} Steps: Generate a public/private key pair : 1. Generate two large distinct primes p and q 2. Compute n = pq and ? = (p ? 1)(q ? 1) 3. Select an e, 1 < e < ?, relatively prime to ?. \section[{Comparision}]{Comparision}\par In \section[{Experimental Design}]{Experimental Design}\par The four text files of different sizes are used to conduct four experiments, where a comparison of three algorithms AES, DES and RSA is performed. \section[{Performance of encryption algorithm is evaluated considering the following parameters. A. Encryption Time B. Decryption Time}]{Performance of encryption algorithm is evaluated considering the following parameters. A. Encryption Time B. Decryption Time}\par The encryption time is considered the time that an encryption algorithm takes to produces a cipher text from a plain text. Encryption time is used to calculate the throughput of an encryption scheme, is calculated as the total plaintext in bytes encrypted divided by the encryption time. Comparisons analyses of the results of the selected different encryption scheme are performed. \hyperref[b11]{[11]} V. \section[{Experimental Results And Analysis}]{Experimental Results And Analysis}\par Experimental result for Encryption algorithm AES, DES and RSA are shown in table-2, which shows the comparison of three algorithm AES, DES and RSA using same text file for four experiment. By analyzing table-2, Time taken by RSA algorithm for both encryption and decryption process is much higher compare to the time taken by AES and DES algorithm. algorithm. AES and DES algorithm show very minor difference in time taken for encryption and decryption process.\par VI. \section[{Conclusion}]{Conclusion}\par Encryption algorithm plays very important role in communication security. Our research work surveyed the performance of existing encryption techniques like AES, DES and RSA algorithms.\par Based on the text files used and the experimental result it was concluded that AES algorithm consumes least encryption and RSA consume longest encryption time.\par We also observed that Decryption of AES algorithm is better than other algorithms.\par From the simulation result, we evaluated that AES algorithm is much better than DES and RSA algorithm.\par Our future work will focus on compared and analysed existing cryptographic algorithm like AES, DES and RSA. It will include experiments on image and audio data and focus will be to improve encryption time and decryption time. \begin{figure}[htbp] \noindent\textbf{1}\includegraphics[]{image-2.png} \caption{\label{fig_0}EFigure 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{413}\includegraphics[]{image-4.png} \caption{\label{fig_2}4 .E 1 .Figure 3 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{45}\includegraphics[]{image-5.png} \caption{\label{fig_3}Figure 4 :Figure 5 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{}\includegraphics[]{image-6.png} \caption{\label{figure6}}\end{figure} \begin{figure}[htbp] \noindent\textbf{} \par \begin{longtable}{P{0.85\textwidth}} 1. Sub Bytes\\ 2. Shift Rows\\ 3. Mix Columns\\ 4. Add Round Key , using K(round)\\ iii. Final Round: Execute the following operations\\ which are described above.\\ 1. Sub Bytes\\ 2. Shift Rows\\ 3. Add Round Key, using K(10)\\ iv. Encryption : Each round consists of the following\\ four steps:\end{longtable} \par {\small\itshape [Note: i Sub Bytes : The first transformation, Sub Bytes, is used at the encryption site. To substitute a byte, we interpret the byte as two hexadecimal digits. ii Shift Rows : In the encryption, the transformation is called Shift Rows.iii]} \caption{\label{tab_0}}\end{figure} \begin{figure}[htbp] \noindent\textbf{1} \par \begin{longtable}{P{0.85\textwidth}} Consumption, Security, Deposit of keys, Inherent\\ Vulnerabilities, Key used, Rounds, Stimulation Speed,\\ Trojan Horse, Hardware \& Software Implementation and\\ Ciphering \& Deciphering Algorithm.\end{longtable} \par \caption{\label{tab_1}Table 1 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{2} \par \begin{longtable}{P{0.024709302325581394\textwidth}P{0.7313953488372092\textwidth}P{0.014825581395348836\textwidth}P{0.04447674418604651\textwidth}P{0.034593023255813954\textwidth}} \tabcellsep \multicolumn{4}{l}{2 : Comparisons of DES, AES and RSA of Encryption and Decryption Time}\\ S.NO\tabcellsep \multicolumn{4}{l}{Algorithm Packet Size (KB) Encryption Time (Sec) Decryption Time (Sec)}\\ \tabcellsep AES\tabcellsep \tabcellsep 1.6\tabcellsep 1\\ 1\tabcellsep DES\tabcellsep 153\tabcellsep 3.0\tabcellsep 1.1\\ \tabcellsep RSA\tabcellsep \tabcellsep 7.3\tabcellsep 4.9\end{longtable} \par \caption{\label{tab_2}Table 2}\end{figure} \backmatter \begin{bibitemlist}{1} \bibitem[ International Journal of Research in Computer and Communication technology (2012)]{b9}\label{b9} \textit{}, \textit{International Journal of Research in Computer and Communication technology} 2278- 5841. September 2012. 1 (4) p. 145. (IJRCCT) \bibitem[Prashanti and S & Sandhya Rani (2013)]{b6}\label{b6} ‘A Novel Approach for Data Encryption Standard Algorithm’. Deepthi G Prashanti , S \& Sandhya Rani . \textit{International Journal of Engineering and Advanced Technology (IJEAT)} 2249 -8958. June 2013. (2) p. 264. \bibitem[Idrizi et al. (2013)]{b0}\label{b0} ‘Analyzing the speed of combined cryptographic algorithms with secret and public key’. Florim Idrizi , Dalipi , \& Fisnik , Ejup Rustemi . ISSN: 2278-800X. \textit{International Journal of Engineering Research and Development} 2278-067X. August 2013. 8 (2) p. 45. \bibitem[Padmapriya and Subhasri (2013)]{b5}\label{b5} ‘Cloud Computing: Security Challenges \& Encryption Practices’. Dr A Padmapriya , P Subhasri . \textit{International Journal of Advanced Research in Computer Science and Software Engineering} 2277 128X. March 2013. 3 (3) p. 257. \bibitem[Ritika and Kuldeep (2012)]{b2}\label{b2} ‘Efficiency and Security of Data with Symmetric Encryption Algorithms’. Chehal Ritika , Singh Kuldeep . \textit{International Journal of Advanced Research in Computer Science and Software Engineering} 2277 128X. August 2012. 2 (8) p. 1. \bibitem[Sunitha and Prashanth (2013)]{b10}\label{b10} ‘Enhancing Privacy in Cloud Service Provider Using Cryptographic Algorithm’. K Sunitha , K S Prashanth . ISSN: 2278- 8727Volume 12. \textit{IOSR Journal of Computer Engineering} 2278-0661. Jul. -Aug. 2013. (5) p. 64. IOSR-JCE \bibitem[Elminaam et al. (2010)]{b4}\label{b4} ‘Evaluating The Performance of Symmetric Encryption Algorithms’. Diaa Elminaam , Abdual Salama Abd , Kader . \textit{International Journal of Network Security} May 2010. 10 (3) p. 216. (Hatem Mohamed \& Hadhoud, Mohiy Mohamed) \bibitem[Parsi and Sudha]{b8}\label{b8} Kalpana Parsi , Singaraju Sudha . \textit{Data Security in Cloud Computing using RSA Algorithm}, \bibitem[Abdul et al.]{b1}\label{b1} \textit{Performance Analysis of Symmetric Cryptography}, Abdul , D S Mina , H M Kader , M Hadhoud . p. 1. \bibitem[Debasis and Rajiv (2011)]{b7}\label{b7} ‘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[Hardjono ()]{b3}\label{b3} \textit{Security In Wireless LANS And MANS}, Hardjono . 2005. Artech House Publishers. \bibitem[Narjeet and Gaurav]{b11}\label{b11} ‘Security On Bccp Through Aes Encryption Technique’. Singh Narjeet , Raj Gaurav . \textit{International Journal Of Engineering Science \& Advanced Technology} (2) . (Issue-4, 813 -819. pp. 817.) \end{bibitemlist} \end{document}