\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={Digital Image Encryption Technique Using Block Based Scrambling and Substitution},
 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{2017-01-15 (revised: 15 January 2017)}
\def\TheID{\makeatother }
\def\TheDate{2017-01-15}
\title{Digital Image Encryption Technique Using Block Based Scrambling and Substitution}
\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]{Punita  Kumari}

             \affil[1]{  Maharana Pratap University of Agriculture and Technology}

\renewcommand\Authands{ and }

\date{\small \em Received: 14 December 2016 Accepted: 1 January 2017 Published: 15 January 2017}

\maketitle


\begin{abstract}
        


A novel non-chaos based digital image encryption technique using a combination of diffusion and substitution process has been presented. A secret key of 128 bit sizes is used in the algorithm. In the diffusion (permutation) method, image is divided into different dynamic blocks which are key dependent. Further, each block is made to pass through eight rounds of permutation process. In this process, a zigzag mechanism is used to scramble the block pixels within the block. Then the resultant image i.e. the partially encrypted image is divided into various key based dynamic sub-images. Pixels of the sub-images are replaced with another pixel values within the block when each of the sub-images are passed through the substitution process. The substitution process comprises of four rounds. The proposed scheme is then compared with the standard AES algorithm. Investigation outcome shows that the proposed design methodology is efficient, fast and secure

\end{abstract}


\keywords{information security, image encryption, secret key, diffusion, substitution, AES.}

