<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The Throughput of Technical Channels as an Indicator of Protection Discrete Sources from Information Leakage</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Warsaw University of Technology</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Institute of Automatic Control</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Robotics</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Warsaw</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Poland i.korobiichuk@mchtr.pw.edu.pl</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National scientific research institute of special communications and information protection of Ukraine</institution>
          ,
          <addr-line>Kyiv, 03142</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National technical university of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", Institute of special communication and information protection</institution>
          ,
          <addr-line>Kyiv, 03056</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Sergey Korolyov Zhytomyr Military Institute, Cybersecurity Department of the Research Center</institution>
          ,
          <addr-line>Zhytomyr, 10004</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>1850</year>
      </pub-date>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Considered the theoretical conditions of discrete information sources security, analyzed the throughput as an indicator of its protection from information leaks. Introduced the notion of throughput limit values of information leaks channel, proposed its use as a security norms. The resulting values establish a connection of specified index with the desired probability of error in the channel.</p>
      </abstract>
      <kwd-group>
        <kwd>information</kwd>
        <kwd>information security</kwd>
        <kwd>security risk</kwd>
        <kwd>safety of information</kwd>
        <kwd>technical channels of information leakage</kwd>
        <kwd>technical information protection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        One of the tasks of information security management [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], as determined
DemingShewhart cycle, is a security risk analysis, including risk of a breach of information
security from leaking by technical channels. It is known, that work of technical means
and systems of processing and transmission of information is almost always
accompanied by a list of adverse effects [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref3 ref4 ref5 ref6 ref7 ref8 ref9">3-12</xref>
        ]. These are unwanted radiation of
electromagnetic fields to the environment, emission and leakage of electric current to taking
off conductors. These carriers may arise from information sources and uncontrolled
spread the dangerous signals outside the controlled area.
      </p>
      <p>
        It is known, that the criterion of protection is the condition of impossibility extract
semantic content from intercepted message [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], that at the point of interception is
determined certain of energy terms – norm the signal/noise ratio. In turn, a
quantitative norm of this measure must provide authentically needed probability of error in
technical leakage channel and, in accordance, previously specified security risk [
        <xref ref-type="bibr" rid="ref1 ref12 ref13 ref14">1,
12-14</xref>
        ]. For substantiation of dependence signal/noise ratio with probability of error in
work [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ] was based on the Kotelnikov’s optimum receiver [
        <xref ref-type="bibr" rid="ref15 ref16 ref17 ref18">15-18</xref>
        ]. In its relation
was found the assessment of lower limit of the probability of errors in the channel,
determined by allowable signal/noise ratio and does not depend from choose of
interception receiver. As is evident, determining the desired probability of error in the
technical leakage channels requires certain studies and solutions.
      </p>
      <p>So, the main task of this article is justification the technical channel throughput as
indicator of protection discrete sources from information leakage, and also
justification the dependency of this throughput with the necessary probability of error in the
technical leakage channel, that will provide a given state of information security risk
by given parameters.
2.</p>
    </sec>
    <sec id="sec-2">
      <title>Materials and methods of research</title>
      <p>To resolve this specified task, consider the channel of leakage, as discrete channel,
which connects a source of information and enemy receiver with some non-fixed, but
different from zero probability of error (Fig. 1).
Suppose at the input channel of information sources gets some information sequence
data Xnk, for ease, binary symbols, where k – number of combination (k = 1, 2, 3,…,
2n) with probability р(Xnk). The specified probability р(Xnk) – is a priori probability,
which characterizes the chances of guessing by enemy before it is transmitted through
the channel.</p>
      <p>In the channel under the influence of noise sequence Xnk transformed into some
consistency Ynl the same length and the same alphabet symbols, where l – number of
combination (l = 1, 2, 3,…, 2n). Noise is random nature, that’s why this
transformation can be described by conditional probability р(Ynl/Xnk), which is a measure that
determines possibility of transition sequences Xnk to Ynl. In this case a posteriori
probability, which determines the chances of guessing the information signs by enemy,
after taking its continuous implementation, can be expressed by the Bayes formula:
p( X kn / Yln ) 
p( X kn ) p(Yln / X kn ) ,
p(Yln )
(1)
where
,
1
– the probability of sequence Ynl at the output of channel.</p>
      <p>
        For the given channel its throughput is defined as the maximum amount of
