\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={Real-Time Application of the Formant Analysis Algorithms for Cryptoprotection of IT Systems},
 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{2021-10-12 (revised: 12 October 2021)}
\def\TheID{\makeatother }
\def\TheDate{2021-10-12}
\title{Real-Time Application of the Formant Analysis Algorithms for Cryptoprotection of IT Systems}
\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]{Vyacheslav  Kunev}

             \affil[1]{  Technical University of Moldova}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 September 2021 Accepted: 30 September 2021 Published: 12 October 2021}

\maketitle


\begin{abstract}
        


We examine applications of expanded algorithms of formant analysis of modern number theory for protection of binary information from hacking and intentional distortion in various IT-systems. These include real-time confidential conversations and information exchange between server and client through local or external networks, as well as phone and mobile communications based on a modified RSA-m cryptosystem, which realizes quick change of keys and guarantees the degree of secrecy in short or medium term.

\end{abstract}


\keywords{information protection, number theory, formant analysis, cryptography, algorithms, RSA-mAB.}

\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& 	 	 		 \par
The ineciency of existing implementations of RSA cryptosystem in real-time applications calls for identifying new methods that would allow to take advantage of its otherwise attractive features. Currently there are no known methods analogous to RSA algorithms that could protect information in real-time applications such as mobile or voice communications.\par
We consider the possibility of using a modied RSA algorithm, labeled RSA-m. The idea underlying the modication is to send not the encrypted information through open or even secured channels but only some specic data about its encryption instead. We oer several versions of such a modication which, however, require additional research. The ultimate purpose is to increase the working speed of the algorithm similar to RSA system to exploit its full potential in real-time information transmission.\par
The relatively low working speed but high cryptographic resistance of the RSA system motivate the cryptographers' search for potential improvements to the system to enable its use with the typical information ows or for securing of real-time information where privacy needs to be protected in the short term (from few minutes to several months). Below we consider one of such procedures, based on transmitting not the information itself, but only some indirect data about this information in real time. The amount of these data is much lower than the original information and, therefore, these data can be transmitted in encrypted form with required crypto resistance through the channels with limited speed and bandwidth (e.g., 64 KB/s) based on the use of, e.g., RSA cryptosystem, but without signicant delays in time. The amount of transmitted information can be signicantly reduced, e.g., by representing it in the formant form, which allows to reduce its encryption (decryption) time to be commensurate with the bandwidth of mobile communication channels. Another strategy for modifying encryption algorithms in mobile communications in this case is based on the use of short keys, but with the provision of the high speed of their turnover. The author considers this extension in another publication.\par
Abstract-We examine applications of expanded algorithms of formant analysis of modern number theory for protection of binary information from hacking and intentional distortion in various IT-systems. These include real-time confidential conversations and information exchange between server and client through local or external networks, as well as phone and mobile communications based on a modified RSA-m cryptosystem, which realizes quick change of keys and guarantees the degree of secrecy in short or medium term.\par
Keywords: information protection, number theory, formant analysis, cryptography, algorithms, RSA-mAB.\par
Author: Technical University of Moldova and IT-company Director, Chisinau, Republic of Moldova. e-mail: kunev@deeplace.md\par
The main idea of the proposed algorithm is in using so-called numeric formants, which were introduced in \hyperref[b0]{[1]} and detailed in \hyperref[b2]{[2]} and \hyperref[b4]{[3]}. Numeric formants allow to represent any II. Real-Time Application of the Formant Analysis Algorithms for Cryptoprotection of IT Systems number as a simple linear structure. Moreover, the time needed to represent and to recover the number for the encryption and decryption will be signicantly lower than the time required when using of the algorithms of the classical RSA system. 
\section[{Information Protection using RSA-MAB Algorithm}]{Information Protection using RSA-MAB Algorithm}\par
It is known from \hyperref[b0]{[1]}, that linear and/or nonlinear formants using only 3 or a few more parameters, allow to signicantly reduce the length of the digital message regardless of the length of the transmitted number n. The advantage of such an approach is that the so-called base of the formant can be any simple or composite number of substantially lower length than is required for the encryption in the classic RSA cryptosystem.\par
Below we consider several algorithms using linear formants for the transmission of the information requiring short-term secrecy, where the amount of time needed for encryption and decryption is considerably reduced, even after accounting for the additional operations for transforming the message.\par
As known from \hyperref[b2]{[2]} and \hyperref[b4]{[3]}, any number N can be represented, in terms of the formant analysis, as a binomial structure N = pk + q, where p is the formant's base, k is the core and q is the remainder. Knowing these three arguments allows us to easily recover the initial number. Types, properties and characteristics of the formant algebra are described in \hyperref[b0]{[1]}. This way of representing numbers allows to encrypt not the number N itself, but only 3 small numbers instead. The main dierence is that N is a large number of the order of 10 20 . . . 10 500 or higher, while p, k and q are any whole numbers, simple or composite, the length of which is determined only by the required transmission speed through an open channel. It is recommended to choose the base of the formant p as a number with a length of the order of magnitude of the RSA key, such as a number, corresponding to the block cipher and which doesn't lead to the reduction of the transmission speed. This recommendation allows to use the RSA keys of the medium length, while the presence of the fast simple number generator in the system allows to change them quickly, even in the block format, which will obviously increase the diculty of hacking.\par
To implement the RSA-m algorithm, a dynamic database is created in the memory, for instance, in a format of the matrix P with indexed cells which keep pre-generated information used for the formant construction. For example, a 100 × 100 matrix can contain such information for 10,000 dierent formants.\par
After each single use of all of the values p ij of the matrix P the algorithm prescribes an automatic update of all cells of the matrix, on sending and receiving sides.\par
Depending on the required strength of the encryption, the matrix in the memory of the microprocessor may be built with a hard or exible updating program, with an automatic or manual transmission of the matrix. In one version it could even be the same matrix, where the cell names are changed based on an index. The remainder and the core values are then encrypted using the RSA-m algorithm, cryptoresistance of which is guaranteed by the switch in real-time of the keys for each binomial d?bit number of an analog signal or of a symbol (number, byte, block) in an open digital message. On the receiving end, the message is decrypted with a special procedure, which recognizes transmitted cell addresses a) AB1 Algorithm and decrypts other arguments of each formant, allowing to restore the true value of the transmitted numerical message. The message itself can be a text message in any possible language, an image of any class and type, a piece of speech or music, etc. Figure  {\ref 1} contains a block-scheme of the AB1 algorithm. 
\section[{Matrix of ?? ???? Formant bases}]{Matrix of ?? ???? Formant bases} 
\section[{Building of the formant of the message}]{Building of the formant of the message} 
\section[{Creation of keys and encryption parameters ?? ??, ?? ??}]{Creation of keys and encryption parameters ?? ??, ?? ??} 
\section[{Decryption of formant parameters}]{Decryption of formant parameters}\par
?? ???? , ?? ?? , ?? ?? 
\section[{Formant and message restoration}]{Formant and message restoration}\par
Block-Diagram of AB1 algorithm 1. From the analog signal being transmitted, after digitizing it, the block is formed: binomial message of 32(64)... bit; 2. From the basic matrix block in the memory of the device the base of the formant p ij is randomly chosen and recorded in the cell d1; 3. Numeric block 64 bit (Ex. 1) is represented in the formant format. Its core k and remainder q are dened: k i = d2 and q i = d3; 4. The encription keys for encrypting numbers k i = d2 and q i = d3 are chosen; 5. The message d1d2d3 about the formant is formed; 6. The message d1d2d3 about the formant is encrypted; 7. Encrypted data is passed through an open channel; 8. The block of 64...bit is received; 9. The base of the formant p ij is extracted from the received block; 10. Numbers k i = d2 and q i = d3 are extracted from the block; 11. The message-formant is recovered:F = p ij ? k i + q i = p i ? d2 + d3.\par
Let's consider a simple example that illustrates the RSA-m algorithm's application. 
\section[{3}]{3}\par
Let's encrypt the message HF T Y . For simplicity we will use small numbers (in practice, much larger numbers are used, by several orders of magnitude).\par
1. Let's pick two simple numbers p = 3 and q = 11. Their product is N = 3 ? 11 = 33.\par
2. Find (p ? 1)(q ? 1) = 2 ? 10 = 20. Therefore, the number for the private key d can be chosen to be smaller than 20 and a co-prime integer with 20, e.g., d = 3 (or another: 7, 11, 13, 17, 19, . . .).  Thus, the open message S1 = HF T Y = (3, 1, 2, 4) can be represented as an encrypted message SE1, i.e., the numerical sequence SE1 = (9, 1, 29, 16), which, for instance, corresponds to the text P F LJ . 
\section[{Now let's create an encrypted message for the transmission through an open channel}]{Now let's create an encrypted message for the transmission through an open channel}\par
that includes the auxiliary information, for example, of the following type (it can be of any order or content). add'l information -The rst three decimals -the digit number for the code processing; shows us the length of the machine word, i.e. every three decimal digits.\par
-The second group of decimals -the cell number of matrix P in memory, which the controller on the receiving side must extract from memory.\par
-The third group of three decimal digits contains information for the decryption with RSA algorithm (can contain any number of the triples depending on the length of the sent block of bits -16, 32, 64 etc.).\par
-The last, for instance, 6 or more digits include additional service information: the ending of the sent message, the parity check etc. Thus, while sending 64...-bit, we must choose the rst and the last 6 digits, which contain all the information about decryption of the remaining 58 decimal digits.\par
We created encrypted message \{9, 1, 29, 16\}, which is the result of the cryptography with a secret key \{7, 33\}. On the receiving side in the cell p i = p 23 the corresponding numbers are located: private key d and the modulus of the cryptokey: d = 3; N = 33.\par
That is why it is so easy to decrypt the encrypted message 912916.\par
Let's decrypt the received encrypted message (9, 1, 29, 16) = P F LJ on the basis of the private key \{d, N \} = \{3, 33\}. We get Initial T 1 = (9 3 )(mod 33) = 729 (mod 33) = 3, Cipher T 4 = (H 7 )(mod N ) = (  {\ref 4}7 )(mod 33) = 16, 384 (mod 33) = 16.Initial T 2 = (1 3 )(mod 33) = 1 (mod 33) = 1, Initial T 3 = (\textbf{29}\par
1. In the matrix of 10,000 cells (1000 rows x 1000 columns) the cells are numbered in the natural order; they can also be represented as a double-index variable p ij , where ij = 00, 01, . . . 99. For example, the cell \#457 has index p 0457 , and the cell \#4057 will have the number or index-address p 4057 . 2. Each cell P ij (e, d, n) of the matrix P , will now contain the index number, which is encrypted by RSA-m system. For instance, in the cell \#0009 this number is 3; cell b) AB2 Algorithm Version 1. Storage cells indexing.\par
\#0001 will contain number 1; cell \#0029 -number 2; cell \#0016 -number 4, which corresponds to the decryption with the key d = 3; N = 33; and encrypted with the key e = 7. Other cells of the array will be lled in exactly same way.\par
3. The algorithm of the cell mixing in Version 1 does not change the cell's content; it only changes it's index number.\par
To further increase the cryptoresistance level of the RSA-mAB algorithm, we could randomly change the length of the encrypted blocks, with the corresponding change of the cryptokeys' length. The number of such arrays and their size depend on how long the information needs to be kept secret and on the memory size of the controller on which the RSA-mAB will be realized.\par
The block-message with the length 32 (64). . . bit is 1. The p ij formant base is randomly selected from the basic matrix and its number is written as the message d1 (the base of the created formant is stored in the cell d1).\par
2. The initial number of the formed informational block is represented in the formant form, and all its remaining parameters (the core k i = d2 and remainder q i = d3, are dened by the selected base and are written in the messages d2 and d3. 3. Transmitted message d1d2d3 is formed. 4. Crypto keys for encryption of cores k i and remainders q i are generated. 5. The message about the d1d2d3 formant is encrypted. 8. Coordinate-address p ij is extracted from the received block. 9. The value of the formant base is restored. 10. k i and q i are extracted from the corresponding block.\par
11. The formant is restored from the encrypted message using the standard formula.\par
As a similar example, consider the encryption of the message EDA or of its numeric code 651. Let's represent the 651 code in the formant form, i.e. as the sum of a product and a remainder, and choose as the base, e.g., random simple numbers 237, 54, 119, etc. The matrix of the RSA-m system keys from Version 1 is replaced by the format's base matrix, which creates the rst set of the randomly chosen bases of various length and properties (simple or composite). Returning to our example, recall that our message is: S2 = 651. formed.\par
-We choose the base randomly, e.g., p = 54. In the controller's storage write down d1 = 54.\par
-Calculate the formant of the number 651 on the base 54: F 54 (651) = 12 × 54 + 3. Write down in the storage it's arguments: k i = d2 = 12 and q i = d3 = 3.\par
-The machine denes the length of the information block S0 being formed for encrypting (for example, the rst three triples of decimals): S0 = 054 012 003.\par
-Choose the encryption key e from the cell \#54 of the key matrix in memory.\par
-The message is encrypted: Clearly, other approaches based on the use of formants for message transmission are also possible, e.g., 10 dierent approaches are described in \hyperref[b4]{[3]}. We considered the most obvious ones. For example, matrix M 1 12 × 12 contains 64 × 64 = 4, 096 decimals (digits), which will be encrypted with 64 dierent keys. First, 64 bit digits are encrypted (rank: 6 decimal digits). Double the number of digits and begin encrypting 124-bit numbers in order to raise the rank to 12 decimal digits. 2 10 = 1, 024 bit-numbers and each 10-bit number is located in the cell of matrix 10 × 10 = 1, 000 ? 1024.C 1 =\par
For matrix M 2 64 × 64 a matrix with a rank of 10 decimals (number of bits) there are 4, 096 = 2 12 of digits selected, which are encrypted with the key K1. In matrix M 2 the same 4,096 digits are selected, but encrypted with another key K2, etc. Then, matrices M Z ?K Z, where Z represents the length (number of bits) of encryption keys, for example 10 or 100 etc. what allows to signicantly reduce the duration of encryption by replacing multiple number multiplications with simpler processes. This allows to use the RSA-mAB1 algorithm for protection of real-time information and to improve the stability of cryptographic keys with frequent changes in the block length.\par
M Z matrices can be built separately (independently) using dierent methods. In the AB1 algorithm this operation diers with respect to the content of the matrices, because they were created with the use of dierent keys.  
\section[{Real}]{Real} 
\section[{Conclusion}]{Conclusion}\par
AB2 algorithm uses one and the same matrix, with unchanged content of its cells, but it changes cell addresses. The redistribution of cells' contents of matrix M can be implemented in various ways. It can be random or according to some algorithm applied to each matrix cell such as, e.g., the relation p ij = p (i+k,j+l) , changing k and j in a such way, that all or just some cells are aected by the algorithm.\par
Our library of algorithms includes an extended AB ? univ algorithm which allows to use any of the algorithms described above for real-time crypto-problems. Obviously, such message will be more dicult to decrypt in a relevantly short time. Even with writing a message on hard media, it can not be reasonably quickly decrypted so that hacking will require dozens of years, as the hacker knows neither the length (range) of keys, nor the block length, nor the transition rule from one pair of keys to another. Besides, he doesn't know the keys at all.\begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-2.png}
\caption{\label{fig_2}3 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{11}\includegraphics[]{image-3.png}
\caption{\label{fig_3}Figure 1 :Cipher T 1 =}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-5.png}
\caption{\label{fig_6}6 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-6.png}
\caption{\label{fig_7}Version 2 .}\end{figure}
   			\footnote{© 2022 Global Journals} 		 		\backmatter  			 \par
This is internal information of the security system. Each external communication can of the same type, but its content will dier in the meaning of the information transmitted in each session and the same phonemes will be represented in dierent messages by dierent codes.			 			  				\begin{bibitemlist}{1}
\bibitem[Publishers and Germany ()]{b3}\label{b3} 	 		\textit{},  		 			Lambert Publishers 		,  		 			Germany 		.  		2016.  	 
\bibitem[Shanighina V. F. (ed.) ()]{b8}\label{b8} 	 		\textit{-2nd edition revised and extended. M.: Radio i svyazi},  		Shanighina V. F. (ed.)  		2001.  	 
\bibitem[References Références Referencias]{b10}\label{b10} 	 		\textit{References Références Referencias},  		 	 
\bibitem[Balabanov et al.]{b5}\label{b5} 	 		\textit{Àëãîðèòì áûñòðîé ãåíåðàöèè êëþ÷åé â êðèïòîãðàôè÷åñêîé ñèñòåìå RSA. [An algorithm for quick key generation on the cryptographic RSA system},  		 			A A Balabanov 		,  		 			A F Agafonov 		,  		 			V A Riku 		.  		 \url{http://www.vntr.ru/ftpgetle.php?id=323}  		 	 
\bibitem[Balabanov et al.]{b6}\label{b6} 	 		\textit{Âîçìîaeíîñòè ñîçäàíèÿ íîâûõ è ìîäåðíèçèðîâàííûõ àëãîðèòìîâ äëÿ ñèñòåìû RSA. [Possibilities of creating new and advanced algorithms for RSA system},  		 			A A Balabanov 		,  		 			A F Agafonov 		,  		 			I Kojuhari 		.  		 \url{http://www.vntr.ru/ftpgetle.php?id=451}  		 	 
\bibitem[Romantev et al.]{b7}\label{b7} 	 		\textit{Çàùèòà èíôîðìàöèè â êîìïüþòåðíûõ ñèñòåìàõ è ñåòÿõ},  		 			I B Romantev 		,  		 			P A Timofeev 		,  		 			B F Shanighin 		.  		 	 	 (Information Protection in computer systems and networks) 
\bibitem[Balabanov and Kunev]{b2}\label{b2} 	 		\textit{Çàùèù¼ííûå IT-ñèñòåìû íà îñíîâå àëãîðèòìîâ ôîðìàíòíîãî àíàëèçà},  		 			A A Balabanov 		,  		 			V V Kunev 		.  		 	 	 (Protected IT-systems based on the formant analyses algorithms) 
\bibitem[Êëàññè÷åñêèå è ñîâðåìåííûå çàäà÷è òåîðèè ÷èñåë è êðèïòîãðàôèè. [Comparative analysis and its applications ()]{b1}\label{b1} 	 		\textit{Êëàññè÷åñêèå è ñîâðåìåííûå çàäà÷è òåîðèè ÷èñåë è êðèïòîãðàôèè. [Comparative analysis and its applications},  		2016. Germany: Lambert Publishers.  	 	 (Classical and modern problems of the theory of numbers and cryptography) 
\bibitem[Bikov et al. ()]{b9}\label{b9} 	 		\textit{Íîâûå òåõíîëîãèè ýëåêòðîííîãî áèçíåñà è áåçîïàñíîñòè. [New technologies of electronic business and security},  		 			V A Bikov 		,  		 			L K Babenko 		,  		 			O B Spiridonov 		.  		2002.  	 	 (Pub: Radio i svyazi) 
\bibitem[Balabanov and Agafonov]{b0}\label{b0} 	 		\textit{Ñîïîñòàâèòåëüíûé àíàëèç è åãî ïðèëîaeåíèÿ},  		 			A A Balabanov 		,  		 			A F Agafonov 		.  		 	 
\bibitem[Balabanov and Kunev]{b4}\label{b4} 	 		‘Ñïîñîá øèôðîâàíèÿ äâîè÷íîé èíôîðìàöèè è óñòðîéñòâî äëÿ åãî îñóùåñòâëåíèÿ. [A method of binary information encryption and application for its implementation’.  		 			A A Balabanov 		,  		 			V V Kunev 		.  		 \url{http://www.ndpatent.ru/patent/209/2099885.html}  	 	 		\textit{Patent of RM},  				 	 
\end{bibitemlist}
 			 		 	 
\end{document}
