\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 GOST28147-89-IDEA8-4 and GOST28147-89-RFWKIDEA8-4},
 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 GOST28147-89-IDEA8-4 and GOST28147-89-RFWKIDEA8-4}
\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]{Gulom  Tuychiev}

             \affil[1]{  National  University of Uzbekistan.}

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


In the paper created a new encryption algorithms GOST28147â??"89â??"IDEA8â??"4 and GOST28147â??"89â??"RFWKIDEA8â??" 4 based on networks IDEA8â??"4 and RFWKIDEA8â??"4, with the use the round function of the encryption algorithm GOST 28147â??"89. The block length of created block encryption algorithm is 256 bits, the number of rounds is 8, 12 and 16.

\end{abstract}


\keywords{feystel network, laiâ??"massey scheme, round function, round keys, output transformation, multiplication, addition, sâ??"box.}

\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 \hyperref[b3]{[4]} 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 Lai-Massey scheme developed the networks IDEA8-4 \hyperref[b5]{[6]} and RFWKIDEA8-4 \hyperref[b6]{[7]}, consisting from four round function. In the networks IDEA8-4 and RFWKIDEA8-4, similarly as in the Feistel network, in encryption and decryption using the same algorithm. In the networks used four round function having one 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[b7]{[8]}, RFWKPES4-2 \hyperref[b7]{[8]}, PES8-4 \hyperref[b1]{[2]}, RFWKPES8-4 \hyperref[b9]{[10]}, IDEA16-2 \hyperref[b10]{[11]}, RFWKIDEA16-2 \hyperref[b11]{[12]} encryption algorithm GOST 28147-89 created the encryption algorithm GOST28147-89-IDEA4-2 \hyperref[b12]{[13]},\par
GOST28147-89-RFWKIDEA4-2 \hyperref[b14]{[14]}, GOST28147-89-PES4-2 \hyperref[b15]{[15]}, GOST28147-89-RFWKPES4-2 \hyperref[b16]{[16]}, GOST28147-89-PES8-4, GOST28147-89-RFWKPES8-4\par
[17], GOST28147-89-IDEA16-2, GOST28147-89-RFWKIDEA16-2 \hyperref[b18]{[18]}.\par
In this paper, applying the round function of the encryption algorithm GOST 28147-89 as round functions of the networks IDEA8-4 and RFWKIDEA8-4, developed new encryption algorithms GOST28147-89-IDEA8-4 and GOST28147-89-RFWKI DEA8-4. In the encryption algorithms GOST28147-89-IDEA8-4 and GOST28147-89-RFWKIDEA8-4 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. The Encryption Algorithm}]{II. The Encryption Algorithm}\par
Gost28147-89-idea8-4\par
The structure of the encryption algorithm GOST28147-89-IDEA8-4. In the encryption algorithm GOST28147-89-IDEA8-4 length of the subblocks 0 X , 1 X , ?, 7 X , length of the round keys to 32-bits. In this encryption algorithm the round function GOST 28147-89 is applied four time and in each round function used eight S-boxes, i.e. the total number of S-boxes is 32. The structure of the encryption algorithm GOST28147-89-IDEA8-4 is shown in Figure  {\ref 1} and the S-boxes shown in Table \hyperref[tab_3]{1}.) 1 ( 12 ? i K , 1 ) 1 ( 12 + ? i K , ?, 7 ) 1 ( 12 + ? i K , 1 ... 1 + = n i , 8 ) 1 ( 12 + ? i K , 9 ) 1 ( 12 + ? i K , 10 ) 1 ( 12 + ? i K , 
\section[{C}]{C}\par
Consider the round function of a encryption algorithm GOST28147-89-IDEA8-4. The 32-bit subblocks 0 T , 1 T , 2 T , 3 T are summed round keys8 ) 1 ( 12 + ? i K , 9 ) 1 ( 12 + ? i K , 10 ) 1 ( 12 + ? i K , 11 ) 1 ( 12 + ? i K , n i ... 1 = , i.e. 8 ) 1 (\textbf{12}0 0 + ? + = i K T S , 9 ) 1 (\textbf{12}1 1 + ? + = i K T S , 10 ) 1 (\textbf{12}2 2 + ? + = i K T S , 11 ) 1 (\textbf{12}3 3 + ? + = i K T S\par
. 32-bit subblocks 0 S ,    Y , 1 Y , 2 Y , 3 Y : 11 0 0 << = R Y , 11 1 1 << = R Y , 11 2 2 << = R Y , 11 3 3 << = R Y .+ ? ? ? ? + ? ? = i i i i K X K X T , ) ( ) ( 5 ) 1 (\textbf{12}5 1 1 ) 1 ( 12 1 1 1 + ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 6 ) 1 (\textbf{12}6 1 2 ) 1 ( 12 2 1 2 + ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 7 ) 1 (\textbf{12}7 1 3 ) 1 ( 12 3 1 3 + ? ? + ? ? + ? ? = i i i i K X K X T , 1 = i 3. to sublocks 0 T , 1 T , 2 T , 3 T applying the round function and get the 32-bit subblocks 0 Y , 1 Y , 2 Y , 3 Y . 4. subblocks 0 Y , 1 Y , 2 Y , 3 Y are summed to XOR with subblocks 0 1 ? i X , 1 1 ? i X , ?, 7 1 ? i X , i.?. 3 0 1 0 1 Y X X i i ? = ? ? , 2 1 1 1 1 Y X X i i ? = ? ? , 1 2 1 2 1 Y X X i i ? = ? ? , 0 3 1 3 1 Y X X i i ? = ? ? , 3 4 1 4 1 Y X X i i ? = ? ? , 2 5 1 5 1 Y X X i i ? = ? ? , 1 6 1 6 1 Y X X i i ? = ? ? , 0 7 1 7 1 Y X X i i ? = ? ? , 1 = i . 5.\par
At the end of the round subblocks swapped, i.e,0 1 0 ? = i i X X ,\textbf{6 1 1 ?}= i i X X ,\textbf{5 1 2 ?}= i i X X ,\textbf{4 1 3 ?}= i i X X , 3 1 4 ? = i i X X , 2 1 5 ? = i i X X , 1 1 6 ? = i i X X , 7 1 7 ? = i i X X , 1 = i .\par
The Encryption Algorithms GOST28147-89-IDEA8-4 and GOST28147-89-RFWKIDEA8-4 0x0 0x1 0x2 0x3 0x4 0x5 0x6 0x7 0x8 0x9 0xA 0xB 0x? 0xD 0xE 0xF S0 0x4 0x5 0xA 0x8 0xD 0x9 0xE 0x2 0x6 0xF 0xC 0x7 0x0 0x3 0x1 0xB S1 0x5 0x4 0xB 0x9 0xC 0x8 0xF 0x3 0x7 0xE 0xD 0x6 0x1 0x2 0x0 0xA S2 0x6 0x7 0x8 0xA 0xF 0xB 0xC 0x0 0x4 0xD 0xE 0x5 0x2 0x1 0x3 0x9 S3 0x7 0x6 0x9 0xB 0xE 0xA 0xD 0x1 0x5 0xC 0xF 0x4 0x3 0x0 0x2 0x8 S4 0x8 0x9 0x6 0x4 0x1 0x5 0x2 0xE 0xA 0x3 0x0 0xB 0xC 0xF 0xD 0x7 S5 0x9 0x8 0x7 0x5 0x0 0x4 0x3 0xF 0xB 0x2 0x1 0xA 0xD 0xE 0xC 0x6 S6 0xA 0xB 0x4 0x6 0x3 0x7 0x0 0xC 0x8 0x1 0x2 0x9 0xE 0xD 0xF 0x5 S7 0xB 0xA 0x5 0x7 0x2 0x6 0x1 0xD 0x9 0x0 0x3 0x8 0xF 0xC 0xE 0x4 S8 0xC 0xD 0x2 0x0 0x5 0x1 0x6 0xA 0xE 0x7 0x4 0xF 0x8 0xB 0x9 0x3 S9 0xE 0xF 0x0 0x2 0x7 0x3 0x4 0x8 0xC 0x5 0x6 0xD 0xA 0x9 0xB 0x1 S10 0xF 0xE 0x1 0x3 0x6 0x2 0x5 0x9 0xD 0x4 0x7 0xC 0xB 0x8 0xA 0x0 S11 0x1 0x8 0x7 0xD 0x0 0x4 0x3 0xF 0xB 0xA 0x9 0x2 0x5 0x6 0xC 0xE S12 0x2 0xB 0x4 0xE 0x3 0x7 0x0 0xC 0x8 0x9 0xA 0x1 0x6 0x5 0xF 0xD S13 0x3 0xA 0x5 0xF 0x2 0x6 0x1 0xD 0x9 0x8 0xB 0x0 0x7 0x4 0xE 0xC S14 0x4 0x5 0xA 0x0 0xD 0x1 0x6 0x2 0xE 0x7 0xC 0xF 0x8 0x3 0x9 0xB S15 0x5 0x4 0xB 0x1 0xC 0x0 0x7 0x3 0xF 0x6 0xD 0xE 0x9 0x2 0x8 0xA S16 0x6 0x7 0x8 0x2 0xF 0x3 0x4 0x0 0xC 0x5 0xE 0xD 0xA 0x1 0xB 0x9 S17 0x7 0x6 0x9 0x3 0xE 0x2 0x5 0x1 0xD 0x4 0xF 0xC 0xB 0x0 0xA 0x8 S18 0x8 0x9 0x6 0xC 0x1 0xD 0xA 0xE 0x2 0xB 0x0 0x3 0x4 0xF 0x5 0x7 S19 0x9 0x8 0x7 0xD 0x0 0xC 0xB 0xF 0x3 0xA 0x1 0x2 0x5 0xE 0x4 0x6 S20 0xA 0xB 0x4 0xE 0x3 0xF 0x8 0xC 0x0 0x9 0x2 0x1 0x6 0xD 0x7 0x5 S21 0xB 0xA 0x5 0xF 0x2 0xE 0x9 0xD 0x1 0x8 0x3 0x0 0x7 0xC 0x6 0x4 S22 0xC 0xD 0x2 0x8 0x5 0x9 0xE 0xA 0x6 0xF 0x4 0x7 0x0 0xB 0x1 0x3 S23 0xD 0xC 0x3 0x9 0x4 0x8 0xF 0xB 0x7 0xE 0x5 0x6 0x1 0xA 0x0 0x2 S24 0x1 0x8 0x7 0x5 0x0 0xC 0xB 0xF 0x3 0x2 0x9 0xA 0xD 0x6 0x4 0xE S25 0x2 0xB 0x4 0x6 0x3 0xF 0x8 0xC 0x0 0x1 0xA 0x9 0xE 0x5 0x7 0xD S26 0x3 0xA 0x5 0x7 0x2 0xE 0x9 0xD 0x1 0x0 0xB 0x8 0xF 0x4 0x6 0xC S27 0xF 0xE 0x1 0xB 0x6 0xA 0xD 0x9 0x5 0xC 0x7 0x4 0x3 0x8 0x2 0x0 S28 0xE 0xF 0x0 0xA 0x7 0xB 0xC 0x8 0x4 0xD 0x6 0x5 0x2 0x9 0x3 0x1 S29 0xA 0xB 0xC 0xE 0x3 0xF 0x0 0x4 0x8 0x1 0x2 0x9 0x6 0x5 0x7 0xD S30 0xB 0xA 0xD 0xF 0x2 0xE 0x1 0x5 0x9 0x0 0x3 0x8 0x7 0x4 0x6 0xC S31 0xC 0xD 0xA 0x8 0x5 0x9 0x6 0x2 0xE 0x7 0x4 0xF 0x0 0x3 0x1 0xB  0 n X , 1 n X , ?, 7 n X , i.e. n n n K X X 12 0 0 1 ? = + , 1\textbf{12}6 1 1 + + + = n n n K X X , 2 12 5 2 1 + + ? = n n n K X X , 3\textbf{12}4 3 1 + + + = n n n K X X , 4\textbf{12}3 4 1 + + + = n n n K X X , 5 12 2 5 1 + + ? = n n n K X X , 6\textbf{12}1 6 1 + + + = n n n K X X , 7 12 7 7 1 + + ? = n n n K X X . 8. subblocks 0 1 + n X , 1 1 + n X , ...,j n j n j n K X X + + + + ? = 16 12 1 1 , 7 ... 0 = j .\par
As ciphertext receives the combined 32-bit subblocks7 1 2 1 1 1 0 1 || ... || || || + + + + n n n n X X X X\par
. In the encryption algorithm GOST28147-89-IDEA8-4 when encryption and decryption using the same algorithm, only when decryption calculates the inverse of round keys depending on operations and are applied in reverse order. One important goal of encryption is key generation.\par
Key generation of the encryption algorithm GOST28147-89-IDEA8-4. In the n-round encryption algorithm GOST28147-89-IDEA8-4 used in each round 12 round keys of 32 bits and the output transformation of 8 round keys of 32 bits. In addition, prior to the first round and after the output transformation is applied 8 round keys on 32 bits. The total number of 32-bit round keys is equal to 12n+24. Hence, if n=8 then necessary 120, if n=12 then 168 and if n=16 then 216 to generate round keys.\par
The key of the encryption algorithm length of l (1024 256 ? ? l ) bits is divided into 32-bit round keys c K 0 , c K 1 , ..., c Lenght K 1 ? , 32 / l Lenght = , here \} ,..., , \{ 1 1 0 ? = l k k k K , \} ,..., , \{ 31 1 0 0 k k k K c = , \} ,..., , \{ 63 33 32 1 k k k K c = , ..., \} ,..., , \{ 1 31 32 1 ? ? ? ? = l l l c Lenght k k k K . Then calculated c Lenght c c L K K K K 1 1 0 ... ? ? ? ? = . If 0 = L K then as L K selected 0xC5C31537, i.e. 0xC5C31537 = L K . Round keys c i K , 23 12 ... + = n Lenght i\par
calculated as follows: ? = ? ) ( 0 c Lenght i c i K SBox K )) ( 32 ( 1 1 c Lenght i K RotWord SBox + ? L K ? .? ? ? ? + + + + + + + ? ? ? ? = c c c c c c c c d n d n d n d n d n d n d n d n K K K K K K K K K K K K K K K K\par
Decryption round keys of the second, third and n-round associates with the encryption round keys as follows:  . ... 2 ), , ,\textbf{, , ) ( , , ) ( , , , ) ( , , ) (( ) , , , , , , , , , , , ( 11 )}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 c i n c i n c i n c i n c i n c i n c i n c i n c i n c i n c i n c i n d i d i d i d i d i d i d i d i d i d i d i d i = ? ? ? ? = + ? + ? + ? + ? ? + + ? + + ? ? + + ? + + ? + + ? ? + + ? + + ? ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? 
\section[{C}]{C}\par
). , , ,  c n c n c n c n c n c n c n c n c n c n d d d 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[{III.}]{III.}\par
The Encryption Algorithm Gost28147-89-rfwkidea8-4.\par
The structure of the encryption algorithm GOST28147-89-RFWKIDEA8-4. In the encryption algorithm GOST28147-89-RFWKIDEA8-4 length of the subblocks 0 X , 1 X , ?, 7 X , length of the round keys) 1 ( 8 ? i K , 1 ) 1 ( 8 + ? i K , ?, 7 ) 1 ( 8 + ? i K , 1 ... 1 + = n i , 8 8 + n K , 5 8 + n K , ..., 23 8 + n K\par
are equal to 32-bits. In this encryption algorithm the round function GOST 28147-89 is applied four time and in each round function used eight S-boxes, i.e. the total number of S-boxes is 32. The structure of the encryption algorithm GOST28147-89-IDEA8-4 is shown in Figure \hyperref[fig_3]{2} and the S-boxes shown in Table \hyperref[tab_3]{1}.  Y , 1 Y , 2 Y , 3 Y : 11 0 0 << = R Y ,\textbf{11}1 1 << = R Y , 11 2 2 << = R Y , 11 3 3 << = R Y\par
. Consider the encryption process of encryption algorithm GOST28147-89-RFWKIDEA8-4. Initially the 256-bit plaintext X partitioned into subblocks of 32-bits 0 0 X , 1 0 X , ?, 7 0 X and performs the following steps: 1. sublocks X summed by XOR with the round keys0 0 X , 1 0 X , ?,8 8 + n K , 9 8 + n K , ..., 15 8 + n K : j n j j K X X + + ? = 8 8 0 0 , 7 ... 0 = j . 2. sublocks 0 0 X , 1 0 X , ?,\textbf{7 0}\par
X are multiplied and summed to the round keys) 1 ( 8 ? i K , 1 ) 1 ( 8 + ? i K , ..., 7 ) 1 ( 8 + ? i K\par
and calculates a 32-bit subblocks 0 T , 1 T ,2 T , 3 T as follows: ) ( ) ( 4 ) 1 ( 8 4 1 ) 1 ( 8 0 1 0 + ? ? ? ? + ? ? = i i i i K X K X T ,\textbf{) ( ) ( 5 ) 1 ( 8 5 1 1 ) 1 ( 8 1 1 1}+ ? ? + ? ? + ? ? = i i i i K X K X T , ) ( ) ( 6 ) 1 ( 8 6 1 2 ) 1 ( 8 2 1 2 + ? ? + ? ? + ? ? = i i i i K X K X T ,\textbf{) ( ) ( 7 ) 1 ( 8 7 1 3 ) 1 ( 8 3 1 3}+ ? ? + ? ? + ? ? = i i i i K X K X T , 1 = i . 3. to sublocks 0 T , 1 T , 2 T , 3\par
T applying the round function and get the 32-bit subblocks0 Y , 1 Y , 2 Y 3 Y . 4. subblocks 0 Y , 1 Y , 2 Y , 3 Y are summed to XOR with subblocks 0 1 Y X X i i ? = ? ? 0 7 1 7 1 Y X X i i ? = ? ? , 1 = i . 5.\par
At the end of the round subblocks swapped, i.e,0 1 0 ? = i i X X ,\textbf{6 1 1 ?}= i i X X ,\textbf{5 1 2 ?}= i i X X ,\textbf{4 1 3 ?}= i i X X 3 1 4 ? = i i X X ,\textbf{2 1 5 ?}= i i X X\par
,  As ciphertext receives the combined 32-bit subblocks 1 1 6 ? = i i X X ,\textbf{7 1 7 ?}= i i X X , 1 = i . 7.X , 1 n X , ?, 7 n X , i.e. n n n K X X 8 0 0 1 ? = + , 1 8 6 1 1 + + + = n n n K X X ,\textbf{2 8 5 2 1 +}+ ? = n n n K X X ,\textbf{3 8 4 3 1 +}+ + = n n n K X X ,\textbf{4 8 3 4 1 +}+ + = n n n K X X , 5 8 2 5 1 + + ? = n n n K X X ,\textbf{6 8 1 6 1 +}+ + = n n n K X X ,\textbf{7 8 7 7 1 +}+ ? = n n n K X X . 8. subblocks 0 1 + n X , 1 1 + n X ,+ + + + n n n n X X X X\par
. In the encryption algorithm GOST28147-89-RFWKIDEA8-4 when encryption and decryption using the same algorithm, only when decryption calculates the inverse of round keys depending on operations and are applied in reverse order. One important goal of encryption is key generation.\par
Key generation of the encryption algorithm GOST28147-89-RFWKIDEA8-4.\par
In the n-round encryption algorithm GOST28147-89-RFWKIDEA8-4 used in each round 8 round keys of 32 bits and the output transformation of 8 round keys of 32 bits. In addition, prior to the first round and after the output transformation is applied 8 round keys on 32 bits. The total number of 32-bit round keys is equal to 8n+24.\par
The key length of the encryption algorithm l ( 1024 256 ? ? l\par
) bits is divided into 32-bit round keys c K 0, c K 1 , ..., c Lenght K 1 ? , 32 / l Lenght = , here \} ,..., , \{ 1 1 0 ? = l k k k K , \} ,..., , \{ 31 1 0 0 k k k K c = , \} ,..., , \{ 63 33 32 1 k k k K c = , ..., \} ,..., , \{ 1 31 32 1 ? ? ? ? = l l l c Lenght k k k K . Then calculated c Lenght c c L K K K K 1 1 0 ... ? ? ? ? = . If 0 = L K then as L K selected 0xC5C31537, i.e. 0xC5C31537 = L K . Round keys c i K , 23 8 ... + = n Lenght i\par
calculated as follows:\par
)) ( 32 ( 1 ) ( 0 1 c Lenght i c Lenght i c i K RotWord SBox K SBox K + ? ? ? = L K ? .\par
After each generation of round keys value L K cyclically shifted left by 1 bit.\par
Decryption round keys are computed on the basis of encryption round keys and decryption round keys of the first round associate with of encryption round keys as follows: ). , , )\textbf{( , , , ) ( , , ) (( ) , , , , , , , ( 7 8}K K K K K K K K K K K K K K K K + + ? + + + ? + + ? ? ? ? ? ? =\par
Decryption round keys of the second, third and n-round associates with the encryption round keys as follows:\par
6. repeating the steps 2-5 n time, i.e. n i ... 2 = , obtained the subblocks 0 n X , 1 n X , ?, 7 n X . ... 2 ), ) ( , , )\textbf{( , , , ) ( , , ) (( ) , , , , , , , ( 1 7}n i K K K K K K K K K K K K K K K K c i n c i n c i n c i n c i n c i n c i n c i n d i d i d i d i d i d i d i d i = ? ? ? ? = ? + + ? + + ? ? + + ? + + ? + + ? ? + + ? + + ? ? + ? + ? + ? + ? + ? + ? + ? + ? ? 
\section[{Decryption}]{Decryption}\par
keys output transformation associated with the encryption keys as follows: ). ) ( , , )\textbf{( , , , ) ( , , ) (( ) , , , , , , , ( 1 7 6}+ + + + + + ? ? ? ? = c c c c c c c c d n d n d n d n d n d n d n d n K K K K K K K K K K K K K K K K\par
Decryption round keys applied to the first round and after the conversion of the output associated with encryption keys as follows:  
\section[{IV. Results}]{IV. Results}\par
As a result of this study built a new block encryption algorithms called GOST28147-89-IDEA8-4 and GOST28147-89-RFWKIDEA8-4. 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 256 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.\par
It is known that S-box of the block encryption algorithm GOST 28147-89 are confidential and are used as long-term keys. In Table \hyperref[tab_14]{2} below describes the options openly declared S-box such as: deg-degree of the algebraic nonlinearity; NL -nonlinearity; ? -relative resistance to the linear cryptanalysis; ? -relative resistance to differential cryptanalysis; SAC -criterion strict avalanche effect; the BIC criterion of independence of output bits. For S-box was resistant to crypt attack it is necessary that the values deg and NL were large, and the values ? , ? , SAC and BIC small.  To S-Box 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-IDEA8-4 and GOST28147-89-RFWKIDEA8-4 for all S-boxes, the following equation:3 deg = , 4 = NL\par
, = ? 0.5, = ? 3/8, SAC=4, BIC=4. i.e. resistance is not lower than the algorithm GOST28147-89. These S-boxes are created based on Nyberg construction \hyperref[b2]{[3]}.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_1}?}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_2}=}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Figure 2 :}\end{figure}
  \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.85\textwidth}}