\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[{I. Introduction}]{I. Introduction}\par
ue to the increasing use of computers and several advancements in information and technology, huge bulk of digital data is being transferred over the network. The transmitted information over the network needs security to protect the data \hyperref[b0]{[1,}\hyperref[b1]{2]}. Not only this, due to the rapid growth of internet, cell phones, multimedia technology in our society, digital image security is the most critical problem. Therefore, security of the digital data has become a major concern during its transmission and storage. Digital data can be secured in three different ways from unauthorized access. They can be classified as cryptography, steganography and watermarking \hyperref[b2]{[3]} {\ref [4]} {\ref [5]} {\ref [6]}. Among the three different techniques, cryptography provides a high level of security. Cryptography deals with converting the information into its coded form and then again decoding it into its original form. While communicating securely using cryptography, which is the main goal of our proposed work, in which encryption and decryption mechanisms are performed by one or more keys. Encryption and decryption techniques that use the same secret key are classified under private key cryptography and the algorithms are categorised under symmetric key cryptography  {\ref [7]} {\ref [8]} {\ref [9]}. When the key used in the encryption and decryption process are different, This paper reports a novel non-chaos based digital image encryption technique for the design of a secure and efficient encryption scheme. 
\section[{II. Chaos and Non-Chaos Based Image Encryption Technique}]{II. Chaos and Non-Chaos Based Image Encryption Technique}\par
For encryption and decryption of an image data different techniques have been used to protect the information from an unauthorized user. These techniques include (a) Non-chaos based image encryption schemes, and (b) Chaos-based image encryption schemes. In this paper, we discuss in brief about these techniques. 
\section[{a) Chaos based encryption technique}]{a) Chaos based encryption technique}\par
Chaos refers to a state which is not deterministic in nature \hyperref[b8]{[20]}\hyperref[b9]{[21]}\hyperref[b10]{[22]}. A chaotic system is dynamic and very sensitive to initial conditions; therefore the system depends completely on the initial condition. Hence, the results deviate largely with a small change in the initial conditions.\par
A chaotic system is also very useful and applied in various disciplines like physics, economics, environmental science, computer science etc.\par
In the present day scenario, security of digital images has become the fundamental need and has their own uses in numerous fields such as medical imaging, internet communication, Tele-medicine, multimedia systems, military communication etc. It includes various aspects like authentication, integrity, confidentiality, access control etc. It has been observed that traditional encryption algorithms like DES, AES etc  {\ref [13]} {\ref [14]}\hyperref[b3]{[15]}\hyperref[b4]{[16]}\hyperref[b5]{[17]}\hyperref[b6]{[18]}\hyperref[b7]{[19]} are not suitable to encrypt images directly because of the two reasons, firstly; the size of image is larger than that of text. Therefore, traditional encryption algorithms will take more time to encrypt and decrypt images as compared to that of text. Secondly, in text encryption, both the size of the original and decrypted text must be equal. But this is not possible in case of images because due to the characteristics of human perception, decrypted image with small distortion is usually acceptable. We can reduce this observable information by decreasing the correlation among image pixel elements using different techniques.   
\section[{b) Non-chaos based encryption technique}]{b) Non-chaos based encryption technique}\par
A non-chaotic system refers to a state having deterministic behavior \hyperref[b11]{[23]} like DES, AES etc.\par
In this paper, a non-chaos based image encryption technique has been proposed. A novel diffusion-substitution technique for image encryption has been applied to encrypt a digital image along with its performance and security parameters to test the histogram analysis, correlation coefficient, entropy etc. However, the proposed methodology is used to achieve an efficient and secure image transmission over the network. 
\section[{III. proposed methodology for digital image encryption based on block based scrambling and substitution}]{III. proposed methodology for digital image encryption based on block based scrambling and substitution}\par
In the present work, an image encryption technique design is proposed. Detailed architecture of the diffusion-substitution mechanism in the proposed image encryption algorithm has been described. To design the encryption technique, scrambling of the image pixel values is performed and then further modification in the pixel values of the partially encrypted image is being done so as to reduce the correlation among the pixels of an image. In this scheme, a secret key of 128 bit size is used. Then, image is separated into various dynamic blocks. Diffusion process involves eight rounds and block size in each round is kept different which depends on the secret key used in the proposed scheme. In this scrambling process, shuffling of the pixel values within the same block is performed by a zigzag path which is shown in Figure \hyperref[fig_4]{2}. After the diffusion process, substitution process is applied. In this process, the blocks are reframed and are then passed through four rounds. Since each block depends on the secret key, therefore block size in substitution process differs from the diffusion process. In substitution mechanism, modification in the pixel values are performed within each block and the pixel values are replaced with another pixel values.\par
The proposed scheme is performed to achieve a secure and efficient multimedia communications while its transmission over the network. Moreover, performance and security of the proposed image encryption technique is assured by performing the NIST (National Institute of Standard and Technology) test. The design flow given in Figure \hyperref[fig_3]{1} shows the working of the proposed technique for the encryption of an image. Different units along with their functions that are used in the proposed scheme have been described below in detail. 
\section[{a) Block size of plain image}]{a) Block size of plain image}\par
In the permutation and substitution process, the image pixels are partitioned into various nonoverlapping squared dynamic blocks. The size of these blocks is a secret key dependent which is used in the algorithm. The plain image block sizes in diffusion process are decided by using Equation  {\ref 1}.B r = 4 1 p= ? K (4*(r-1)+p) (Permutation process) ? (1)\par
where, K i = i th subkey and B r = block size in r th round. 
\section[{b) Diffusion process}]{b) Diffusion process}\par
In the diffusion process, pixel values of each dynamic block are shuffled by a zigzag mechanism. For example, the pixels of a block having the size 8*8 are rearranged by a path which is shown in Figure \hyperref[fig_4]{2}. In this figure, suppose the pixel location is at (2, 3) before traversing, the pixel path is found to be at (3, 2) when the traversing process is completed. The block pixels are organized sequentially i.e. row by row and column by column in the same block during the traversing mechanism. The pixels are separated into three RGB channels (red, green and blue). All of these channels pass through eight rounds of scrambling process. The Year 2017 
\section[{( ) F}]{( ) F}\par
Digital Image Encryption Technique using Block based Scrambling and Substitution image pixels in each round are partitioned into various non-overlapping squared dynamic blocks which is discussed above in subsection a. When traversing is started, the path in blocks of r th round of a pixel (X r , Y r ) depends on a secret key which is shown in Equation  {\ref 2}.X r = 3 1 p= ? K (4*(r-1)+p) , Y r = 4 2 p= ? K (4*(r-1)+p) ?? (2)\par
where, K i is the i th subkey.  
\section[{c) Substitution process}]{c) Substitution process}\par
In the substitution process, a simple computation is performed on pixels to change their properties. Each RGB channel of pixels comprises of four rounds. In each round, pixels are partitioned into various non-overlapping dynamic squared blocks which is explained earlier in sub-section a.\par
In this process, bitwise XOR operation is accomplished on the pixels with randomly selected subkey so that their properties can be changed. In the proposed methodology, four rounds are used in the substitution mechanism and each round is secret key dependent used in the algorithm. To illustrate substitution process for random selection of sub key, we have used srand() function of C++ programming language. For first round, seed value for srand() function is used as summation of first four sub keys i.e. K 1 ..K 4 and for second round, seed value for srand() function is chosen as summation of next four sub keys i.e. K 5 .. K 8 and so on. Substitution process is described below: In the proposed encryption algorithm, which consists of two major processes -permutation and substitution \hyperref[b12]{[24]}\hyperref[b13]{[25]}\hyperref[b14]{[26]}. Both permutation and substitution processes completely depends on the secret key. The steps of algorithm are described below.  
\section[{IV. Experimental Results}]{IV. Experimental Results}\par
The data sets required to evaluate the proposed methodology was generated using USC-SIPI image database (http://sipi.usc.edu/database/). The implementation of the proposed algorithm has been performed in C++ programming language and for the analysis of the image data, MATLAB application tool has been used. The permutation and substitution based methodology is evaluated with performance and security measures by which the performance and security of the proposed image encryption algorithm is tested and analysed. 
\section[{a) Pixel distribution}]{a) Pixel distribution}\par
The plain images and its corresponding encrypted images of different sizes are examined and evaluated by histograms. The proposed image encryption algorithm is consistent with the security defined by Shannon \hyperref[b15]{[27,}\hyperref[b16]{28]}.\par
A preferred image "Lena" is analysed by histogram analysis. Histograms of RGB channels of plain image (Figure  {\ref 3}(a)) are shown in Frames (b), (c) and (d) of Figure  {\ref 3} respectively. In Frames (f), (g) and (h) of Figure  {\ref 3}, the histograms of RGB channels of the encrypted image (Figure  {\ref 3(e)}) for the proposed scheme is shown. In Frames (j), (k) and (l) of Figure  {\ref 3}, the histograms of RGB channels of the encrypted image (Figure  {\ref 3(i)}) for AES algorithm is shown respectively.\par
From the histogram analysis of the original, proposed and AES algorithm encryption scheme, we analyze that the histograms of the encrypted image of the proposed methodology i.e. its RGB components are very close to the uniform distribution which is not in case of the original image and do not correspond to the original image. Therefore, the cipher image does not reveal anything about the original image. Year 2017 ( ) 
\section[{b) Correlation between original and encrypted images}]{b) Correlation between original and encrypted images}\par
The correlation coefficient between the different colour channels of the plain and its corresponding encrypted image is calculated using the proposed image encryption scheme and AES algorithm. In Table  {\ref 1} and Table \hyperref[tab_0]{2}, for some images, the results have been calculated. Since the correlation coefficients calculated are very low (C? 0) which is shown in Table  {\ref 1} and Table \hyperref[tab_0]{2}, which therefore indicates that the plain images are different from the encrypted images. And this shows that our result is consistent with the full security defined by Shannon.\par
Table1: Correlation coefficient for the proposed algorithm between plain images and their corresponding encrypted images.\par
Image size  \hyperref[tab_1]{3} shows the entropy value for the proposed encryption scheme and AES algorithm for different images. The information entropy value obtained for the proposed scheme is 7.99 which is very close to the ideal case but in case of AES algorithm, the value obtained is 2.91 which deviates a lot from an ideal case. This shows that the proposed image encryption algorithm achieves a high order of diffusion and substitution and has a robust performance. C R1R2 C R1G2 C R1B2 C G1R2 C G1G2 C G1B2 C B1R2 C B1G2 C B1B2 
\section[{Conclusion}]{Conclusion}\par
The paper presents a block based scrambling and substitution based image encryption technique for designing an efficient, robust and secure encryption scheme for digital data. The proposed image encryption scheme is designed to secure the communication of multimedia data. The necessary security and performance constraints are incorporated in the proposed methodology which provides a good, secure and an efficient image encryption algorithm. The results clearly elaborates that the proposed method is able to generate an encryption scheme which is secure and efficient as compared to the popular standard algorithm.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}D}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}F}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Row=For}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{201}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Input:© 20 7 1 F}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.15289079229122055\textwidth}P{0.11466809421841541\textwidth}P{0.040042826552462524\textwidth}P{0.14925053533190577\textwidth}P{0.02730192719486081\textwidth}P{0.08554603854389721\textwidth}P{0.14014989293361885\textwidth}P{0.04914346895074946\textwidth}P{0.025481798715203428\textwidth}P{0.06552462526766595\textwidth}}
Lena 512*512\tabcellsep -0.0013\tabcellsep -0.00095\tabcellsep \multicolumn{2}{l}{0.0001 -0.0006}\tabcellsep -0.0022\tabcellsep \multicolumn{3}{l}{0.00094 0.00027 -0.0027 0.00044}\\
Baboon 200*200\tabcellsep \multicolumn{2}{l}{-0.0039 -0.0081}\tabcellsep -0.0031\tabcellsep -0.0120\tabcellsep -0.0019\tabcellsep \multicolumn{3}{l}{0.00079 -0.0101 0.00061}\tabcellsep -0.00054\\
Peppers 200*200\tabcellsep \multicolumn{2}{l}{-0.0012 0.0012}\tabcellsep \multicolumn{4}{l}{0.0039 0.00052 0.0020 0.0012}\tabcellsep -0.0020\tabcellsep -0.00005\tabcellsep 0.0052\\
Tiger 800*600\tabcellsep 0.00046\tabcellsep -0.00065\tabcellsep -0.0009\tabcellsep -0.00006\tabcellsep -0.0008\tabcellsep \multicolumn{3}{l}{-0.0007 0.00025 -0.0008}\tabcellsep -0.00009\\
Sunset 440*262\tabcellsep \multicolumn{2}{l}{0.00045 0.0036}\tabcellsep \multicolumn{2}{l}{0.0024 0.0016}\tabcellsep \multicolumn{2}{l}{0.0057 0.0015}\tabcellsep \multicolumn{2}{l}{0.00051 0.0021}\tabcellsep -0.0003\\
Airplane 512*512\tabcellsep 0.0044\tabcellsep 0.0045\tabcellsep \multicolumn{2}{l}{0.0021 0.0042}\tabcellsep \multicolumn{2}{l}{0.0042 0.0015}\tabcellsep 0.0041\tabcellsep 0.0036\tabcellsep 0.00081\end{longtable} \par
 
