<!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 Technique for Metamorphic Viruses' Detection Based on its Obfuscation Features Analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>rkowsky</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>rgii Lys</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>rii Ni</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>poruk</string-name>
          <email>andrey.nicheporuk@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Khmelnitsky National University</institution>
          ,
          <addr-line>Khmelnitsky</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper presents an approach for the metamorphic viruses detection based on its obfuscation features analysis. The obfuscation features were obtained on the basis of the equivalent functional block search in the suspicious program and its modified version. The results of the research demonstrated that the efficiency of metamorphic viruses detection based on the proposed obfuscation quantitative features depends on the choice of the similarity metric at the stages of the search and the choice refinement of the equivalent functional blocks. The adequate choice of similarity metrics at both stages allowed increasing the detection efficiency of the metamorphic viruses.</p>
      </abstract>
      <kwd-group>
        <kwd>Metamorphic Virus</kwd>
        <kwd>Obfuscation</kwd>
        <kwd>Equivalent Functional Block</kwd>
        <kwd>Opcode</kwd>
        <kwd>Distance metrics</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Today the problem of cyber security is very important. The malware detection is a
very important task because of the information pilfering, anonymous access to
network, spy actions, spamming are observed. The most hard to detect type of the
malware is metamorphic viruses [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The main feature that distinguishes the metamorphic
viruses from other types of malware is the usage of the code obfuscation techniques.
Applying of the code obfuscation allows the syntax modification of the program code,
however the semantic base of the virus algorithm functioning is unchanged. Taking
into account the mentioned feature of metamorphic viruses, the creation of a virus
code signature is impossible [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The way to detect the metamorphic viruses
efficiently the heuristic techniques are used.
      </p>
      <p>
        An article [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] presents the main 189 obfuscation features of the metamorphic
viruses, extracted from the all sections of the executable file. In [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] the authors are
focused only on the section attributes, and to draw the conclusion about metamorphic
viruses presence a set of rules for the files’ sections analysis was proposed.
      </p>
      <p>
        Another line of research of the metamorphic viruses’ detection is the opcodes
analysis [
        <xref ref-type="bibr" rid="ref5 ref6 ref7 ref8">5-8</xref>
        ]. In [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] for the inferencing about metamorphic viruses’ presence a
weighted directed graph based on the program’s opcodes is constructed and a
comparison of the built graph with the graphs of known metamorphic viruses using the
similarity metrics is carried out.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] in order to detect the metamorphic viruses the histograms of the opcode
appearance are built. It makes it possible to find the similarity between the known
histogram of metamorphic viruses and such histogram of the suspicious program.
      </p>
      <p>
        Another approaches are based on the analysis of the opcodes, that describe the key
features of the metamorphic viruses. Thus, in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] the authors made an attempt to find
the most commonly used opcodes for metamorphic viruses, while in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] the authors
assert that the code is compiled by the compiler differs from the mutated code.
      </p>
      <p>
        To process the received characteristic features and to make decision about the of a
metamorphic viruses presence, the machine learning methods, such as J48,
multiagent approaches, neural networks, design tree, k-nearest neighbors algorithm and
Naive Bayes [
        <xref ref-type="bibr" rid="ref10 ref5 ref6 ref7 ref8 ref9">5-10</xref>
        ] are involved. The main drawback of mentioned techniques is high
rate of the false positives.
      </p>
      <p>
        An alternative approach for the metamorphic viruses detection is the features
extraction, based on the control flow analysis. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] the detection process involves a
graph construction of the metamorphic virus control flow, and the transformation into
the vector space. The classification of the formed vector is carried out by known
classifiers [
        <xref ref-type="bibr" rid="ref5 ref6 ref7 ref8">5-8</xref>
        ]. Another approach for the metamorphic viruses’ detection is the
