\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={Dynamic Permutations},
 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{Dynamic Permutations}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Dr. Sharaf A.  Alhomdy}

             \author[2]{Dr. Saleh N.  Abdullah}

             \affil[1]{  Faculty of Computer and Information Technology, Sanaa University}

\renewcommand\Authands{ and }

\date{\small \em Received: 9 December 2014 Accepted: 4 January 2015 Published: 15 January 2015}

\maketitle


\begin{abstract}
        


The confidentiality, integrity and authentication of anelectronic documentare necessary in many application systems. The security of confidentiality, integrity and authentication of an electronic document are based on nonlinear functions, in which there is no directrelationship between the inputs and the outputs. This means that the inputs cannot be extracted from the outputs.Indeed, all modern cyphers are based on the concept of substitution transposition. In data encryption standard algorithm, DES, which consists of many functions, only one nonlinear function is used in the algorithm, called substitution boxes, and all other functions are linear, one of these linear functions is called IP, initial permutation function, which performs static permutations. The permutations are replaced by transpositions, based on predefined positions, and the permutation function is used several times in DES algorithm.

\end{abstract}


\keywords{confusion, diffusion, linear function, nonlinear function, static permutations, dynamic permutations, one-way functions, hash table and complexity.}

\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
n any cryptosystem or message integrity and authentication, the nonlinear functions are the cornerstones because the inputs to the nonlinear functions cannot be extracted from the outputs. In linear function it is possible to obtain the output if both the inputs \& the operation are known; also the second input can be obtained if one input \& output are known (e.g. 
\section[{XOR function).}]{XOR function).}\par
A function is called nonlinear if one solution can be retched from several inputs; in other words, if the operations and the outputs of a function are known, and the inputs to a function are not known, the function is callednonlinear. Moreover, if such outputs are produced via nonlinear functions, it becomes difficult to obtain the inputs to the nonlinear functions in a suitable time. For example, the operation mod acts as nonlinear function, because 20 mod 6 =2, also 20 mod 9=2, and 20 mod 3= 2. The value 2 comes from 20 mod 6, 20 mod 9, and 20mod 3. So, if we know one of the inputs and the output along with the operation 'mod', we cannot know the second input.\par
In this paper, section two provides details about literature review. Section three describes our proposal technique to enhance the security in the confidentiality, integrity and authentication. The conclusion and future works will be found in section four. 
\section[{II.}]{II.} 
\section[{Literature Review}]{Literature Review}\par
In any cryptography systems, permutation (transposition) is an essential element to remove the relations between the alphabets which formulate the sentences because every language has its own characteristics.\par
Permutation: refers to mapping a block of length L1 into a block of length L1 \hyperref[b0]{[1]}.\par
Definition: Permutation denotes ? p . ? p : \{1,..,L m \}?\{1,?,L m1 \}is a permutation, where L and m are positive integers. Shannon \hyperref[b1]{[2,}\hyperref[b2]{3]} suggests two methods for frustrating statistical cryptanalysis: Diffusion and Confusion. In diffusion, the statistical structure of the plaintext is dissipated into a long range statistics of the cipher text. On the other hand, confusion seeks to make the relationship between the statistics of the cipher text and the value of encryption key as complex as possible. Confusion can be achieved by the use of a complex substitution algo rithm via using substitution boxes \hyperref[b0]{[1]}.For example, if we have the following inputs: 10101101 01001110 10000100 10101111.\par
The corresponding values in hexadecimal system are AC4E84AF.So every value will take a predefined position as shown in table 1.\par
Table1 : Shows the Values and Indexes  
\section[{Index output}]{Index output} 
\section[{Index input}]{Index input}\par
In this paper, we will try to develop dynamic permutations instead of static permutations, nonlinear factors, which in turn enhance the security system. Keywords: confusion, diffusion, linear function, nonlinear function, static permutations, dynamic permutations, one-way functions, hash table and complexity. 
\section[{Year 2015}]{Year 2015}\par
The first 4-bit input will be transferred into position 8 of output, and so on.\par
In DES algorithm \hyperref[b2]{[3,}\hyperref[b3]{4]}  So far all the processes of any permutations are static, i.e, the permutations are replaced by transpositions, based on predefined positions. However, in this paper we will suggesta new method "dynamic permutations" to enhance the security in cryptosystems. The main idea for the new method is as follows:\par
? Constructing a suitable hash table along with suitable hash key.\par
? Dividing the binary data into groups, each group consists of 8-bits; and each 8-bitscan take values from 00 to FF in hexadecimal system.\par
? Each group should be hashed into the corresponding value; this value is used as an index to store the group in the hash table. Since the values stored in the hash table are based on randomindexes, each group will take dynamic position.\par
In this case, the permutations of the inputs are dynamic permutations but not static. Figure \hyperref[b0]{(1)} shows the suggested method for the construction of the hash table.\par
Figure1 : Shows the Construction of the Hash Table   {\ref 4E}, 84, AF. So, every value will take a position in the hash table. If there is more than one value equals, the first one will take the correct position in the hash table and the others will increase the frequency field by 1, and so on, without taking extra positions in the hash table. If there are more than one values hashed to the same index, the second value stays in another node with the same index in the hash table, and so on.V 1 V 2 V 3 V 4 V 5 V 6 V 7 V 8 V 9 V 10 V 11 V 12 V 13 V 14 V 15 V 16 V 17 V 18 V 19 V 20 V 21 V 22 V 23 V 24 V 25 V 26 V 27 V 28 V 29 V 30 V 31 V 32 V 33 V 34 V 35 V 36 V 37 V 38 V 39 V 40 V 41 V 42 V 43 V 44 V 45 V 46 V 47 V 48 V 49 V 50 V 51 V 52 V 53 V 54 V 55 V 56 V 57 V 58 V 59 V 60 V 61 V 62 V 63 V 64 V 58 V 50 V\par
The length of the hash table is directly proportional to the S. That means, L ? S (1) such that S is the number of characters in the block simultaneously permuted and L is the length of the hash table.\par
The following equation: pi=(pi-1+ xi )\%m \hyperref[b1]{(2)} Maybe used to produce the hash key, such that p0=7, pi is the index position in the hash table, x0= 11, xi is the value to be hashed, and m is prime number points to the size of the hash table.\par
The following is a sample of values hashed to the some indexes. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_1}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.5590604026845638\textwidth}P{0.09697986577181208\textwidth}P{0.07416107382550335\textwidth}P{0.05134228187919463\textwidth}P{0.06845637583892616\textwidth}}
\tabcellsep \tabcellsep value\tabcellsep frequency\\
\tabcellsep 0\tabcellsep \tabcellsep \\
\tabcellsep 1\tabcellsep \tabcellsep \\
\tabcellsep 2\tabcellsep \tabcellsep \\
\tabcellsep 3\tabcellsep \tabcellsep \\
\tabcellsep ..\tabcellsep \tabcellsep \\
\tabcellsep m-1\tabcellsep \tabcellsep \\
\multicolumn{5}{l}{Example: if we have the following inputs}\\
10101101\tabcellsep 01001110\tabcellsep \multicolumn{2}{l}{10000100}\tabcellsep 10101111.The\\
\multicolumn{5}{l}{corresponding values in hexadecimal system are AC,}\end{longtable} \par
 
