\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={The Encryption Algorithms GOST-IDEA16-2 and GOST-RFWKIDEA16-2},
 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{2016-01-15 (revised: 15 January 2016)}
\def\TheID{\makeatother }
\def\TheDate{2016-01-15}
\title{The Encryption Algorithms GOST-IDEA16-2 and GOST-RFWKIDEA16-2}
\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]{Tuychiev  Gulom}

             \affil[1]{  National University of Uzbekistan}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2015 Accepted: 1 January 2016 Published: 15 January 2016}

\maketitle


\begin{abstract}
        


In the paper created a block encryption algorithms GOST28147-89-IDEA16-2 and GOST28147-89-RFWKIDEA16- 2 based on networks IDEA16-2 and RFWKIDEA16-2, with the use the round function of the encryption algorithm GOST 28147-89. The block length of created block encryption algorithm is 128 bits, the number of rounds is 8, 12 and 16.

\end{abstract}


\keywords{GOST 28147-89, Lai-Massey scheme, round function, round keys, output transformation}

\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
he encryption algorithm GOST 28147-89 is a standard encryption algorithm of the Russian Federation. It is based on a Feistel network. This encryption algorithm is suitable for hardware and software implementation, meets the necessary cryptographic requirements for resistance and, therefore, does not impose restrictions on the degree of secrecy of the information being protected. The algorithm implements the encryption of 64-bit blocks of data using the 256 bit key. In round functions used eight S-box of size 4x4 and operation of the cyclic shift by 11 bits. To date GOST 28147-89 is resistant to cryptographic attacks.\par
On the basis of encryption algorithm IDEA and scheme Lai-Massey developed the networks IDEA16-2 and RFWKIDEA16-2, consisting from two round function. In the networks IDEA16-2 and RFWKIDEA16-2, similarly as in the Feistel network, when it encryption and decryption using the same algorithm. In the networks used two round function having four input and output blocks and as the round function can use any transformation.\par
As the round function networks IDEA4-2 \hyperref[b0]{[1]}, RFWKIDEA4-2 \hyperref[b4]{[5]}, PES4-2 \hyperref[b5]{[6]}, RFWKPES4-2 \hyperref[b6]{[7]}, PES8-4 \hyperref[b1]{[2]}, RFWKPES8-4 \hyperref[b7]{[8]} using the round function of the encryption algorithm GOST 28147-89 [4] created the encryption algorithm GOST28147-89-IDEA4-2 \hyperref[b8]{[9]}, GOST28147-89-RFWKIDEA4-2 \hyperref[b9]{[10]}, GOST28147-89-PES4-2 \hyperref[b10]{[11]}, GOST28147-89-RFWKPES4-2 \hyperref[b11]{[12]}, GOST28147-89-PES8-4 [13] and GOST28147-89-RFWKPES8-4  {\ref [13]}.\par
In this paper, applying the round function of the encryption algorithm GOST 28147-89 as round functions of the networks IDEA16-2 \hyperref[b12]{[14]} and RFWKIDEA16-2 \hyperref[b14]{[15]}, developed new encryption algorithms GOST28147-89-IDEA16-2 and GOST28147-89-RFWKIDEA16-2.\par
In the encryption algorithms GOST28147-89-IDEA16-2 and GOST28147-89-RFWKIDEA16-2 block length is 256 bits, the key length is changed from 256 bits to 1024 bits in increments of 128 bits and a number of rounds equal to 8, 12, 16, allowing the user depending on the degree of secrecy of information and speed of encryption to choose the number of rounds and key length. Below is the structure of the proposed encryption algorithm. 
\section[{II.}]{II.}\par
The Structure of the Encryption Algorithm Gost28147-89-Idea16-2\par
In the encryption algorithm GOST28147-89-IDEA16-2 the length of subblocks 0 X , 1 X , 2 X ,..., 15 X\par
, length of round keys   {\ref 1} and the S-boxes shown in Table  {\ref 1}.\par
Consider the round function block encryption algorithm GOST28147-89-IDEA16-2. First the 8-bit subblocks 0 T , 1 T , ..., 
\section[{7}]{7}\par
T combined from 32-bit subblocks, i.e. = 0 T 3 2 1 0 || || || T T T T , = 1 T 7 6 5 4 || || || T T T T . Subblocks 0 T , 1 T are summed round keys || || || 18 ) 1 ( 24 17 ) 1 ( 24 16 ) 1 ( 24 + ? + ? + ? i i i K K K 19 ) 1 ( 24 + ? i K , 23 ) 1 ( 24 22 ) 1 ( 24 21 ) 1 ( 24 20 ) 1 ( 24 || || || + ? + ? + ? + ? i i i i K K K K i.e.+ ? + ? + ? + ? + = i i i i K K K K T S , ) || || || ( 23 ) 1 ( 24 22 ) 1 ( 24 21 ) 1 ( 24 20 ) 1 ( 24 1 1 + ? + ? + ? + ? + = i i i i K K K K T S .\par
T Figure  {\ref 1} : The scheme n-rounded encryption algorithm GOST28147-89-IDEA16-2   The S-boxes of encryption algorithm GOST28147-89-RFWKPES4-2 0x0 0x1 0x2 0x3 0x4 0x5 0x6 0x7 0x8 0x9 0xA 0xB 0x? 0xD 0xE 0xF S0 0x4 0x5 0xB 0x9 0xE 0x8 0xD 0x0 0x6 0xC 0xF 0x7 0x2 0x1 0x3 0xA S1 0x5 0x4 0xA 0x8 0xF 0x9 0xC 0x1 0x7 0xD 0xE 0x6 0x3 0x0 0x2 0xB S2 0xE 0xB 0x4 0x2 0xF 0x7 0xC 0x0 0x8 0x9 0xA 0xD 0x6 0x5 0x3 0x1 S3 0xF 0xA 0x5 0x3 0xE 0x6 0xD 0x1 0x9 0x8 0xB 0xC 0x7 0x4 0x2 0x0 S4 0xD 0xC 0xB 0x1 0x4 0x0 0xF 0x3 0x7 0xE 0x5 0x6 0x9 0x2 0x8 0xA S5 0xA 0x3 0x4 0x6 0xB 0xF 0x0 0xC 0x8 0x9 0x2 0x1 0xE 0x5 0x7 0xD S6 0xB 0x2 0x5 0x7 0xA 0xE 0x1 0xD 0x9 0x8 0x3 0x0 0xF 0x4 0x6 0xC S7 0xC 0x5 0x2 0x0 0xD 0x9 0x6 0xA 0xE 0xF 0x4 0x7 0x8 0x3 0x1 0xB S8 0xD 0x4 0x3 0x1 0xC 0x8 0x7 0xB 0xF 0xE 0x5 0x6 0x9 0x2 0x0 0xA S9 0xE 0x7 0x0 0x2 0xF 0xB 0x4 0x8 0xC 0xD 0x6 0x5 0xA 0x1 0x3 0x9 S10 0xF 0x6 0x1 0x3 0xE 0xA 0x5 0x9 0xD 0xC 0x7 0x4 0xB 0x0 0x2 0x8 S11 0x1 0x0 0x7 0x5 0x8 0x4 0xB 0xF 0x3 0xA 0x9 0x2 0xD 0xE 0xC 0x6 S12 0x2 0x3 0x4 0x6 0xB 0x7 0x8 0xC 0x0 0x9 0xA 0x1 0xE 0xD 0xF 0x5 S13 0x3 0x2 0x5 0x7 0xA 0x6 0x9 0xD 0x1 0x8 0xB 0x0 0xF 0xC 0xE 0x4 S14 0x4 0x5 0x2 0x0 0xD 0x1 0xE 0xA 0x6 0xF 0xC 0x7 0x8 0xB 0x9 0x3 S15 0x5 0x4 0x3 0x1 0xC 0x0 0xF 0xB 0x7 0xE 0xD 0x6 0x9 0xA 0x8 0x2 32-bit subblocks  K : j n j j K X X + + ? = 16 24 0 0 , 15 ... 0 = j . 2. subblocks 0 0 X , 1 0 X , 2 0 X , ..., 15 0\par
X multiplied and summed respectively with the round keys ) 1 ( 24 ? i K , 1 ) 1 ( 24 + ? i K , 2 ) 1 ( 24 + ? i K , ?,) ( ) ( 8 ) 1 ( 24 8 1 ) 1 ( 24 0 1 0 + ? ? ? ? ? ? + = i i i i K X K X T , ) ( ) ( 9 ) 1 ( 24 9 1 1 ) 1 ( 24 1 1 1 + ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 10 ) 1 ( 24 10 1 2 ) 1 ( 24 2 1 2 + ? ? + ? ? ? ? + = i i i i K X K X T , ) ( ) ( 11 ) 1 ( 24 11 1 3 ) 1 ( 24 3 1 3 + ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 12 ) 1 ( 24 12 1 4 ) 1 ( 24 4 1 4 + ? ? + ? ? ? ? + = i i i i K X K X T , ) ( ) ( 13 ) 1 ( 24 13 1 5 ) 1 ( 24 5 1 5 + ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 14 ) 1 ( 24 14 1 6 ) 1 ( 24 6 1 6 + ? ? + ? ? ? ? + = i i i i K X K X T , ) ( ) ( 15 ) 1 ( 24 15 1 7 ) 1 ( 24 7 1 7 + ? ? + ? ? + ? ? = i i i i K X K X T , 1 = i . 3. to 8-bit subblocks 0 T , 1 T , 2 T , ..., 7\par
T applied round functions and get 8-bit subblocks0 Y , 1 Y , 2 Y , ..., 7 Y . 4. subblocks 0 Y , 1 Y , 2 Y , ..., 7 Y are summed to XOR with subblocks 0 1 ? i X , 1 1 ? i X , 2 1 ? i X , ..., 15 1 ? i X , i. ?. j j i j i Y X X ? ? ? ? = 7 1 1 , j j i j i Y X X ? + ? + ? ? = 7 8 1 8 1 , 7 ... 0 = j , 1 = i . 5\par
. at the end of the round subblocks swapped, i.\par
?.,  j i j i X X ? ? = 15 1 , 14 ... 1 = j , 1 = i 6. repeating steps 2-5 n times, i.e., n i ... 2 = obtain subblocks 0 n X , 1 n X , 2 n X , ...,+ = + , 1 24 14 1 1 + + ? = n n n K X X , 2 24 13 2 1 + + + = n n n K X X , 3 24 12 3 1 + + ? = n n n K X X , 4 24 11 4 1 + + + = n n n K X X , 5 24 10 5 1 + + ? = n n n K X X , 6\textbf{24}9 6 1 + + + = n n n K X X , 7 24 8 7 1 + + ? = n n n K X X , 8 24 7 8 1 + + ? = n n n K X X , 9 24 6 9 1 + + + = n n n K X X , 10\textbf{24}5 10 1 + + ? = n n n K X X , 11\textbf{24}4 11 1 + + + = n n n K X X , 12 24 3 12 1 + + ? = n n n K X X , 13 24 2 13 1 + + + = n n n K X X , 14\textbf{24}1 14 1 + + ? = n n n K X X , 15\textbf{24}15 15 1 + + + = n n n K X X 8. subblocks 0 1 + n X , 1 1 + n X , 2 1 + n X , ...,K : j n j n j n K X X + + + + ? = 32 24 1 1 , 7 ... 0 = j .\par
As ciphertext plaintext X receives the combined 8-bit subblocks + + + + n n n n X X X X . III. 
\section[{KEY GENERATION OF THE ENCRYPTION ALGORITHM GOST28147-89-IDEA16-2}]{KEY GENERATION OF THE ENCRYPTION ALGORITHM GOST28147-89-IDEA16-2}\par
In n-round encryption algorithm GOST28147-89-IDEA16-2 in each round used twenty four round keys of the 8-bit and output transformation sixteen round keys of the 8-bit. In addition, before the first round and after the output transformation we used sixteen round keys of 8-bits. Total number of 8-bit round keys is equal to 24n+48. In Figure  {\ref 4}  The key encryption algorithm K of length l ( 1024 256 ? ? l) bits is divided into 8-bit round keys c K 0 , c K 1 ,..., c Lenght K 1 ? , 8 / l Lenght = , here \} ,..., , \{ 1 1 0 ? = l k k k K , \} ,..., , \{ 7 1 0 0 k k k K c = , \} ,..., , \{ 15 9 8 1 k k k K c = ,..., \} ,..., , \{ 1 7 8 1 ? ? ? ? = l l l c Lenght k k k K and c Lenght c c K K K K 1 1 0 || ... || || ? = .\par
Then we calculatec Lenght c c L K K K K 1 1 0 ... ? ? ? ? = . If 0 = L K then L K is chosen as 0xC5, i.e. L K =0xC5. Round keys c i K , 47 24 ... + = n Lenght i are computed as follows )) ( ( 1 ) ( 0 1 c Lenght i c Lenght i c i K RotWord Sbox K Sbox K + ? ? ? = L K ? .\par
After each round key generation the value L K is cyclic shift to the left by 1 bit. Here, RotWord8()-cyclic shift to the left of 1 bit of the 11-bit subblock, Sboxtransformation a 8-bit subblock in the S-boxes,  ) ( || ) ( ) ( 0 1 1 0 0 t S t S S Sbox = , ) ( || ) ( ) (). , ) ( , , ) ( , , ) ( , , )\textbf{( , ) ( , , ) ( , , ) ( , , ) ( , ( ) , , , , , , , , , , , , , , , ( 15 1}K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K ? ? ? ? ? ? ? ? = ? ? ? ? ? ? ? ? + + + + + + + + + + + + + + +\par
Decryption round keys of the first round associate with of encryption round keys as follows:\par
). , , , ,   . ... 2 ), , ,  K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K + ? + ? + ? + ? + ? +n i K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K c i 
\section[{THE STRUCTURE OF THE ENCRYPTION ALGORITHM GOST28147-89-RFWKIDEA16-2}]{THE STRUCTURE OF THE ENCRYPTION ALGORITHM GOST28147-89-RFWKIDEA16-2}\par
In the encryption algorithm GOST28147-89-RFWKIDEA16-2 the length of subblocks0 X , 1 X , 2 X ,..., 15\par
X , length of round keys   ) 1 ( 16 ? i K , 1 ) 1 ( 16 + ? i K , 2 ) 1 ( 16 + ? i K , ?,11 0 0 << = R Y , 11 1 1 << = R Y . Thereafter 32-bit subblocks 0 Y , 1 Y divided into four 8-bit subblocks 0 Y , 1 Y , ..., 7 Y i.e., = 0 Y 3 2 1 0 || || || Y Y Y Y , = 1 Y 7 6 5 4 || || || Y Y Y Y .\par
Consider the encryption process of encryption algorithm GOST28147-89-IDEA16-2. Initially the 128-bit plaintext \$X\$ partitioned into subblocks of 8-bits 0 0 X , 1 0 X , 2 0 X , ...) 1 ( 16 ? i K , 1 ) 1 ( 16 + ? i K , 2 ) 1 ( 16 + ? i K , ..., 15 ) 1 ( 16 + ? i K and calculated 8-bit subblocks 0 T , 1 T , 2 T , ?, 7\par
T . This step can be represented as follows:) ( ) ( 8 ) 1 ( 16 8 1 ) 1 ( 16 0 1 0 + ? ? ? ? ? ? + = i i i i K X K X T , ) ( ) ( 9 ) 1 ( 16 9 1 1 ) 1 ( 16 1 1 1 + ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 10 ) 1 ( 16 10 1 2 ) 1 ( 16 2 1 2 + ? ? + ? ? ? ? + = i i i i K X K X T , ) ( ) ( 11 ) 1 ( 16 11 1 3 ) 1 ( 16 3 1 3 + ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 12 ) 1 ( 16 12 1 4 ) 1 ( 16 4 1 4 + ? ? + ? ? ? ? + = i i i i K X K X T , ) ( ) ( 13 ) 1 ( 16 13 1 5 ) 1 ( 16 5 1 5 + ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 14 ) 1 ( 16 14 1 6 ) 1 ( 16 6 1 6 + ? ? + ? ? ? ? + = i i i i K X K X T , ) ( ) ( 15 ) 1 ( 16 15 1 7 ) 1 ( 16 7 1 7 + ? ? + ? ? + ? ? = i i i i K X K X T , 1 = i . 3. to 8-bit subblocks 0 T , 1 T , 2\par
T , ..., 7 T applied round functions and get 8-bit subblocks  0 Y , 1 Y , 2 Y , ..., 7 Y . 4. subblocks 0 Y , 1 Y , 2 Y , ..., 7 Y are summed to XOR with subblocks 0 1 ? i X , 1 1 ? i X , 2 1 ? i X , ?, 15 1 ? i X i.?. j j i j i Y X X ? ? ? ? = 7 1 1 , j j i j i Y X X ? + ? + ? ? =+ + + + n n n n X X X X . V. 
\section[{KEY GENERATION OF THE ENCRYPTION ALGORITHM GOST28147-89-RFWKIDEA16-2}]{KEY GENERATION OF THE ENCRYPTION ALGORITHM GOST28147-89-RFWKIDEA16-2}\par
In n-round encryption algorithm GOST28147-89-IDEA16-2 in each round used sixteen round keys of the 8-bit and output transformation sixteen round keys of the 8-bit. In addition, before the first round and after the output transformation we used sixteen round keys of 8bits. Total number of 8-bit round keys is equal to 16n+48. In Figure  {\ref 4}  ) bits is divided into 8-bit round keysc K 0 , c K 1 ,..., c Lenght K 1 ? , 8 / l Lenght = , here \} ,..., , \{ 1 1 0 ? = l k k k K , \} ,..., , \{ 7 1 0 0 k k k K c = , \} ,..., , \{ 15 9 8 1 k k k K c = , ..., \} ,..., , \{ 1 7 8 1 ? ? ? ? = l l l c Lenght k k k K and c Lenght c c K K K K 1 1 0 || ... || || ? = . Then we calculate c Lenght c c L K K K K 1 1 0 ... ? ? ? ? = . If 0 = L K then L K is chosen as 0xC5, i.e. L K =0xC5. Round keys c i K , 47 16 ... + = n Lenght i are computed as follows ? = ? ) ( 0 c Lenght i c i K Sbox K L c Lenght i K K RotWord Sbox ? + ? )) ( (\textbf{1 1}\par
. After each round key generation the value L K is cyclic shift to the left by 1 bit.\par
Here, RotWord8()-cyclic shift to the left of 1 bit of the 11bit subblock, Sbox-transformation a 8-bit subblock in the S-boxes,  ) ( || ) ( ) ( 0 1 3 0 2 t S t S T Sbox = , ) ( || ) ( ) ( 1K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K ? ? ? ? ? ? ? ? = ? ? ? ? ? ? ? ? + + + + + + + + + + + + + + +\par
Decryption round keys of the first round associate with of encryption round keys as follows:     ). , ) ( , , )\textbf{( , , ) ( , , ) ( , ) ( , , ) ( , , ) ( , , ) ( , ( ) , , , , , , , , , , , , , , , ( 15 16}K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K Kn i K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K 
\section[{RESULTS}]{RESULTS}\par
As a result of this study built a new block encryption algorithms called GOST28147-89-IDEA16-2 and GOST28147-89-RFWKIDEA16-2. This algorithm is based on a networks IDEA16-2 and RFWKIDEA16-2 using the round function of GOST 28147-89. Length of block encryption algorithm is 128 bits, the number of rounds and key lengths is variable. Wherein the user depending on the degree of secrecy of the information and speed of encryption can select the number of rounds and key length.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_6}=}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_7}}\end{figure}
       \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_2}Table}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.11149217809867629\textwidth}P{0.06648616125150421\textwidth}P{0.001022864019253911\textwidth}P{0.001022864019253911\textwidth}P{0.04909747292418773\textwidth}P{0.01125150421179302\textwidth}P{0.007160048134777376\textwidth}P{0.009205776173285198\textwidth}P{0.026594464500601687\textwidth}P{0.01125150421179302\textwidth}P{0.06648616125150421\textwidth}P{0.001022864019253911\textwidth}P{0.004091456077015644\textwidth}P{0.003068592057761733\textwidth}P{0.015342960288808664\textwidth}P{0.002045728038507822\textwidth}P{0.007160048134777376\textwidth}P{0.002045728038507822\textwidth}P{0.003068592057761733\textwidth}P{0.003068592057761733\textwidth}P{0.006137184115523466\textwidth}P{0.004091456077015644\textwidth}P{0.006137184115523466\textwidth}P{0.002045728038507822\textwidth}P{0.002045728038507822\textwidth}P{0.054211793020457276\textwidth}P{0.06239470517448856\textwidth}P{0.04193742478941035\textwidth}P{0.055234657039711185\textwidth}P{0.023525872442839952\textwidth}P{0.02250300842358604\textwidth}P{0.028640192539109505\textwidth}P{0.016365824308062576\textwidth}P{0.018411552346570395\textwidth}P{0.018411552346570395\textwidth}P{0.02045728038507822\textwidth}P{0.02250300842358604\textwidth}P{0.015342960288808664\textwidth}P{0.009205776173285198\textwidth}P{0.006137184115523466\textwidth}P{0.008182912154031288\textwidth}P{0.003068592057761733\textwidth}P{0.001022864019253911\textwidth}}