information for all possible its implementation for all probability allocations, which can be
transmitted through the channel, [
        <xref ref-type="bibr" rid="ref19 ref20 ref21 ref22">19 - 22</xref>
        ]:
С  maxI(X;Y) ,
      </p>
      <p>Х
where</p>
      <p>I(X;Y)  H(X)  H(X /Y)  H(Y)  H(Y / X)  I(Y; X) (4)
– mutual channel information quantity,</p>
      <p>H ( X )  M 1n loga p( 1X kn )   lnim 1n k2n1 p( X kn ) log p( 1X kn ) (5)
– the average amount of information that produces source for one binary sign -
absolute source entropy Х,
1 2n 2n
H ( X Y )  lim   p( X kn ,Yln )log</p>
      <p>n n k1 l1
– conditional source entropy for a binary sign,
1
p( X kn Yln )
1 2n
H (Y )  lim  p(Yln ) log
n n l1</p>
      <p>1
– unconditional entropy of channel output Y for one binary sign,</p>
      <p>1 2n 2n
H (Y / X )  lim   p(Yln , X kn ) log</p>
      <p>n n k 1 l1
– conditional entropy of channel output for one binary sign or conversion Xnk  Ynl.</p>
      <p>
        If k = l, then the combination of sequences Xnk = Ynl and, in accordance, the
transmission in the channel occurred unmistakably. It is not difficult to make sure,
that Н(Y/X) = 0 bit, and C = 1 bit. In other cases there is an error and if it is
probability higher, than higher the difference between Xnk and Ynl, than greater distorted of
symbols and information lost. In this case Н(Y/X)  1 bit, and C  0 bit. It should be
noted, that equality of latter achieved by conditions of equal probability and statistic
errors independence, but statistical dependence of mistakes, even і by conditions of
Its equal probability will result to increased throughput [
        <xref ref-type="bibr" rid="ref15 ref16 ref17 ref18">15-18</xref>
        ].
      </p>
      <p>Shannon's information theory also known, that information can freely pass
through the channel only on condition, if С  H(X). If С  H(X) information through
the channel may partially pass and partially lost. On condition, if С = 0 bit, than
channel condition is provided as "channel breakage" or "no channel".</p>
      <p>Condition of "channel breakage" is theoretically idealized condition, which is
desirable for all technical information leakage. But in practice it is difficult to reach, and
even at all impossible. Typically, ensure of that conditions for the safe processing
and transmission of information requires the creation specific objects and building
constructions, it is associated with the creation of large-scale controlled areas, using
highly efficient surge protector, or autonomous power sources, etc. All it requires
large financial and energy costs, which sometimes may not be appropriate because of
their dominance over most information precious. Because safety of information
should include a balance between deliberately spent and acceptable lost.</p>
      <p>In order to optimize the costs of securing technical information leakage requires a
list of scientific-technical justifications and solutions, associated with providing small
but nonzero values of through. This indicator must take into account the variety of
modes of technical processing and transmission items, of which information leakage,
features of group transmission channels that combine information from different
sources with different properties, the possibility of automated regulation of noise
immunity channels, etc.</p>
      <p>Considering this throughput of technical leakage channels Сtlc can be attributed to
indicators of the evaluation of information security. For example, if asked acceptable
information security risk, then it possible to put accordance of the limit allowable
maximum throughput of technical leakage channel Сtlc l.a.. The presence of of this rule
allows to find the probability of error in the leakage channel and power conditions in
the point of possible interception – the signal/noise ratio, which will ensure the
security of information with given permissible risk.
3.</p>
    </sec>
    <sec id="sec-3">
      <title>The results of research</title>
      <p>Let's analyze the nature of throughput for the general case and justify communication