\caption{\label{tab_0}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.1289655172413793\textwidth}P{0.255\textwidth}P{0.24327586206896554\textwidth}P{0.20810344827586205\textwidth}P{0.0058620689655172415\textwidth}P{0.008793103448275861\textwidth}}
\tabcellsep Entropy of plain images\tabcellsep Entropy of encrypted\tabcellsep \multicolumn{3}{l}{Entropy of encrypted}\\
Images\tabcellsep by proposed and AES\tabcellsep images by Proposed\tabcellsep images\tabcellsep by\tabcellsep AES\\
\tabcellsep Algorithm\tabcellsep Algorithm\tabcellsep Algorithm\tabcellsep \tabcellsep \\
Lena\tabcellsep 7.7502\tabcellsep 7.9997\tabcellsep \multicolumn{2}{l}{2.9109}\tabcellsep \\
Baboon\tabcellsep 7.6430\tabcellsep 7.9983\tabcellsep \multicolumn{2}{l}{2.9184}\tabcellsep \\
Peppers\tabcellsep 7.7150\tabcellsep 7.9982\tabcellsep \multicolumn{2}{l}{2.9234}\tabcellsep \\
Tiger\tabcellsep 7.8261\tabcellsep 7.9999\tabcellsep \multicolumn{2}{l}{2.9076}\tabcellsep \\
Sunset\tabcellsep 7.3460\tabcellsep 7.9988\tabcellsep \multicolumn{2}{l}{2.9097}\tabcellsep \\
Airplane\tabcellsep 6.6639\tabcellsep 7.9995\tabcellsep \multicolumn{2}{l}{2.9127}\tabcellsep \\
V.\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_1}Table 3 :}\end{figure}
 			\footnote{© 2017 Global Journals Inc. (US)} 			\footnote{. Chen, T., Wang, J., \& Zhou, Y. 2001. Combined} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Fips ()]{b0}\label{b0} 	 		\textit{140-1: Security requirements for cryptographic modules},  		 			P Fips 		.  		1994. p. 11.  		 			National Institute of Standards and Technology 		 	 