Year 2016\\
31\\
Volume XVI Issue V Version I\\
)\\
( C\\
Global Journal of Computer Science and Technology\\
© 2016 Global Journals Inc. (US)\end{longtable} \par
 
\caption{\label{tab_3}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.4479041916167665\textwidth}P{0.03053892215568862\textwidth}P{0.005089820359281437\textwidth}P{0.20359281437125748\textwidth}P{0.0407185628742515\textwidth}P{0.010179640718562874\textwidth}P{0.04580838323353294\textwidth}P{0.03562874251497006\textwidth}P{0.025449101796407185\textwidth}P{0.005089820359281437\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep i\tabcellsep =\tabcellsep 2\tabcellsep n ...\tabcellsep ,\\
\multicolumn{5}{l}{obtained the subblocks 0 n X , 1 n X , ?, 7 n X .}\\
\multicolumn{4}{l}{7. in output transformation round keys}\tabcellsep n K 12 ,\tabcellsep K\tabcellsep 1 12 + n\tabcellsep , ...,\\
K\tabcellsep 12 + n\tabcellsep 7\tabcellsep \multicolumn{3}{l}{are multiplied and summed into subblocks}\end{longtable} \par
 
\caption{\label{tab_4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.6733766233766234\textwidth}P{0.17662337662337663\textwidth}}
n K 8 ,\tabcellsep 1 8 + n K , ...,\\
\multicolumn{2}{l}{7 K are multiplied and summed into subblocks 0 8 + n n}\end{longtable} \par
 
\caption{\label{tab_10}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.04576923076923077\textwidth}P{0.1503846153846154\textwidth}P{0.07846153846153846\textwidth}P{0.13076923076923078\textwidth}P{0.03923076923076923\textwidth}P{0.13076923076923078\textwidth}P{0.03923076923076923\textwidth}P{0.07846153846153846\textwidth}P{0.07846153846153846\textwidth}P{0.07846153846153846\textwidth}}
?\tabcellsep Parameters\tabcellsep S1\tabcellsep S2\tabcellsep S3\tabcellsep S4\tabcellsep S5\tabcellsep S6\tabcellsep S7\tabcellsep S8\\
1\tabcellsep deg\tabcellsep 2\tabcellsep 3\tabcellsep 3\tabcellsep 2\tabcellsep 3\tabcellsep 3\tabcellsep 2\tabcellsep 2\\
2\tabcellsep NL\tabcellsep 4\tabcellsep 2\tabcellsep 2\tabcellsep 2\tabcellsep 2\tabcellsep 2\tabcellsep 2\tabcellsep 2\\
3\tabcellsep ?\tabcellsep 0.5\tabcellsep \multicolumn{2}{l}{3/4 3/4}\tabcellsep \multicolumn{2}{l}{3/4 3/4}\tabcellsep 3/4\tabcellsep 3/4\tabcellsep 3/4\\
4\tabcellsep ?\tabcellsep 3/8\tabcellsep \multicolumn{2}{l}{3/8 3/8}\tabcellsep \multicolumn{2}{l}{3/8 1/4}\tabcellsep 3/8\tabcellsep 0.5\tabcellsep 0.5\\
5\tabcellsep SAC\tabcellsep 2\tabcellsep 2\tabcellsep 2\tabcellsep 4\tabcellsep 2\tabcellsep 4\tabcellsep 2\tabcellsep 2\\
6\tabcellsep BIC\tabcellsep 4\tabcellsep 2\tabcellsep 4\tabcellsep 4\tabcellsep 4\tabcellsep 4\tabcellsep 2\tabcellsep 4\end{longtable} \par
 
\caption{\label{tab_14}Table 2 :}\end{figure}
 			\footnote{c n c n d d d d d d d d d} 			\footnote{The Encryption Algorithms GOST28147-89-IDEA8-4 and GOST28147-89-RFWKIDEA8-4} 			\footnote{© 2016 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Infocommunications ()]{b13}\label{b13} 	 		\textit{},  		 			// Infocommunications 		.  		2014. Tashkent. 4 p. .  	 	 (Networks-Technologies-Solutions) 
\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 ()]{b10}\label{b10} 	 		\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 IDEA8-2, IDEA8-1 and RFWKIDEA8-4, RFWKIDEA8-2, RFWKIDEA8-1 developed on the basis of network IDEA8-4 // Uzbek mathematical journal},  		 			G N Tuychiev 		.  		2014. Tashkent. 3 p. .  	 
\bibitem[Tuychiev ()]{b8}\label{b8} 	 		\textit{About networks PES4-1 and RFWKP-ES4-2, RFWKPES4-1 developed on the basis of network PES4-2 // Uzbek journal of the problems of informatics and energetics},  		 			G Tuychiev 		.  		2015. Tashkent. p. .  	 
\bibitem[Tuychiev ()]{b11}\label{b11} 	 		‘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 ()]{b9}\label{b9} 	 		\textit{About networks RFWKPES8-4, RFWK-PES8-2, RFWKPES8-1, developed on the basis of network PES8-4 // Materials of the international scientific conference «Modern problems of applied mathematics and information technologies-Al-Khorezmiy},  		 			G Tuychiev 		.  		2014. 2014. Samarkand. 2 p. .  	 
\bibitem[Tuychiev]{b12}\label{b12} 	 		\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 ()]{b15}\label{b15} 	 		\textit{Creating a encryption algorithm based on network PES4-2 with the use the round function of the GOST 28147-89 // TUIT Bulleten},  		 			G Tuychiev 		.  		2015. Tashkent. 4 p. .  	 
\bibitem[Tuychiev ()]{b14}\label{b14} 	 		‘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 ()]{b16}\label{b16} 	 		‘Creating a encryption algorithm based on network RFWKPES4-2 with the use the round function of the GOST 28147-89’.  		 			G Tuychiev 		.  	 	 		\textit{The encryption algorithms GOST28147-89-PES8-4 and GOST28147-89},  				2015. 2 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[RFWKPES8-4 // «Information Security in the light of the Strategy Kazakhstan-2050»: proceedings III International scientific-practical conference (2015)]{b17}\label{b17} 	 		\textit{RFWKPES8-4 // «Information Security in the light of the Strategy Kazakhstan-2050»: proceedings III International scientific-practical conference},  				 (Astana; Astana)  		October 2015. 2015. p. .  	 
\bibitem[Tuychiev]{b18}\label{b18} 	 		‘The Encryption Algorithms GOST-IDEA16-2 and GOST-RFWKIDEA16-2 // Global journal of Computer science and technology: E Network’.  		 			G Tuychiev 		.  	 	 		\textit{Web \& security}  		16  (1)  p. .  	 
\bibitem[Aripov and Tuychiev ()]{b0}\label{b0} 	 		\textit{The network IDEA4-2, consists from two round functions // Infocommuni cations: Networks-Technologies-Solutions},  		 			M Aripov 		,  		 			G Tuychiev 		.  		2012. Tashkent. 4 p. .  	 
\bibitem[Tuychiev ()]{b5}\label{b5} 	 		\textit{The network IDEA8-4, consists from four round functions // Infocommunications: Networks},  		 			G N Tuychiev 		.  		2013. 2 p. .  	 	 (Technologies-Solutions. -Tashkent) 
\bibitem[Tuychiev ()]{b7}\label{b7} 	 		\textit{The network PES4-2, consists from two round functions // Uzbek journal of the problems of informatics and energetics},  		 			G 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 Aripov 		,  		 			G Tuychiev 		.  		2012. 2012. Tashkent. 2 p. .  	 
\bibitem[Tuychiev ()]{b4}\label{b4} 	 		\textit{The networks RFWKIDEA4-2, IDEA4-1 and RFWKIDEA4-1 // Acta of Turin polytechnic university in Tashkent},  		 			G Tuychiev 		.  		2013. Tashkent. 3 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