of maximum throughput and needed for ensure probability of errors. In this case will
suppose, that data, which simultaneously can be processed by technical means and
flow by technical channels, can have very different origins, that is generated from Q
different information sources with a different syntax and different semantics (Fig. 2).</p>
      <p>Obviously, that due to the fragmentation of sources for each one, dangerous signal
spreading by the same environment, which provides the same signal/noise ratio at the
intercept receiver input, technical leakage channel can create different throughput. It
is also obvious, if leakage of information from each source consider separately, then
shown on Fig. 2 technical channel may consist of several technical channels,
generated from different sources with its throughput. But for all of these channels takes
place only one receiver, for which need to justify condition of impossibility of
information interception.
Suppose that in leakage channels have a place an errors, the presence of which is
guaranteed by noise of environment spreading of dangerous signals. All errors in the
channel are statistically independent and are characterized by probability, which is not
below some certain of intercept receiver features.</p>
      <p>
        Based on the used in article the definition of throughput, which is expressed by
ratios (3), (4), (5), (6), (7) and (8), throughput of technical leakage channel, that
calculated on average per one binary sign, may be expressed by the formula [
        <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
        ]:
 1 H(Y / X) [bit] .
Сtlc Hmax(X)
(9)
      </p>
      <p>One of the approaches for ensure the guaranteed safety, is calculation the
indicators of security for the worst case in terms of security. In this case protection will be
ensured and in the the worst case and in all other cases, with the creation of a certain
reserve.</p>
      <p>Determining of worst case is requires the inspection of conditions security for all
of leakage sources. Therefore, will expression the technical leakage channels
throughput as averaging of each source throughput and select among from last limit
allowable maximum, which will apply as an indicator of security:
Сtlc 
1 Q</p>
      <p> Cr .</p>
      <p>Q r1
On the other hand, considering (9) and (8) specified throughput will look like:
1 2n 2n
Сtlc  1 lim   p(Yln , X kn ) log
n n k1 l1</p>
      <p>1
.</p>
      <p>Is necessary to find identity of ratios (10) and (11) and select in throughput of
technical leakage channels a maximum component Cr and to accept it as the norm
for Сtlc.
(10)
(11)
To do this will analyze of probability in ratio (11).</p>
      <p>In view of the independence of errors, mentioned probabilities can be expressed in
the form of next ratios.</p>
      <p>Conditional probability, which characterizes the possibility of sequence at the
output of channel Ynl, if at the input came Xnk:
p(Yln / X kn )  p( y1 / x1 ) p( y2 / x2 )  ... p( yі / xі )  ... p( yn / xn ) .
(12)
where р(yі/хі) – the probability of in і- grade of sequence Ynl the sign - y at the output
of channel, If at the input came sign хі of sequence Xnk in the same grade.</p>
      <p>It is not difficult to notice, that the probability р(yі/хі) of additive channel can be
expressed as</p>
      <p>р(yі/хі) = р(yі – xі) = р(еі).</p>
      <p>
        In view of the (13) the ratio (12) for conditional probability can be expressed in