monitoring of the API calls, used by programs [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. In the work, the authors proposed a static
approach to form the signature of the metamorphic viruses, based on the calculation
of the API calls number corresponding to known metamorphic viruses. The
conclusion about the metamorphic virus presence is made on the basis of searching of the
similarity between the formed signature and the signatures in the base of known
viruses using the similarity metrics [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>The main drawbacks of the mentioned techniques are low level of the detection,
the complexity and high rate of false positives. The way to eliminate these
disadvantages is involvement of the obfuscation features analysis, based on the assessment
of the quantitative characteristics of the metamorphic viruses’ code modification.
3</p>
    </sec>
    <sec id="sec-2">
      <title>The Technique for Metamorphic Viruses’ Detection Based on its Obfuscation Features Analysis</title>
      <p>
        The paper [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] presents an approach for the metamorphic viruses detection in the local
networks. It is based on the analysis of the potentially suspicious behavior of the
programs on the host, and on the analysis of the obfuscation features, which are
demonstrated during the program’s functioning. The obfuscation features were obtained on
the basis of the equivalent functional block search in the suspicious program and its
modified version. The conclusion about the metamorphic viruses’ presence is drawn
by the fuzzy inference system placed on the server, using the gathered information
from all hosts of the network.
      </p>
      <p>The technique involves the following stages: a data preprocessing; a localization
of a place for the search of the equivalent function blocks (EFBs) in the executable; a
search of the EFBs, the choice refinement of the EFBs; the obtaining of the
quantitative features of the code obfuscation, based on the comparison of EFBs of suspicious
program and its modified version; a drawing the conclusion about metamorphic
viruses presence (Fig. 1). Let us take a closer look at each step of the technique.</p>
      <p>In order to detect metamorphic viruses the main stage is the obfuscation features
extraction. We will deal with quantitative features of the code obfuscation, which will
allow estimating the difference between two copies of the metamorphic virus. For this
purpose a disassembly of the suspicious program and the obtaining of a code sample
before the emulation are performed. In order to create the modified version of the
suspicious program it is launched in the emulator. A result of the data preprocessing
stage are two opcodes lists of the suspicious program and its modified version.
3.2</p>
      <sec id="sec-2-1">
        <title>The Localization of a Place for the Search of the Equivalent Function</title>
      </sec>
      <sec id="sec-2-2">
        <title>Blocks in the Executable.</title>
        <p>The features extraction of the metamorphic viruses requires the localization of a place
for the search of the EFBs in the executable. For this purpose the definition of the
program’s entry point and the choice of the section where it is located are carried out.
We will choose the localization of a place for the search of the EFBs in such cases: if
there are call or jump instructions near the program’s entry point and the operands
contain the address of another section; there is a section with non-standard name;
there is an executable access attribute of the section.
3.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Search of the Equivalent Functional Blocks.</title>
        <p>After the place of the search for the EFBs of the suspicious program and its modified
version is determined, the next stage involves the partitioning of the opcode listings
into the blocks. The process of the partitioning of the opcode listings into the
functional blocks (FBs) involves the disassembly of the suspicious program and its
modified version, and the separation of the opcode sequences, arranged between the
commands of conditional or unconditional jumps.</p>
        <p>Let us denote the suspicious program as Fb and its modified version Fa as the
sets Fb  {Fb1 , Fb2 ,...,Fbm } and Fa  {Fa1 , Fa2 ,...,Fan } accordingly. To present the
obtained FBs as a statistical model, the rating matrix of the opcodes appearance for
each FBs was construct. For this purpose, to each functional block the Term
Frequency–Inverse Document Frequency (TF-IDF) statistical metric was applied:
s </p>
        <p>ni
 n
k i
* log(</p>
        <p>N 1.0
n j
)
where ni – a number of і-th appearance of the opcode in the functional block F ;
k  1, ka – a number of opcodes in the functional block, where ka – a total number of
the assembler instructions; n j – a number of functional blocks with some opcode ni ;
N – a total number of the functional blocks.</p>
        <p>Then, the rating matrices of the opcodes appearance in the FBs of the suspicious
program Fb and its modified version Fa can be presented as follows:
 Fa1   s11
 Fa2   s12
Fa   ...    ...</p>
        <p>
 Fan   s1n
s21 ... sk1 
s22 ... sk 2 
... ... ... </p>
        <p>
s2n ... skn 
 Fb1   s11
 Fb2   s12
Fb   ...    ...</p>
        <p>
 Fbm   s1m
s21</p>
        <p>... sg1 
s22 ... sg 2 
... ... ... 
s2m ... sgm </p>
        <p>Thus, as a result the two sets of FBs are obtained, which are represented as the
rating matrices of the opcodes appearance in function blocks for the suspicious program
and its modified version. The search of the EFBs involves a pairwise comparison of
each FB from the set Fb with each FB from Fa using the similarity metric. The
result of the comparison the similarity score Er between the two FB is obtained. If the
value of the similarity score Er for two FBs is less than the specified threshold  ,
then the recalculation of similarity score between the functional block of the program
and the next block that follows the block is performed. The above actions are repeated
until the value of the similarity score is less or equal to the threshold  . The threshold
value  is determined experimentally.</p>
        <p>Thus, at the stage of determination of the equivalent functional blocks, there may
be a situation when the several function blocks may correspond to one FBs
Fbi ~ {Fa j | Er (Fbi , Fa j )   , j  1, q}, where q – a number of the FB from the set
(1)
(2)
Fa , equivalent to FB Fbi ,  – a similarity threshold for two functional blocks.
Therefore, in order to eliminate the uncertainty and to define the equivalent FBs
unambiguously, the choice refinement of the EFBs is to be performed.
3.4</p>
      </sec>
      <sec id="sec-2-4">
        <title>The Choice Refinement of the Equivalent Functional Blocks and its</title>
      </sec>
      <sec id="sec-2-5">
        <title>Comparison.</title>
        <p>In order to perform the choice refinement of EFBs, a probability matrix for the
opcodes sequence of the functional blocks, which are defined as equivalent, is built. The
columns and the rows of the matrix determine the opcodes that are present in the
function block. Each cell of the matrix consists the ratio of the number of the opcodes
pair appearance to the total number the opcodes in the row.</p>
        <p>The procedure of the choice refinement of the EFBs involves the comparison of the
probability matrices for the opcodes sequence of each functional blocks Fb with the
each FB from the set Fa , which are equivalent to Fbi , and the choice of the minimum
value of the similarity score E p : min( E p (Fbi , Fa1 ),...,E p (Fbi , Faq ))  Fbi ~ Fa j .</p>
        <p>The similarity score is evaluated using the similarity metric. In order to evaluate
the quantitative features of the code obfuscation, the comparison of the obtained pairs
of the EFBs using the metric of Damerau-Levenshtein is carried out. As a result, the
following quantitative obfuscation features are obtained: the Damerau-Levenstein
distance, the number of insertion, deletion, transposition and the matches of opcodes.</p>
        <p>
          Drawing the conclusion about the similarity degree of suspicious program to the
metamorphic virus, based on the obtained features, is performed by the means of the
fuzzy inference system [
          <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
          ].
        </p>
        <p>The approach demonstrated the efficiency of the metamorphic viruses detection at
the rate of 79%. The main reason of such low detection rate is the wrong choice of the
EFBs during the search of the EFBS and its choice refinement. To achieve the better
result of the proposed approach is to correctly choose the similarity metric.
4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experimental Results</title>
      <p>According to the approach described in section 3, the obtaining of the obfuscation
quantitative features deals with the determining of the equivalent functional blocks in
the suspicious program and its modified version. It is implemented using the
similarity metrics. Thus, the main interest of the research is to investigate the impact of
involvement of the similarity metrics for the right choice of the equivalent functional
blocks for comparison and the correctly (at two stages of the search of the EFBs and
the choice refinement of the EFBs).</p>
      <p>In order to implement the metamorphic viruses’ detection efficiently the analysis
of the quantitative features of the code obfuscation was performed. For this purpose a
number of experiments were conducted. As a test data 540 samples of the
metamorphic viruses using the NGVCK, VCL32 and G2 metamorphic generators were
generm1  Er (Fa , Fb )  E p (Fa , Fb ) 
m2  Er (Fa , Fb )  E p (Fa , Fb ) 
m3  Er (Fa , Fb )  E p (Fa , Fb ) 
m4  Er (Fa , Fb )  E p (Fa , Fb )  max(| Fai  Fb j |)
max(m,n)</p>
      <p>
i1, j 1</p>
      <p>(Fai  Fb j )2
max(m,n)</p>
      <p>
i1, j 1</p>
      <p>(Fai  Fb j )2
max(m,n)</p>
      <p>
         | Fai  Fb j |
i1, j 1
(3)
(4)
(5)
(6)
(7)
ated (VX Heavens). The entire study process was conducted in the modified emulator
environment [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] based on Qemu.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] as the similarity metric to evaluate the similarity scores and the squared
Euclidean metric was used. In this research as the similarity metrics the following
metrics were used: the Euclidean metric (3), the squared Euclidean metric (4), the taxicab
distance (5), the Chebyshev distance (6), and the Minkowski distance (7).
m5  Er (Fa , Fb )  E p (Fa , Fb ) 
max(m,n)
      </p>
      <p>
i1, j 1
| Fai  Fb j |r with r=3
where, m and n – the numbers of the EFBs in the suspicious program Fb , and its
modified version Fb , respectively.</p>
      <p>The best results of the NGVCK samples’ detection were succeeded applying the
conditions: usage of the taxicab metric at the stage of the EFBs search with the value
of the similarity metric threshold   0,6 ; usage of the Chebyshev metric at the stage
of the choice refinement of the EFBs (detection efficiency - 94%, false positives 4% ).</p>
      <p>The best detection results of the VCL32 samples’ were achieved applying the
conditions: usage of the squared Euclidean metric at the stage of the EFBs search with
the value of threshold   0,6 ; usage of the Chebyshev metric at the stage of the
choice refinement of the EFBs (detection efficiency - 98%, false positives 3% ).
In addition, the best results for the G2 samples’ detection were succeeded applying
the conditions: usage of the taxicab metric at the stage of the EFBs search with the
value of the similarity metric threshold   0,6 ; usage of the Chebyshev metric at the
stage of the choice refinement of the EFBs (detection efficiency - 100%, false
positives 2% ). The experimental results are presented in figure 2. It should be noted, that
the decreasing of the similarity metric threshold value leads to the increasing of the
number of EFBs.</p>
      <p>a)