\bibitem[Fips ()]{b1}\label{b1} 	 		\textit{140-2. Security Requirements for Cryptographic Modules},  		 			P Fips 		.  		2001. p. 25.  	 
\bibitem[Yu et al. ()]{b9}\label{b9} 	 		‘A chaos-based image encryption algorithm using wavelet transform’.  		 			Z Yu 		,  		 			Z Zhe 		,  		 			Y Haibing 		,  		 			P Wenjie 		,  		 			Z Yunpeng 		.  	 	 		\textit{IEEE 2nd International Conference in Advanced Computer Control},  				2010. 2 p. .  	 
\bibitem[Zhao et al. ()]{b13}\label{b13} 	 		‘A Chaos-based Image Encryption Scheme Using Permutation Substitution Architecture’.  		 			J Zhao 		,  		 			W Guo 		,  		 			R Ye 		.  	 	 		\textit{International Journal of Computer Trends and Technology}  		2014. 15  (4)  p. .  	 
\bibitem[Shannon ()]{b15}\label{b15} 	 		‘A mathematical theory of communication’.  		 			C E Shannon 		.  	 	 		\textit{bell System technical Journal}  		1948. 27 p. .  	 
\bibitem[Zeghid et al. ()]{b5}\label{b5} 	 		‘A modified AES based algorithm for image encryption’.  		 			M Zeghid 		,  		 			M Machhout 		,  		 			L Khriji 		,  		 			A Baganne 		,  		 			R Tourki 		.  	 	 		\textit{International Journal of Computer Science and Engineering}  		2007. 1  (1)  p. .  	 
\bibitem[Lai et al. ()]{b8}\label{b8} 	 		‘A Novel Image Encryption Algorithm Based on Fractional Fourier Transform and Chaotic System’.  		 			J Lai 		,  		 			S Liang 		,  		 			D Cui 		.  	 	 		\textit{IEEE International Conference on Multimedia Communications},  				2010. p. .  	 
\bibitem[Yahya and Abdalla ()]{b12}\label{b12} 	 		‘A shuffle image-encryption algorithm’.  		 			A A Yahya 		,  		 			A M Abdalla 		.  	 	 		\textit{Journal of Computer Science}  		2008. 4  (12)  p. .  	 
\bibitem[Rijmen and Daemen ()]{b4}\label{b4} 	 		‘Advanced encryption standard’.  		 			V Rijmen 		,  		 			J Daemen 		.  	 	 		\textit{Proceedings of Federal Information Processing Standards Publications},  				 (Federal Information Processing Standards Publications)  		2001. p. .  		 			National Institute of Standards and Technology 		 	 
\bibitem[Shannon ()]{b16}\label{b16} 	 		‘Communication Theory of Secrecy Systems’.  		 			C E Shannon 		.  	 	 		\textit{Bell System of Technical Journal}  		1949. 28  (4)  p. .  	 
\bibitem[Pub ()]{b7}\label{b7} 	 		\textit{Data Encryption Standard (DES). FIPS PUB},  		 			F Pub 		.  		1999. p. .  	 
\bibitem[Narendra and Pareek ()]{b11}\label{b11} 	 		‘Design and analysis of a novel digital Image encryption scheme’.  		 			K Narendra 		,  		 			Pareek 		.  	 	 		\textit{International Journal of Network Security \& Its Applications}  		2012. 4  (2)  p. .  	 
\bibitem[Noura et al. ()]{b10}\label{b10} 	 		‘Design of a Fast and Robust Chaos-Based Cryptosystem for image encryption’.  		 			H Noura 		,  		 			S El Assad 		,  		 			C Vl?deanu 		.  	 	 		\textit{IEEE 8th International Conference on Communications (COMM)},  				2010. p. .  	 
\bibitem[Subramanyan et al. ()]{b6}\label{b6} 	 		\textit{Image encryption based on AES key on Emerging of Information Technology},  		 			B Subramanyan 		,  		 			V M Chhabria 		,  		 			T S Babu 		.  		2011. p. .  	 
\bibitem[Diffie and Hellman ()]{b2}\label{b2} 	 		‘New directions in cryptography’.  		 			W Diffie 		,  		 			M Hellman 		.  	 	 		\textit{IEEE transactions on Information Theory}  		1976. 22  (6)  p. .  	 
\bibitem[Jolfaei et al. ()]{b14}\label{b14} 	 		‘On the Security of Permutation-Only Image Encryption Schemes’.  		 			A Jolfaei 		,  		 			X W Wu 		,  		 			V Muthukkumarasamy 		.  	 	 		\textit{IEEE Transactions on Information Forensics and Security}  		2016. 11  (2)  p. .  	 
\bibitem[Daemen and Rijmen ()]{b3}\label{b3} 	 		‘The design of \{Rijndael\}:\{AES\}---the \{Advanced’.  		 			J Daemen 		,  		 			V Rijmen 		.  	 	 		\textit{Journal of Cryptology}  		1991. 4  (1)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