terms of the multiplication of errors probability р(еі), which taking values within the
limits 0 &lt; р(еі) &lt; ½ [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>p(Yln / X kn )  p(e1) p(e2 ) ... p(eі ) ... p(en ) .</p>
      <p>Compatible probability, which describes the possibility of simultaneous existence
on the channel input a sequence Xnk and on the channel input Ynl, equals:
p(Yln , X kn )  p( X kn ) p(Yln / X kn )   p(x1) p(x2 ) ... p(xі ) ... p(xn )
  p( y1 / x1) p( y2 / x2 )  ...  p( yі / xі )  ...  p( yn / xn )
and considering (13) will view as:
(13)
(14)
(15)
p(Yln , X kn )   p(x1) p(x2 )  ... p(xі ) ... p(xn )
 p(e1) p(e2 ) ... p(eі ) ... p(en )
where р(хі) – probability of хi - sign on the channel output.</p>
      <p>Inserting (14) and (16) to (11) and simplifying its, we get next:</p>
      <p>1 n 
С  lim  1  
n n і1  e</p>
      <p> 1 n
p(eі ) log2 p(eі )  lnim n і1 Ci ,
(17)
where Сі – channel throughput for і- information sign.</p>
      <p>Equating Q = n, we get the required identity, where
Сtlc l.a  мах Ci  1  
i,n,Q e</p>
      <p>p(eі ) log 2 p(eі )</p>
      <p>It should be noted, that the ratio (14), which expresses technical leakage channels
throughput, is multidimensional convex downwards function of the probability of
errors р(еі). It is not difficult to verify, taking by all arguments the second derivative
and identifying a sign. The specified can be shown graphically for arguments р(еі),
having fixed everyone else in the range from 0 to 1/2 (Fig. 3):</p>
      <p>р(еj) = const, 0 &lt; р(еj) &lt; 1/2 for all j = 1, 2,…, n, j  і.</p>
      <p>As seen from the graphical representation of throughput, ensuring its limit
allowable value Сl.a. for different values і can be determined different values of errors
probability.
(19)
Fig 3. Graphs of dependence of throughput leakage sources</p>
      <p>from errors probability in the technical channel
Assertion. If asked a discrete binary channel for which presence of errors is
guaranteed, all errors are statistically independent and their probabilities for all і (і = 1, 2,…,
n) are within the limits рmin  p(eі)  1 – рmin, then its throughput by average does not
exceed limit allowable value as expressed by the ratio:</p>
      <p>Cl.a  1 pmin log2 pmin  (1 pmin ) log2 (1 pmin )  С
(20)</p>
      <p>The proof. If you know the errors probability p(eі), then throughput channel for
іinformation signs may be expressed by ratio:
Сі  1  
e</p>
      <p>p(eі ) log2 p(eі )  1 p(eі ) log2 p(eі )  ,
(1  p(eі )) log2 (1  p(eі ))  1  h( p(eі ))
where h( p)  p log2 1р  (1  p) log2 (1 1 p) – entropy function of the argument р.</p>
      <p>From the convexity properties of entropic function h(p) and its symmetry from
р = 1/2 it follows that for argument p( рmin; 1 – рmin) its value is limited from below:
h( p)  hmin  pmin log 2 p1min  (1  pmin ) log 2 (1  1pmin ) ,
and throughput from top
Сі  Cgr.d  1  pmin log2 pmin  (1 pmin ) log2 (1  pmin ) .
(23)</p>
      <p>Inserting inequality (19) to the value (14) we obtain upper limit, or limit allowable
channel throughput for a given рmin:</p>
      <p>1 n
С  nlim n і1 Ci  Cгр.д  1  pmin log2 pmin  ,
(1  pmin ) log2 (1  pmin )
that had to prove.</p>
      <p>Therefore, based on Shannon information theory provided considered theoretical
security of discrete sources analysis throughput as an indicator of security from
leaking by technical channels. The concept of limit allowable throughput leakage channel
and suggested its to use as a security norms.</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>Obtained analytical ratios, establishing communication of norms given index with
the necessary of errors probability in the channel. In establishing consistency between
the set of security risks and necessary limit allowable throughput of the technical
leakage channel, using of these ratios allows determining the desired probability of
error in the channel and in the next -desired signal/noise ratio in the point of possible
information interception.</p>
      <p>Obtained results in the article is the development of the theory of information
security from leaking by technical channels, and also could form the basis for the
implementation in standards of information security series ISO/IEC 27000.
(22)
(24)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Information technology.
          <source>Security techniques. Information security management systems. Requirements [ISO/IEC</source>
          <volume>27001</volume>
          :
          <year>2013</year>
          ].
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>2. The Law of Ukraine "About protection of information in telecommunication systems"</article-title>
          . http://www.zakon.rada.gov.ua/go
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Buzov</surname>
            <given-names>G.А.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalinin</surname>
            <given-names>S.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kondratev А</surname>
          </string-name>
          .V.
          <article-title>Protection of information from leaks through technical channels</article-title>
          , Goryachaya liniya: Moskva,
          <string-name>
            <surname>Telecom</surname>
          </string-name>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Parshutkin</surname>
            ,
            <given-names>A.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levin</surname>
            ,
            <given-names>D.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaytsev</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Egin</surname>
            ,
            <given-names>A.V.</given-names>
          </string-name>
          :
          <article-title>Application of structural interference for data protection from information Leakage in the stray electromagnetic radiations channel</article-title>
          .
          <source>SPIIRAS Proceedings</source>
          , vol
          <volume>3</volume>
          (
          <issue>58</issue>
          ), pp.
          <fpage>160</fpage>
          -
          <lpage>181</lpage>
          . (
          <year>2018</year>
          ) doi: 10.15622/sp.58.7
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kuhn</surname>
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Compromising emanations: eavesdropping risks of computer displays</article-title>
          .
          <source>This technical report is based on a dissertation</source>
          submitted
          <article-title>June 2002 by the author for the degree of Doctor of Philosophy to</article-title>
          the University of Cambridge, Wolfson College (
          <year>2002</year>
          ) http://www.cl.cam.ас.uk/techreports
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kuhn</surname>
            ,
            <given-names>M.G.</given-names>
          </string-name>
          :
          <article-title>Electromagnetic eavesdropping risks of flat-panel displays</article-title>
          .
          <source>Lecture Notes in Computer Science</source>
          ,
          <volume>3424</volume>
          , pp.
          <fpage>88</fpage>
          -
          <lpage>107</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kuhn</surname>
            ,
            <given-names>M.G.</given-names>
          </string-name>
          :
          <article-title>Optical time-domain eavesdropping risks of CRT displays</article-title>
          .
          <source>Proceedings - IEEE Symposium on Security and Privacy</source>
          , 2002-January, art. no.
          <issue>1004358</issue>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>18</lpage>
          (
          <year>2002</year>
          ) doi: 10.1109/SECPRI.
          <year>2002</year>
          .1004358
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Korobiichuk</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dobrzhansky</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kachniarz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Remote control of nonlinear motion for mechatronic machine by means of CoDeSys compatible industrial controller</article-title>
          .
          <source>Tehnički vjesnik/Technical Gazette</source>
          , Vol.
          <volume>24</volume>
          /No. 6, pp.
          <fpage>1661</fpage>
          -
          <lpage>1667</lpage>
          (
          <year>2017</year>
          ) doi: 10.17559/TV20151110164217
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lenkov</surname>
            ,
            <given-names>S.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peregudov</surname>
            ,
            <given-names>D.А.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horoshko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>А</surname>
          </string-name>
          .:
          <article-title>Methods and means of information protection</article-title>
          .
          <source>Tom І. Unauthorized receipt of information, Ariy: Kyiv</source>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Qiu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Cancelable palmprint templates based on random measurement and noise data for security and privacy-preserving authentication</article-title>
          .
          <source>Computers and Security</source>
          ,
          <volume>82</volume>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          (
          <year>2019</year>
          ) doi: 10.1016/j.cose.
          <year>2018</year>
          .
          <volume>12</volume>
          .003
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Korobiichuk</surname>
            <given-names>I.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hryshchuk</surname>
            <given-names>R.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horoshko</surname>
            <given-names>V.O.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Hokhlacheva</given-names>
            <surname>Yu</surname>
          </string-name>
          .E.
          <article-title>Self-diagnostics of complex systems with a software-configurable structure</article-title>
          .
          <source>Informatics and Mathematical Methods in Simulation</source>
          , vol
          <volume>8</volume>
          ,
          <source>No. 1</source>
          , pp.
          <fpage>36</fpage>
          -
          <lpage>47</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Korobiichuk</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hryshchuk</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mamarev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Okhrimchuk</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kachniarz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Cyberattack Classificator Verification.
          <source>International Conference on Diagnostics of Processes and Systems DPS</source>
          <year>2017</year>
          :
          <article-title>Advanced Solutions in Diagnostics and Fault Tolerant Control</article-title>
          , pp.
          <fpage>402</fpage>
          -
          <lpage>41</lpage>
          (
          <year>2018</year>
          ) doi: 10.1007/978-3-
          <fpage>319</fpage>
          -64474-5_
          <fpage>34</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Ivanchenko</surname>
            ,
            <given-names>S.О.</given-names>
          </string-name>
          :
          <article-title>Justification safety risk information about its security from leaking by technical channels. Scientific and technical digest "Legal, regulatory and metrological support of information security in Ukraine"</article-title>
          , Kiev,
          <source>NTUU "KPI" SRC "Tezis"</source>
          , vol
          <volume>1</volume>
          (
          <issue>31</issue>
          ), pp.
          <fpage>9</fpage>
          -
          <lpage>13</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Duc</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Faust</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Standaert</surname>
            ,
            <given-names>F.-X.</given-names>
          </string-name>
          :
          <article-title>Making masking security proofs concrete: Or how to evaluate the security of any leaking device</article-title>
          .
          <source>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          , 9056, pp.
          <fpage>401</fpage>
          -
          <lpage>429</lpage>
          (
          <year>2015</year>
          ) doi: 10.1007/978-3-
          <fpage>662</fpage>
          -46800-5_
          <fpage>16</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Fink</surname>
            <given-names>L. М.</given-names>
          </string-name>
          :
          <article-title>The theory of transfer of discrete messages [2-d edition], Sov</article-title>
          . Radio: Moskva, (
          <year>1970</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Kulkarni</surname>
            ,
            <given-names>A.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bukate</surname>
            ,
            <given-names>R.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nanaware</surname>
          </string-name>
          , S.D.:
          <article-title>Study of Various Attacks and Routing Protocols in MANETS</article-title>
          . 2018 International Conference on Information, Communication, Engineering and Technology,
          <string-name>
            <surname>ICICET</surname>
          </string-name>
          <year>2018</year>
          ,
          <article-title>art</article-title>
          . no.
          <issue>8533696</issue>
          (
          <year>2018</year>
          ) doi: 10.1109/ICICET.
          <year>2018</year>
          .8533696
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Burachenko</surname>
            ,
            <given-names>D.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavarin</surname>
            ,
            <given-names>G.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klyuyev</surname>
            ,
            <given-names>N.I.</given-names>
          </string-name>
          et. al.:
          <article-title>General theory of communication</article-title>
          ,
          <source>VAS: Leningrad</source>
          (
          <year>1970</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neifeld</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ashok</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Capacity of electromagnetic communication modes in a noise-limited optical system</article-title>
          .
          <source>Applied Optics</source>
          ,
          <volume>55</volume>
          (
          <issue>6</issue>
          ), pp.
          <fpage>1333</fpage>
          -
          <lpage>1342</lpage>
          (
          <year>2016</year>
          ) doi: 10.1364/AO.55.001333
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Ivanovsky</surname>
            ,
            <given-names>R.I.</given-names>
          </string-name>
          :
          <article-title>Theory of probability</article-title>
          and mathematical statistics, BHV: Petersburg (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Niyato</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hossain</surname>
          </string-name>
          , E.:
          <article-title>A queuing-theoretic and optimization-based model for radio resource management in IEEE 802.16 broadband wireless networks</article-title>
          .
          <source>IEEE Transactions on Computers</source>
          ,
          <volume>55</volume>
          (
          <issue>11</issue>
          ), pp.
          <fpage>1473</fpage>
          -
          <lpage>1488</lpage>
          (
          <year>2006</year>
          ) doi: 10.1109/TC.
          <year>2006</year>
          .172
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Gallagher</surname>
            <given-names>R. G.</given-names>
          </string-name>
          :
          <article-title>Information theory and reliable communication</article-title>
          ,
          <source>Sovetskoe radio: Moskva</source>
          (
          <year>1974</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Qian</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shu</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jayakody</surname>
            ,
            <given-names>D.N.K.</given-names>
          </string-name>
          :
          <article-title>A Novel Precoding and Impulsive Noise Mitigation Scheme for MIMO Power Line Communication Systems</article-title>
          .
          <source>IEEE Systems Journal</source>
          (
          <year>2018</year>
          ) doi: 10.1109/JSYST.
          <year>2018</year>
          .2880962
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>