\multicolumn{26}{l}{7. in output transformation round keys}\tabcellsep n K 16 ,\tabcellsep 1 16 + n K ,\\
K\tabcellsep \multicolumn{4}{l}{16 + n}\tabcellsep 2\tabcellsep \multicolumn{3}{l}{, ...,}\tabcellsep \tabcellsep \multicolumn{4}{l}{K}\tabcellsep \multicolumn{9}{l}{16 + n}\tabcellsep \multicolumn{3}{l}{15}\tabcellsep are multiplied and summed into\\
\multicolumn{9}{l}{subblocks}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \multicolumn{12}{l}{0 n X ,}\tabcellsep 1 n X ,\tabcellsep 2 n X , ...,\tabcellsep 15 n X , i.e.\\
X\tabcellsep \multicolumn{3}{l}{n 0 +}\tabcellsep 1\tabcellsep \multicolumn{2}{l}{=}\tabcellsep X\tabcellsep n 0\tabcellsep \multicolumn{4}{l}{+}\tabcellsep \multicolumn{4}{l}{K}\tabcellsep \multicolumn{7}{l}{16}\tabcellsep \multicolumn{2}{l}{n}\tabcellsep ,\tabcellsep X\tabcellsep 1 n\tabcellsep +\tabcellsep 1\tabcellsep =\tabcellsep X\tabcellsep 14 n\tabcellsep ?\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep 1 +\tabcellsep ,\\
X\tabcellsep \multicolumn{4}{l}{2 + 1 n}\tabcellsep \multicolumn{2}{l}{=}\tabcellsep X\tabcellsep \multicolumn{2}{l}{13 n}\tabcellsep \multicolumn{3}{l}{+}\tabcellsep \tabcellsep \multicolumn{6}{l}{K}\tabcellsep \multicolumn{6}{l}{16}\tabcellsep n\tabcellsep +\tabcellsep 2\tabcellsep ,\tabcellsep X\tabcellsep 3 + n\tabcellsep 1\tabcellsep =\tabcellsep X\tabcellsep 12 n\tabcellsep ?\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep +\tabcellsep 3\tabcellsep ,\\
X\tabcellsep \multicolumn{4}{l}{4 + 1 n}\tabcellsep \multicolumn{2}{l}{=}\tabcellsep X\tabcellsep \multicolumn{2}{l}{11 n}\tabcellsep \multicolumn{3}{l}{+}\tabcellsep \tabcellsep \multicolumn{6}{l}{K}\tabcellsep \multicolumn{5}{l}{16}\tabcellsep n\tabcellsep +\tabcellsep 4\tabcellsep ,\tabcellsep X\tabcellsep 5 + n\tabcellsep 1\tabcellsep =\tabcellsep X\tabcellsep 10 n\tabcellsep ?\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep +\tabcellsep 5\tabcellsep ,\\
X\tabcellsep \multicolumn{4}{l}{6 + 1 n}\tabcellsep \multicolumn{2}{l}{=}\tabcellsep X\tabcellsep 9 n\tabcellsep \multicolumn{4}{l}{+}\tabcellsep \multicolumn{4}{l}{K}\tabcellsep \tabcellsep \multicolumn{6}{l}{16}\tabcellsep \multicolumn{2}{l}{n}\tabcellsep +\tabcellsep 6\tabcellsep ,\tabcellsep X\tabcellsep 7 + 1 n\tabcellsep =\tabcellsep X\tabcellsep 8 n\tabcellsep ?\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep +\tabcellsep 7\tabcellsep ,\\
X\tabcellsep \multicolumn{4}{l}{8 + 1 n}\tabcellsep \multicolumn{2}{l}{=}\tabcellsep X\tabcellsep 7 n\tabcellsep \multicolumn{3}{l}{?}\tabcellsep \multicolumn{4}{l}{K}\tabcellsep \multicolumn{3}{l}{16}\tabcellsep \multicolumn{3}{l}{n}\tabcellsep \multicolumn{4}{l}{+}\tabcellsep 8\tabcellsep ,\tabcellsep X\tabcellsep 9 + 1 n\tabcellsep =\tabcellsep X\tabcellsep 6 n\tabcellsep +\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep +\tabcellsep 9\tabcellsep ,\\
X\tabcellsep \multicolumn{2}{l}{10 + n}\tabcellsep \multicolumn{2}{l}{1}\tabcellsep \multicolumn{2}{l}{=}\tabcellsep X\tabcellsep 5 n\tabcellsep \multicolumn{2}{l}{?}\tabcellsep \tabcellsep \multicolumn{4}{l}{K}\tabcellsep \multicolumn{3}{l}{16}\tabcellsep \multicolumn{3}{l}{n}\tabcellsep \multicolumn{3}{l}{+}\tabcellsep 10\tabcellsep ,\tabcellsep X\tabcellsep 11 + 1 n\tabcellsep =\tabcellsep X\tabcellsep 4 n\tabcellsep +\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep 11 +\tabcellsep ,\\
X\tabcellsep \multicolumn{4}{l}{12 + 1 n}\tabcellsep \multicolumn{2}{l}{=}\tabcellsep X\tabcellsep 3 n\tabcellsep \multicolumn{2}{l}{?}\tabcellsep \tabcellsep \multicolumn{3}{l}{K}\tabcellsep \tabcellsep \multicolumn{3}{l}{16}\tabcellsep \multicolumn{3}{l}{n}\tabcellsep \multicolumn{4}{l}{12 +}\tabcellsep ,\tabcellsep X\tabcellsep 13 + 1 n\tabcellsep =\tabcellsep X\tabcellsep 2 n\tabcellsep +\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep 13 +\tabcellsep ,\\
X\tabcellsep 14 + n\tabcellsep \multicolumn{3}{l}{1}\tabcellsep \multicolumn{2}{l}{=}\tabcellsep X\tabcellsep 1 n\tabcellsep ?\tabcellsep \tabcellsep \tabcellsep \multicolumn{3}{l}{K}\tabcellsep \multicolumn{3}{l}{16}\tabcellsep \multicolumn{3}{l}{n}\tabcellsep \multicolumn{5}{l}{14 +}\tabcellsep ,\tabcellsep X\tabcellsep 15 + 1 n\tabcellsep =\tabcellsep X\tabcellsep 15 n\tabcellsep +\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep 15 +\tabcellsep .\\
\multicolumn{9}{l}{8. subblocks}\tabcellsep \tabcellsep \multicolumn{16}{l}{0 + 1 n X , 1 n X , 2 1 + + 1 n X , ..., 15 + 1 n X are summed}\\
\multicolumn{26}{l}{to XOR with the round key}\tabcellsep K\tabcellsep 16 + n\tabcellsep 32\tabcellsep ,\tabcellsep K\tabcellsep 16 + n\tabcellsep 33\tabcellsep ,\tabcellsep K\tabcellsep 16 + n\tabcellsep 34\tabcellsep , ..,\\
K\tabcellsep \multicolumn{4}{l}{16 + n}\tabcellsep 47\tabcellsep :\tabcellsep \multicolumn{2}{l}{X}\tabcellsep \multicolumn{2}{l}{j n +}\tabcellsep \multicolumn{2}{l}{1}\tabcellsep \multicolumn{4}{l}{=}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \multicolumn{6}{l}{X}\tabcellsep j n +\tabcellsep 1\tabcellsep ?\tabcellsep K\tabcellsep 16\tabcellsep n\tabcellsep +\tabcellsep 32\tabcellsep +\tabcellsep j\tabcellsep ,\tabcellsep j\tabcellsep =\tabcellsep 0\tabcellsep 7 ...\tabcellsep .\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \multicolumn{22}{l}{As ciphertext plaintext X receives the combined}\\
\multicolumn{10}{l}{8-bit subblocks}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep 0\tabcellsep \tabcellsep \tabcellsep \tabcellsep \multicolumn{3}{l}{1}\tabcellsep \tabcellsep \tabcellsep ||\tabcellsep 1\tabcellsep 1\tabcellsep ||\tabcellsep 2\tabcellsep 1\tabcellsep ||\tabcellsep ...\tabcellsep ||\tabcellsep 15\tabcellsep 1\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep i\tabcellsep =\tabcellsep 2\tabcellsep n ...\tabcellsep obtain\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep subblocks 0 n X , 1 n X , 2 n X , ..., 15 n X .\end{longtable} \par
 