\caption{\label{tab_2}42 v 34 V 26 v 18 v 10 v 2 v 60 V 52 V 44 v 36 V 28 v 20 v 12 v 4 V 62 V 54 V 46 v 38 V 30 v 22 v 14 v 6 v 64 V 56 V 48 v 40 V 32 v 24 v 16 v 8 V 57 V 49 V 41 v 33 V 25 v 17 v 9 v 1 v 59 V 51 V 43 v 35 V 27 v 19 v 11 v 3 V 61 V 53 V 45 v 37 V 29 v 21 v 13 V 5 v 63 V 55 V 47 v 39 V 31 v 23 v 15 v 7}\end{figure}
 		 		\backmatter  			 \par
Complexity means studying each of execution time, input-data, language difficulties, mass storage required by the algorithm etc.\par
In this study we concentrate on complexity from only three points:\par
i. Data complexity.\par
The amount of data needed as input to the attack.\par
ii. Processing complexity.\par
The time needed to perform the attack. This is often called the work factor.\par
iii. Storage requirements.\par
The amount of memory needed to do the attack \hyperref[b5]{[6]}. b) Complexity of Algorithms An algorithm's complexity is determined by the computational power needed to execute the algorithm itself. The computation of an algorithm is often measured by two variables: T (for Time Complexity), and S (for Space Complexity). In general, the computational complexity of an algorithm is expressed in what is called "big O" notation: the order of magnitude of the computation complexity.\par
Generally, algorithms are classified according to their time or space complexity: ? An algorithm is a constant if its time complexity is independent of n: O(1). ? An algorithm is linear, if its time complexity is O (n). ? An algorithms can also be quadratic, cubic, and so on. Like those algorithms, their complexity are polynomial i.e. O (nm), where m is a constant. Algorithms whose complexities are O(cf(n)), where c is a constant and f(n) is more than a constant but less than linear, are called "Supper polynomial" \hyperref[b5]{[6]}.\par
The suggested algorithm will take extra process more than static algorithm as the following: ? The process of conversion from binary todecimal O (n). ? The computation of indexes O (m). ? It needs also extra storage corresponding to the hash table.\par
IV. 
\subsection[{Conclusion and Future Work}]{Conclusion and Future Work}\par
The permutation is an essential factor in many security cryptosystems. Therefore, we developed a new method that uses dynamic permutation for enhancing the security of the system in a way better than using static permutations.\par
The future work, dynamic permutation can be used to produce one way hash function.			 			  				\begin{bibitemlist}{1}
\bibitem[Schneier ()]{b1}\label{b1} 	 		‘Applied Cryptography" 3rdEd’.  		 			Bruce Schneier 		.  	 	 		\textit{ASIA) Pvt. Ltd. Singapore}  		2010. John Wiley \& Sons. 129809.  	 
\bibitem[Horowitz and Rajasekran ()]{b4}\label{b4} 	 		\textit{Computer Algorithms},  		 			Ellis Horowitz 		,  		 			Sanguthevar Rajasekran 		.  		2005. New Delhi, India: Galgotia Publication Pvt. Lid.  	 
\bibitem[Russell et al. ()]{b2}\label{b2} 	 		\textit{Computer Security Basics" O'},  		 			D Russell 		,  		 			G T Gangemi 		,  		 			Sr 		.  		2009. New York: Reilly\& Associates, Inc.  	 
\bibitem[Stallings ()]{b6}\label{b6} 	 		\textit{Cryptography and Network Security: Principles and Practice},  		 			William Stallings 		.  		2009.  	 	 (3rd Ed. India) 
\bibitem[Douglasr and Stinson ()]{b0}\label{b0} 	 		\textit{Cryptography: Theory and Practice},  		 			Douglasr 		,  		 			Stinson 		.  		2002. Waterloo, Ontario Canada: Chapman \& Hall/CRC.  		 			University of Waterloo 		 	 	 (2nd Ed) 
\bibitem[Thomas et al. ()]{b5}\label{b5} 	 		\textit{Introduction to Algorithms},  		 			H Thomas 		,  		 			Charles E Cormen 		,  		 			Ronald L Leiseroin 		,  		 			Rivest Clifford Stein 		.  		2002. New Delhi: Prentice, Hall of India, Pvt. Ltd. 110 p. 1.  	 	 (2nd Ed) 
\bibitem[Dennin ()]{b3}\label{b3} 	 		\textit{Library of Congress Cataloging in Publication Data},  		 			Dorothy E Dennin 		.  		1983. Addison-Wesley, USA.  	 	 (Cryptography and Data Security) 
\end{bibitemlist}
 			 		 	 
\end{document}