e) f)</p>
      <p>Fig. 2. Efficiency of the metamorphic viruses detection and false positives rates
FPR for the NGVCK (a), VCL32 (c), G2 (e); the dependency of the equivalent
functional blocks number on the value of the similarity threshold  ; the dependency of
detection efficiency on the metric selection mi for the NGVCK (b), VCL32 (d), G2 (f)
5</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>The paper presents an approach for the metamorphic viruses detection based on its
obfuscation features analysis. The obfuscation features were obtained on the basis of
the equivalent functional blocks search in the suspicious program and its modified
version. As a result of the comparison, the following quantitative obfuscation features
are obtained: the Damaerau-Levenstein distance, the number of insertion, deletion,
transposition and the matches of opcodes.</p>
      <p>The experiments results demonstrated that the detection efficiency depends on the
choice of the similarity metrics at the stages of the search and the choice refinement of
the equivalent functional blocks. The best results of the metamorphic virus detection
were achieved with usage of the taxicab metric at the stage of the EFBs search and the
Chebyshev metric at the stage of the choice refinement of the EFBs. It allowed
increasing efficiency from 79% to 94% in comparison with the previous research.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <source>McAfee Labs Threat Report. December</source>
          <year>2017</year>
          . Availabe: https://www.mcafee.com /us/resources/reports/rp
          <article-title>-quarterly-threats-dec-2017</article-title>
          .pdf
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nicheporuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Approach for the Unknown Metamorphic Virus Detection</article-title>
          .
          <source>In: 9-th IEEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems. Technology and Applications</source>
          , Bucharest, Romania, pp.
          <fpage>453</fpage>
          -
          <lpage>458</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Shafiq</surname>
            ,
            <given-names>M.Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tabish</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mirza</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Farooq</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>PE</surname>
          </string-name>
          -Miner: Mining Structural Information to Detect Malicious Executables in Realtime,
          <source>International Workshop on Recent Advances in Intrusion Detection</source>
          , pp.
          <fpage>121</fpage>
          -
          <lpage>141</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>David</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Filiol</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>Gallienne</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Structural analysis of binary executable headers for malware detection optimization</article-title>
          .
          <source>Journal of Computer Virology and Hacking Techniques</source>
          , Vol.
          <volume>13</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>87</fpage>
          -
          <lpage>93</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Runwal</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Low</surname>
            ,
            <given-names>R.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamp</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Opcode Graph Similarity and Metamorphic Detection</article-title>
          .
          <source>Journal in Computer Virology</source>
          , Vol.
          <volume>8</volume>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>52</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Rad</surname>
            ,
            <given-names>B. B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Masrom</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ibrahim</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Opcodes histogram for classifying metamorphic portable executables malware</article-title>
          . In: International Conference on e
          <article-title>-Learning and e-Technologies in Education, Lodz</article-title>
          , Poland, pp.
          <fpage>209</fpage>
          -
          <lpage>213</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Canfora</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iannaccone</surname>
            ,
            <given-names>A. N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Visaggio</surname>
            ,
            <given-names>C. A.</given-names>
          </string-name>
          <article-title>Static analysis for the detection of metamorphic computer viruses using repeated-instructions counting heuristics</article-title>
          .
          <source>Journal of Computer Virology and Hacking Techniques</source>
          , Vol.
          <volume>10</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>11</fpage>
          -
          <lpage>27</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Fazlali</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khodamoradi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mardukhi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nosrati</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dehshibi</surname>
            ,
            <given-names>M.M.</given-names>
          </string-name>
          <article-title>Metamorphic malware detection using opcode frequency rate and decision tree</article-title>
          .
          <source>International Journal of Information Security and Privacy</source>
          , Vol.
          <volume>10</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>67</fpage>
          -
          <lpage>86</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Bezobrazov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sachenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Komar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rubanau</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <article-title>The methods of artificial intelligence for malicious applications detection in Android OS</article-title>
          .
          <source>International Journal of Computing</source>
          <volume>15</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>184</fpage>
          -
          <lpage>190</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kryshchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kljots</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <article-title>Botnet detection technique for corporate area network</article-title>
          .
          <source>In: Proc. of the 2013 IEEE 7th International Conference on Intelligent Data Acquisition and Advanced Computing Systems</source>
          , pp.
          <fpage>363</fpage>
          -
          <lpage>368</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Eskandari</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hashemi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>A graph mining approach for detecting unknown malwares</article-title>
          .
          <source>Journal of Visual Languages and Computing</source>
          , Vol
          <volume>23</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>154</fpage>
          -
          <lpage>162</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Kaushal</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Swadas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prajapati</surname>
            <given-names>N.</given-names>
          </string-name>
          <article-title>Metamorphic Malware Detection Using Statistical Analysis</article-title>
          .
          <source>International Journal of Soft Computing and Engineering</source>
          , Vol.
          <volume>2</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>49</fpage>
          -
          <lpage>53</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nicheporuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Metamorphic Viruses' Detection Technique Based on the Equivalent Functional Block Search</article-title>
          . ICT in Education, Research and
          <string-name>
            <given-names>Industrial</given-names>
            <surname>Applications</surname>
          </string-name>
          , Integration,
          <source>Harmonization and Knowledge Transfer</source>
          , Vol.
          <year>1844</year>
          , pp.
          <fpage>555</fpage>
          -
          <lpage>569</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Kondratenko</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kondratenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Soft Computing Algorithm for Arithmetic Multiplication of Fuzzy Sets Based on Universal Analytic Models</article-title>
          . In book: Information and Communication Technologies in Education, Research, and
          <string-name>
            <given-names>Industrial</given-names>
            <surname>Application</surname>
          </string-name>
          .
          <source>Communications in Computer and Information Science 469</source>
          , pp.
          <fpage>49</fpage>
          -
          <lpage>77</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>