\caption{\label{tab_13}}\end{figure}
 			\footnote{© 2016 Global Journals Inc. (US)} 			\footnote{Year 2016 ( ) E} 			\footnote{c n d d d d d d d d d d d d d d d d d d d d d} 			\footnote{T combined from 32-bit © 2016 Global Journals Inc. (US)} 		 		\backmatter  			 \par
). , ) (\par
following Table  {\ref 2} summarizes options openly declared S-box such as: deg -degree of algebraic nonlinearity; NL -nonlinearity; ? -resistance to linear cryptanalysis; ? -resistance to differential cryptanalysis; SAC-strict avalanche criterion; BIC-bit independence criterion.To Sbox was resistant to cryptanalysis it is necessary that the values deg and NL were large, and the values ? , ? , SAC and BIC small. In block cipher algorithms GOST28147-89-IDEA16-2 and GOST28147-89-RFWKIDEA16-2 for all S-boxes, the following equation:\par
i.e. resistance is not lower than the algorithm GOST 28147-89. These S-boxes are created based on Nyberg construction \hyperref[b2]{[3]}. IV. 
\subsection[{CONCLUSIONS}]{CONCLUSIONS}\par
In this way, built a new block encryption algorithms called GOST28147-89-IDEA16-2 and GOST28147-89-RFWKIDEA16-2 based on networks IDEA16-2 and RFWKIDEA16-2 using the round function of GOST 28147-89. Installed that the resistance offered by the author block cipher algorithm not lower than the resistance of the algorithm GOST 28147-89.			 			  				\begin{bibitemlist}{1}
\bibitem[Bakhtiyorov and Tuychiev ()]{b2}\label{b2} 	 		\textit{About Generation Resistance S Box And Boolean Function On The Basis Of Nyberg Construction // Materials scientifictechnical conference «Applied mathematics and information security},  		 			U Bakhtiyorov 		,  		 			G Tuychiev 		.  		2014, 28-30 april. Tashkent. p. .  	 
\bibitem[Tuychiev ()]{b12}\label{b12} 	 		\textit{About networks IDEA16-4, IDEA16-2, IDEA16-1, created on the basis of network IDEA16-8 // Compilation of theses and reports republican seminar «Information security in the sphere communication and information. Problems and their solutions},  		 			G N Tuychiev 		.  		2014. Tashkent.  	 
\bibitem[Tuychiev ()]{b6}\label{b6} 	 		\textit{About networks PES4-1 and RFWKPES4-2, RFWKPES4-1 developed on the basis of network PES4-2 // Uzbek journal of the problems of informatics and energetics},  		 			G N Tuychiev 		.  		2015. Tashkent. p. .  	 
\bibitem[Tuychiev ()]{b14}\label{b14} 	 		‘About networks RFWKIDEA16-8, RFWKIDEA16-4, RFWKIDEA16-2, RFWKIDEA16-1, created on the basis network IDEA16-8 // Ukrainian Scientific Journal of Information Security’.  		 			G N Tuychiev 		.  	 	 		\textit{Kyev}  		2014. 20  (3)  p. .  	 
\bibitem[Tuychiev ()]{b7}\label{b7} 	 		\textit{About networks RFWKPES8-4, RFWKPES8-2, RFWKPES8-1, developed on the basis of network PES8-4 // Transactions of the international scientific conference «Modern problems of applied mathematics and information technologies-Al-Khorezmiy},  		 			G N Tuychiev 		.  		2012. 2014. p. .  	 
\bibitem[Tuychiev]{b8}\label{b8} 	 		\textit{Creating a data encryption algorithm based on network IDEA4-2, with the use the round function of the encryption algorithm},  		 			G Tuychiev 		.  		 GOST 28147-89.  		 	 
\bibitem[Tuychiev ()]{b10}\label{b10} 	 		\textit{Creating a encryption algorithm based on network PES4-2 with the use the round function of the GOST 28147-89 // TUIT Bulleten, -Tashkent},  		 			G Tuychiev 		.  		2015. 2 p. .  	 
\bibitem[Tuychiev ()]{b9}\label{b9} 	 		‘Creating a encryption algorithm based on network RFWKIDEA4-2 with the use the round function of the GOST 28147-89 // International Conference on Emerging Trends in Technology’.  		 			G Tuychiev 		.  	 	 		\textit{International Journal of Advanced Technology in Engineering and Science}  		2015. 3 p. .  	 	 (Science and Upcoming Research in Computer Science) 
\bibitem[Tuychiev (2015)]{b11}\label{b11} 	 		‘Creating a encryption algorithm based on network RFWKPES4-2 with the use the round function of the GOST 28147-89 // International Journal of Multidisciplinary in Cryptology and Information Security’.  		 			G Tuychiev 		.  	 	 		\textit{The encryption algorithms GOST28147-89-PES8-4 and GOST28147-89-RFWKPES8-4 // «Information Security in the light of the Strategy Kazakhstan-2050»: proceedings III International scientific-practical conference},  				 (Astana; Astana)  		2015. October 2015. 2015. 4 p. .  	 
\bibitem[National Standard of the USSR. Information processing systems. Cryptographic protection. Algorithm cryptographic transformation]{b3}\label{b3} 	 		\textit{National Standard of the USSR. Information processing systems. Cryptographic protection. Algorithm cryptographic transformation},  		 GOST 28147-89.  		 	 
\bibitem[References Références Referencias Table 2 : Parameters of the S-boxes encryption algorithm GOST]{b13}\label{b13} 	 		\textit{References Références Referencias Table 2 : Parameters of the S-boxes encryption algorithm GOST},  		p. .  	 
\bibitem[Aripov and Tuychiev ()]{b0}\label{b0} 	 		\textit{The network IDEA4-2, consists from two round functions // Infocommunications: Networks-Technologies-Solutions},  		 			M M Aripov 		,  		 			G N Tuychiev 		.  		2012. Tashkent. 4 p. .  	 
\bibitem[Tuychiev ()]{b5}\label{b5} 	 		\textit{The network PES4-2, consists from two round functions // Uzbek journal of the problems of informatics and energetics},  		 			G N Tuychiev 		.  		2013. Tashkent. p. .  	 
\bibitem[Aripov and Tuychiev ()]{b1}\label{b1} 	 		\textit{The network PES8-4, consists from four round functions // Materials of the international scientific conference ? ?????????? «Modern problems of applied mathematics and information technologies-Al-Khorezmiy},  		 			M M Aripov 		,  		 			G N Tuychiev 		.  		2012. 2012. Tashkent. II p. .  	 
\bibitem[Tuychiev ()]{b4}\label{b4} 	 		\textit{The networks RFWKIDEA4-2, IDEA4-1 and RFWKIDEA4-1 // Acta of Turin polytechnic university in Tashkent},  		 			G N Tuychiev 		.  		2013. 3 p. .  	 
\bibitem[US) Guidelines Handbook Global Journals Inc ()]{b15}\label{b15} 	 		‘US) Guidelines Handbook’.  		 \url{www.GlobalJournals.org}  	 	 		\textit{Global Journals Inc}  		2016.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
