\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={Review of Various Encryption Algorithms},
 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{2019 2019-01-15 (revised: 3 Year 2019 15 January 2019)}
\def\TheID{\makeatother }
\def\TheDate{2019 2019-01-15}
\title{Review of Various Encryption Algorithms}
\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]{Neymis Misiko  Jacob}

             \affil[1]{  Umma University}

\renewcommand\Authands{ and }

\date{\small \em Received: 16 December 2018 Accepted: 4 January 2019 Published: 15 January 2019}

\maketitle


\begin{abstract}
        


Advancement in technology dictates that information security, user data integrity and security be paramount to protect user information and data from vulnerabilities from malicious intruders- third parties. Need is therefore a factor for information systems to secure user data and information. The concept data encryption ensures that user data is unreadable to third parties keeping their information more safe and secure while using the internet. A lot information on security has been provided by both the physical security and operating system security but neither of these methods have successfully and sufficiently provided a secure mechanism and support on storing and processing of user data and information. This paper reviews the various encryption algorithms that are employed to protect user information and data against various vulnerabilities.

\end{abstract}


\keywords{encryption, algorithms, software?s, behaviors.}

\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
dvancement in technology dictates that information security, user data integrity and security have become paramount to protect user information and data from vulnerabilities due to technological advances especially the internet or access by third parties. With this there is dire need for information systems to secure user data and information like the use of anonymisation and encryption \hyperref[b11]{(Neubauer T, Heurix J, 2011)}.The concept encryption functions through scrambling of data to make it unreadable by the third party, this is enhanced in a number of ways such as the use of the key size and strength to create strong security of data \hyperref[b0]{(Bradford, 2016)}.\par
Much as information security has been provided by both the physical security and operating system security, neither of these methods have successfully and sufficiently provided a secure mechanism and support on storing and processing data (Priti V. Bhagat, Kaustubh S. Satpute, Vikas R. Palekar, 2013). This paper reviews the various encryption algorithms that are employed to protect user information and data against various vulnerabilities. 
\section[{II.}]{II.} 
\section[{Encryption Algorithms}]{Encryption Algorithms}\par
Encryption and cryptography algorithm can be defined as an approach that make data, information or network more secure (Rajdeep \hyperref[b5]{Bhanot and Rahul Hans, 2015)}. As a science, cryptography encamps the use of encryption algorithms to secure data within computer systems. The high reliance of the internet for communication purpose requires that data and information be encrypted to limit intruders from accessing to read messages. The process of information encryption also called cipher text enables users of systems to transfer information and data much securely. There are many encryption algorithms that are used widely. Those available and used in data and information security can broadly be categorized into Symmetric also called private and Asymmetric also called public keys encryption (Prerna Mahajan and Abhishek Sachdeva, 2013). 
\section[{III.}]{III.} 
\section[{Software Behaviors}]{Software Behaviors}\par
By definition encryption is the technology of converting plain text information into cipher text, the cipher text can then be securely communicated over any unsecure network. This process of encryption is usually achieved using encryption algorithm (Rajdeep \hyperref[b5]{Bhanot and Rahul Hans, 2015)}. Users benefit from encryption as it makes their data and information be more confidential, have integrity, be non-repudiation, be authentic and have access Control. There are various encryption algorithms in use currently, whose key size and strength generally being the differences between them \hyperref[b0]{(Bradford, 2016)}.\par
Bradford further categorizes them as:-Data Encryption Standard (DES), the Triple DES a symmetric algorithm, the RSA a public key encryption algorithm, the Blowfish algorithm, the Twofish algorithm and the Advanced Encryption Standard (AES). Hossain et.al 2016 classified the algorithms as symmetric-key algorithms in which the same key used for both encryption and decryption of data, asymmetric-key algorithms in which a public key is used by a sender to encrypts data and a private key used by receiver for decryption and hashing.  {\ref (} The Triple DES a symmetric algorithm makes use of three individual keys with 56 bits, was designed to replace the Data Encryption Standard (DES) algorithm which was much vulnerable to hackers, the RSA a public key encryption algorithm utilized by modern computers to encrypt and decrypt messages. The Blowfish algorithm which is a symmetry cipher used to split and encrypt messages individually whose advantages are its speed and the overall operation effectiveness.\par
The Twofish algorithm, keys used in this algorithm vary up to 256 bits in length and use confidentiality while working with them. The main A study conducted by Rejani R and Deepu.V. Krishnan on the test of algorithms concluded that between AES, DES, 3DES, RC2, Blowfish, and RC6, Blowfish was the best encryption algorithm between different symmetric and asymmetric encryption algorithms \hyperref[b6]{(Rejani. R, 2015)}. The study further advanced that DES algorithm was no longer secure especially with the advancement in the computer processing power whereas the AES encryption algorithm is faster and flexible hence widely applied in many security applications.\par
A research on encryption Algorithms AES, DES and RSA for Security by Prerna and Sachdeva (2013) indicated that DES algorithm is used to provide a standardized method to protecting sensitive commercial and unclassified data. The Advanced Encryption Standard (AES) algorithm is appropriate for both hardware and software implementation and is of greater speed, while the Rivest-Shamir-Adleman (RSA) which is widely used Public-Key algorithm is used to encrypt data to provide security so that only the concerned user can access it.\par
In comparison therefore AES has a block size of 128 bits, DES 64 bits while RSA has a minimum of 512 bits. In terms of encryption and decryption, the AES algorithm is faster while DES is moderate and RSA algorithm is much slower. AES is excellently secured while DES is not enough secured and RSA is the least secure algorithm. All the algorithms are inherently vulnerable to brute forced attacks-a trial and error means employed by various application programs to decode or decrypt encrypted data for instance passwords or Data usually on the internet \hyperref[b7]{(Rouse, 2006)}.\par
A long this DES is prone to linear and differential cryptanalysis attacks which involves cracking codes to decode privacies through violation of authentication schemes by breaking cryptographic protocols \hyperref[b8]{(Heward, 2014)}, while RSA is vulnerable to oracle attacks that exploit the availability of weaknesses in system. On the other hand the asymmetric algorithm includes: -RSA, DSA, Diffie-Hellman, EI-Gamal and Pailier. The hashing which includes the MD5, MD6, the SHA and SHA256 (Md. Alam Hossain, Md. Biddut Hossain, Md. Shafin Uddin, Shariar  {\ref Md. Imtiaz, 2016)}.\par
The RSA Rivest-Shamir-Adleman an asymmetric encryption and decryption algorithm uses a public and private key. The public key which is described to everyone is used for encrypting messages. The messages encrypted with the public key are usually decrypted through the private key. RSA performs generation, encryption and decryption of algorithm keys (Priyanka Arora, Arun Singh and Himanshu Tyagi, 2014). The DIFFIE-HELLMAN key has a specific approach of exchanging cryptographic keys that enable two parties having no understanding of each other to equally make a shared-secret key over an insecure communications path. The keys are then encrypt the posterior communications using a symmetric key cipher.\par
The PAILLIER algorithm has homomorphic properties that facilitate it to perform normal addition operations on several encrypted values to achieving the encrypted sum, they are then decrypted later with no knowledge of the sum value (Priyanka Arora, Arun Singh and Himanshu Tyagi, 2014). The motivation behind the hash functions is the management of data security, integrity and consistency \hyperref[b12]{(Neyole, 2015)}. The Message Digest5 for instance takes random data information of text and binary as input and generate a fixed size hash value as the output.\par
The input data can be of any length and size, but the output hashed value is always fixed \hyperref[b12]{(Neyole, 2015)}. For MD5 the input message is allocated to groups of 512-bits then the message is then packed by making its length divisible by 512 (Priyanka Arora, Arun Singh and Himanshu Tyagi, 2014). The MD5 is mostly used in the database design to encrypt passwords. It's faster to use but suffers with the challenges of easy decryption using web based applications such as HashKiller. The SHA-Secure Hashing Algorithm on the other hand is a hashing algorithm that is structured differently and are named SHA-0, SHA-1, SHA-2, and SHA-3. SHA-0 whose original version was the 160-bit hash function \hyperref[b12]{(Neyole, 2015)} this algorithms are more secure and stable especially in the design of database systems. 
\section[{IV.}]{IV.} 
\section[{Conclusions}]{Conclusions}\par
Does increased security provide 100\% assurance to technology consumers? With the Internet as a major essential communication between billions of people and also a tool for commerce, social interaction, and the exchange of an increasing amount of personal information, security has become a matter of grave concern. There are a number approaches to data and information security where many applications to securing commerce and payments are employed to manage private communications and user data and information. But in all this, encryption which makes use of encryption algorithms makes communication more secure to user data and information.\par
With the many encryption algorithms schemes in existence each out to improve on security of system, data, information and communication channels managers have enhanced them on data and information to facilitate users with more system integrity and concerns of these schemes is to optimize technology use. The Hash functions for instance, are well established to ensure data integrity where any change made to the contents of a message will result in the receiver calculating a different hash value than the one placed in the transmission by the sender. This then ensures user with a high degree of confidence \hyperref[b10]{(Kessler, 2017)}.\par
As the number of attacks and their sophistications increase, attacks on encryptions such as brute-force requires that systems be equipped with the various algorithms to support each other to the management of the systems. On performance analysis, the best algorithms both symmetric and asymmetric should possess the following aspects:-the set of keys and the enciphering algorithm should be free from complexity, the implementation of the process should be as simple as possible, errors in ciphering should not propagate and cause corruption of further information in the message and the size of the enciphered text should be no larger than the text of the original message among other measures (Pfleeger, Charles P. and Shari Lawrence, 2006).\begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.17300884955752213\textwidth}P{0.6769911504424778\textwidth}}
\tabcellsep Year 2019\\
\tabcellsep 1\\
A\tabcellsep Volume XIX Issue I Version I\\
\tabcellsep )\\
\tabcellsep E\\
\tabcellsep (\\
\tabcellsep Global Journal of Computer Science and Technology\\
© 2019 Global Journals\tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
Year 2019\\
2\\
Volume XIX Issue I Version I\\
)\\
E\\
(\\
Global Journal of Computer Science and Technology\end{longtable} \par
 
\caption{\label{tab_1}}\end{figure}
 			\footnote{© 2019 Global Journals} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Pfleeger]{b4}\label{b4} 	 		\textit{},  		 			Pfleeger 		.  		Upper Saddle River, NJ 07458 USA: Pearson Education, Inc. p. .  	 	 (Security in Computing 4th Edition (pp.) 
\bibitem[Arora et al. ()]{b2}\label{b2} 	 		\textit{},  		 			Priyanka Arora 		,  		 			Arun Singh 		,  		 			Himanshu Tyagi 		.  	 	 		\textit{Evaluation and Comparison of Security Issues on Cloud Computing Environment. World of Computer Science and Information Technology Journal}  		2014. p. .  	 
\bibitem[Priti et al. (2013)]{b14}\label{b14} 	 		\textit{},  		 			V Priti 		,  		 			Kaustubh S Bhagat 		,  		 			Satpute 		,  		 			R Vikas 		,  		 			Palekar 		.  		January 2013.  	 	 (Reverse Encryption) 
\bibitem[Neubauer and Heurix ()]{b11}\label{b11} 	 		‘A Methodology for the Pseudonymization of Medical data’.  		 			T Neubauer 		,  		 			J Heurix 		.  	 	 		\textit{International Journal of Medical Information}  		2011. p. .  	 
\bibitem[Bhanot and Hans ()]{b5}\label{b5} 	 		‘A Review and Comparative Analysis of Various Encryption Algorithms’.  		 			Rajdeep Bhanot 		,  		 			Rahul Hans 		.  	 	 		\textit{International Journal of Security and Its Applications}  		2015. p. .  	 
\bibitem[Mahajan and Sachdeva ()]{b13}\label{b13} 	 		‘A Study of Encryption Algorithms AES, DES and RSA for Security’.  		 			Prerna Mahajan 		,  		 			Abhishek Sachdeva 		.  	 	 		\textit{Global Journal of Computer Science and Technology Network}  		2013. p. .  	 	 (Web \& Security) 
\bibitem[Algorithm: A Technique for Encryption & Decryption International Journal of Latest Trends in Engineering and Technology (IJLTET)]{b1}\label{b1} 	 		‘Algorithm: A Technique for Encryption \& Decryption’.  	 	 		\textit{International Journal of Latest Trends in Engineering and Technology (IJLTET)}  		p. .  	 
\bibitem[Kessler ()]{b10}\label{b10} 	 		\textit{An Overview of Cryptography},  		 			G C Kessler 		.  		2017. Australia: McGraw-Hill.  	 
\bibitem[Bradford (2016)]{b0}\label{b0} 	 		 			C Bradford 		.  		 \url{http://www.storagecraft.com/blog/5-common-encryption-algorithms/}  		\textit{Storagecraft Recovery Zone. Retrieved from 5 Common Encryption Algorithms and the Unbreakables of the Future},  				2016. July 31st.  	 
\bibitem[Rouse (2006)]{b7}\label{b7} 	 		\textit{Brute force cracking},  		 			M Rouse 		.  		 \url{http://searchsecurity.techtarget.com/definition/brute-force-cracking}  		2006. July.  	 
\bibitem[Heward (2014)]{b8}\label{b8} 	 		\textit{Cryptanalysis and Attacks},  		 			G Heward 		.  		 \url{https://www.experts-exchange.com/articles/12460/Cryptanalysis-and-Attacks.html}  		2014. January 26th.  	 
\bibitem[Pfleeger and Lawrence (ed.) ()]{b3}\label{b3} 	 		\textit{Making Good Encryption Algorithms},  		 			Charles P Pfleeger 		,  		 			Shari Lawrence 		.  		C. P. (ed.)  		2006.  	 
\bibitem[Md et al. ()]{b9}\label{b9} 	 		‘Performance Analysis of Different Cryptography Algorithms’.  		 			Md 		,  		 			Md Hossain 		,  		 			Biddut Hossain 		.  	 	 		\textit{International Journal of Advanced Research in Computer Science and Software Engineering}  		2016. p. .  	 	 (Md. Shafin Uddin, Shariar Md. Imtiaz.) 
\bibitem[Rejani ()]{b6}\label{b6} 	 		‘Study of Symmetric key Cryptography Algorithms’.  		 			. R D Rejani 		.  	 	 		\textit{International Journal of Computer Techniques}  		2015. p. .  	 
\bibitem[Neyole ()]{b12}\label{b12} 	 		‘Vulnerability of data security using MD5 function in php database design’.  		 			J M Neyole 		.  	 	 		\textit{International Journal of Science and Engineering}  		2015. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
