<!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>Detecting Software Malicious Implant Based on Anomalies Research on Local Area Networks</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Khmelnytsky National University</institution>
          ,
          <addr-line>Khmelnytsky</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>The paper analyzes malicious software implants that use undocumented software features on local area networks. They can cause significant harm both users of personal computers and enterprises that utilize computer networks and use specialized software. In order to detect this type of malware, its possible models and behavioral scenarios, features, stages of research in local area networks have been proposed. Based on this data, a method for detecting computer anomalies has been developed, which is part of a general process for detecting malicious software implants that use undocumented software features. The result of the method is a division of computers on a local network into classes in purpose for further investigation of behavioral patterns. Thus, groups of computer are highlighted in which similar profiles have been formed, that in the overall scheme allows to improve the accuracy of detection. The adopting of the developed models of software implants that use undocumented software features, as well as a method for detecting computer anomalies, have allowed to carry out experimental researches with the use of distributed detection system. The results of the experiments have shown the correctness of the proposed detection enhancement solutions.</p>
      </abstract>
      <kwd-group>
        <kwd>Software Malicious Implant</kwd>
        <kwd>Local Network</kwd>
        <kwd>Computer</kwd>
        <kwd>Malware</kwd>
        <kwd>Czekanowski Diagram</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        According to research [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] of IDC firm and the University of Singapore,
malwarerelated security breaches cause users worldwide damage of at least on $ 500 billion
annually. Moreover, the number of malicious software is growing every year [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The
most relevant for the benefit of attackers are organizations and enterprises that operate
information technology on local computer networks. There are many ways to gain
entry into the local computer networks of businesses (organizations) for the purpose
of unauthorized access to information in them. One way for attackers to access
enterprises (organizations) information resources is to use undocumented capabilities in
the software and hardware of computers and peripherals that allows unauthorized
access to system resources, typically, via a local network. This is achieved through
the using of software implants, which primary purpose is to provide unauthorized
access to sensitive information.
      </p>
      <p>
        Software implant is a secretly implemented program which poses a threat to the
information contained on the computer [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The software implant can be implemented
as a separate malware, or as undocumented software code in the software.
      </p>
      <p>We will consider the software implants that use undocumented software features
on the local computer networks of enterprises (organizations) as an object of research.
The difficulty of detecting such a secretly functioning software object, which under
certain conditions is capable of providing unauthorized access, is due to the absence
of its activity during a long time. As a rule, such software implants allow to keep
software features and are implemented by some else of the features included in the
software package.</p>
      <p>
        An enterprise may use ready-made software that already has software implants, or
software made to order, which has been poorly verified upon commissioning.
Software that runs inside enterprise LANs is typically a distributed, which makes software
implants are active on all computers on the network. This increases the threat to
businesses and organizations. Software implants can be used to create botnets [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ],
implement trojans, or produce metamorphic or polymorphic components [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], and so on.
Therefore, the scientific problem of detecting software implants on the local area
networks is relevant.
      </p>
      <p>One of the primary tasks that need to be addressed is to develop appropriate
methods for creating effective components of a comprehensive system for detecting
software implants on local area networks.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related works</title>
      <p>
        Software implants detection studies are presented in many ways that depend on the
considering of specific malware types. The main problem that accompanies the
process of software implants detection is the discrepancy between what the user sees and
what actually happens [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. To achieve these results, the attackers have developed
quite a few tools and approaches.
      </p>
      <p>
        The most common research in this area is Backdoor malware detection studies
[612]. In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] authors proposed a new approach to detecting and removing Backdoor
malware using neural networks. The experimental results obtained are based on the
classification made. The work focuses on such type of attack that allows attackers to
insert a hidden function or hidden program code into a malicious action model.
Detection of such types of malware is difficult task, because unexpected behavior occurs
only when there is a launch to execute a hidden function or program code known only
to the attacker. The adequacy of the proposed solution requires more convincing
evidence since a small set of validated and reliable datasets was used [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] presents a model used by intruders to hide the invasion path. One of these
techniques is done by using multiple hosts on the network, which can be detected
using the approach suggested by the authors. Authors explored the opportunity the use
of this approach to detect others type of malware, including Backdoor. The study
shows that the proposed approach can produce a very low rate of false negative and
false positive and allow to reduce the detection time of the scanning process.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] it is analyzed and substantiated that, due to the complexity of the studied
topic, there are few effective solutions. One way analyzed by the authors is to encode
code fragments using specially designed interrupts that, when triggered, manipulate
the run time state and, under certain conditions, can perform arbitrary computations
without fail.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] proposes to solve the problem of formalizing a terminal machine by
modeling a program or system using a so-called machine with a designated end state that
allows one to treat the software fragment as an emulator. Also authors have developed
the concept of a multi-step game where an attacker and a defender get to take turns
interacting that allows thinking about it as the system with states and transitions
between them.
      </p>
      <p>
        In works [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ] analyze the complexity of the problem with using many tools.
This could jeopardize the platform by other means. For example, this is may be a
hardware component, a custom program or a piece of malware. And this is a
prerequisite for development methods for detecting them. A significant obstacle to the
effectiveness of this approach is the lack of test samples.
      </p>
      <p>
        Another equally malicious tool is the implementation of the software and the
launch of the secret exchange feature. The features of such a hidden function are
presented in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. To address this in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] developed five steps to identify a hidden
function in software.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], models of hidden schemes of function exchange are considered and
analyzed. They take into account the availability of the secure protocol of distributed
information transmission. The reliability of such a protocol under the conditions of
existence of hidden functions is investigated.
      </p>
      <p>
        Another type of malicious software which can introduce software implants is a
botnets [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ]. In [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] a technique for botnet detection based on a DNS-traffic is
presented. Botnets detection based on the property of bots group activity in the
DNStraffic, which appears in a small period of time in the group DNS-queries of hosts
during trying to access the C&amp;C-servers, migrations, running commands or
downloading the updates of the malware. The method takes into account abnormal
behaviors of the hosts’ group, which are similar to botnets: hosts’ group does not honor
DNS TTL, carry out the DNS-queries to non-local DNS-servers. Method monitors
large number of empty DNS-responses with NXDOMAIN error code.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] a DNS-based anti-evasion technique for botnets detection in the corporate
area networks is proposed. Authors have combine of the passive DNS monitoring and
active DNS probing and have construct BotGRABBER detection system for botnets
in corporate area network, which uses such evasion techniques as cycling of IP
mapping, “domain flux”, “fast flux”, DNS-tunneling. BotGRABBER system is based on a
cluster analysis of the features obtained from the payload of DNS-messages and uses
active probing analysis.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref18 ref19 ref20 ref21 ref22 ref23 ref24 ref25 ref26">18-26</xref>
        ] it is shown how the use of metamorphic transformations makes it
possible to hide program codes of functions. Along with polymorphic technologies [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ],
these methods are quite effective and widely used by attackers.
      </p>
      <p>
        The works in [
        <xref ref-type="bibr" rid="ref28 ref29 ref30">28-30</xref>
        ] analyzed the use of known mathematical methods for
processing events related to software operation. The discussed methods can be used to
detect software implants that use undocumented software features, but only after the
process of processing big data obtained during monitoring has been completed.
      </p>
      <p>
        Thus, software implants that use undocumented software features [
        <xref ref-type="bibr" rid="ref31 ref32 ref33 ref34 ref35 ref36">31-36</xref>
        ] pose a
problem for computer users, especially when they can be distributed on local
computer networks. Known detection methods target to specific subclasses or typical classes
of malware and are not sufficiently represented in related works. The various
mathematical methods used for detection process, means require the initial stages of
preparation of the data for processing, which aims to design a comprehensive approach of
detection.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>A method for detecting anomalies in the computer systems based on the search for deviations from the mean values of the behavior profiles</title>
      <p>In order to detect software implants that use undocumented software features, let's
build profiles of computer systems (CS) based on behavior of software in which it is
executed. Because the client side of the software is the same, they should have similar
behavioral profiles. System profiles can be clustered in the local area networks
(LANs) into CS groups that use typical parts of specialized software. Such profiles
can range from one to 5-10, because specialized software has a narrow focus and,
therefore, cannot be sprayed for various purposes. We define these profiles as
formalized models of software behavior in CS. After some time of functioning of the
specialized software and the available software in the CS the statistics is collected, that is
use for the refinement of profiles. Developing a formal representation of behavior
profiles is based on a numerical expression of the features. After receiving profiles,
the system functions and, on a daily start, analyzes the similarity of profiles and
results of the functioning of the software in the CS. The presence of clustering profiles
allows to more accurately identifying possible anomalies in the CS that belong to
certain groups.</p>
      <p>To detect software implants that use undocumented software features in LANs, it
is important to create a set of their behavioral signatures. In order to form a database
of behavioral signatures, appropriate models of software implants were developed
based on scenarios of their functioning. The implementation of software implants that
use undocumented software features at different stages of the software life cycle can
occur by the following scenarios:
1. Work of attackers inside software development team.
2. Creation of dynamically formed commands or parallel computing processes.</p>
      <p>Scenarios of introducing of software implants that use undocumented software
features are directly dependent and affect on their structure, so they may be separate
entities or parts of another entity. Let's present all scenarios as graphs and formalize
them with respect to the structure of the software implants that use undocumented
software features, as well as all possible combinations of them.</p>
      <p>As an example, on the fig. 1 has shown a graph of an irregular Markov process.
two or more files. Suppose with equal probability
arrives in pairs on states S4, S5, S6, S7. The states S8, S9, S10, S11 will be counted. For
example, if more information is obtained from states S10, S11, then it will indicate that
software implants that use undocumented software features are placed in several
working files of the program.</p>
      <p>We detect software implants that use undocumented software features by
manifestations which are based on file analysis and network activity. These manifestations
depend on the models of functioning and structure incorporated in them. These
features are: presence of software modules that do not meet the purpose of the process;
presence of operating system objects that are open by the process but do not conform
to the purpose of the process; high intensity of input/output operations for a certain
process; a high CPU or internal memory usage from a certain process; the similarity
of the file name to the system file name; the operating system process executable file
is not in the common directory; the system process is run on behalf of the local user;
code enforcement in the data area, which is enabled for all processes, is disabled for
the certain process; the system process has a directory other than what it must be for
that process; the absence of digital signature in the executable; high network activity
of the process, which must run locally, etc. However, to improve detection efficiency,
it is need tools that allow to establish the fact of the threat without the intervention of
a network administrator who may not be able to process certain attributes for various
reasons. Software implants that use undocumented software features may use masking
tools on the system, making it difficult to detect them. On the technical side software
implants use programming methods that are not common when creating standard
software, so these features can also be additional attribute to identify them. In
particular, for a Windows executable, these features can be: an additional section at the end
of the file; an entry point indicates a transition to the middle of a section that is not a
code section; the entry point correspond to a jump command that specifies a jump for
the code section; the presence of features that indicates a code section, which is not a
code section. Similarly for other environments on the CS, information from which
may be related with RAM.</p>
      <p>Let's describe the models of software implants that use undocumented software
features on LANs:
1. software implants are injected in the software, stores all or selected pieces of
software, entered or displayed in the hidden area of local or remote external direct
access memory; the object of storage may be keyboard inputs, documents that will be
printed; this model requires external storage, which must be organized in such a
way as to ensure that it is stored for a specified period of time and can be further
removed and hidden from other users or processes;
2. software implants are embedded in network or telecommunication software; As a
rule, this software is always active, so software implants control the processing of
information on the computer, performing installation and deletion other implants,
as well as removing the accumulated information; software implants that use
undocumented software features can trigger events for previously implemented
implants;
3. software implants that use undocumented software features transmit information
stored by an attacker (such as keyboard input) into a communication channel, or
store it without relying on the guaranteed possibility of further reception or
removal; software implants may also initiate continuous access to information, leading to
an increase in signal-to-noise ratio when intercepting side radiation;
4. software implants that use undocumented software features distort data streams
that occur during applications running (source streams), or distort input streams of
information, or initiate (or suppress) errors that occur when running applications;
5. software implants which do not produce direct affect on software. The main
purpose is to maximize the resulting "residual" information for further study; the
attacker either obtains these fragments using the implants of the previous models, or
directly accesses the computer in the guise of repair or diagnosis.</p>
      <p>To detect software implants that use undocumented software features it is need to
detect anomalies in a particular CS based on searching of deviations from the mean
values of the behavior profiles. Thus, it is need to develop a detection method based
on a combination of anomaly detection technologies and behavioral signature
matching.</p>
      <p>The implementation of the detection of software implants that use undocumented
software features is based on the further development of information technology,
which will include profile models, models of software implants and method of
anomaly detection and theirs applying on LANs to investigate specialized software.</p>
      <p>
        To determine the software profile in the CS, we use the system call monitor [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ].
First, let's form API call sequences for each of the processes over a long time and
build a software profile in the CS. After profile creation their clusterization is done.
And the last step, if it is possible to divide profiles by more than one class, analysis of
the obtained classes of CS is conducted.
      </p>
      <p>
        For the study we use the anomaly search scheme. In order to reduce the number of
input, grouping of similar values was done. The resulting profile scheme is a partial
case of multidimensional analysis, where multiple objects are considered on many
grounds. When processing statistic data in multivariate analysis [
        <xref ref-type="bibr" rid="ref4 ref5 ref6">4, 5, 6</xref>
        ], taxonomic
methods have been used that do not require expert evaluation but are based only on
observation results. The input for the study is the observation matrix:
where n is the number of features observed on the objects; s is number of objects;
xik – the number of manifestations of k-th feature in i-th object during the
observation period. The features normalization is carried out according to:
      </p>
      <p>After applied formula 2 the matrix V was created:</p>
      <p>Vik =
xik
s
∑i =1 xik
V11

V21
 ...</p>
      <p>V = 
Vi1
 ...

Vs1</p>
      <p>According to matrix (4), it is possible to arrange the objects by isotonic metric,
that is, by the rank that characterizes the object by the set of features. Next stage
involves structural (isomorphic) ordering of objects. To do this, with the matrix X, the
matrix Z is formed by using formulas (4) and (5):
W1 
 
W2 
 ... 
W =  
Wi 
 ... 
 
WS 
n</p>
      <p>Wi = ∑i =1Vik
Zik =
 Z11

Z 21
 ...</p>
      <p>Z = 
 Zi1
 ...

 Z s1
xik
s
∑i =1 xik</p>
      <p>n
/ ∑i =1
xik
s
∑i =1 xik
Z 21
Z 22
...</p>
      <p>Zi2
...</p>
      <p>Z s1
...
...
...
...
...
...</p>
      <p>Z1k
Z 2k
...</p>
      <p>Zik
...</p>
      <p>Z sk
...
...
...
...
...
...</p>
      <p>The diagram shows that the objects 1, 2, 6, 7 are grouped together and have the
smallest deviation (with all group) from the main diagonal. In our case, these may be
computers that have specialized software installed. Objects 5 and 3 are form own two
subsets that are far from the main diagonal. At the same time the outermost objects
belong to numbers 4 and 8.</p>
      <p>Thus, it is possible to divide software profiles in the CS into classes and, further,
conduct analyzes the deviations in the classes with purpose of anomalies searching.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Experiments and evaluation</title>
      <p>
        In order to conduct series of experiments a distributed system [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ] for detecting
malware was used. Software implants that use undocumented software features were
developed as part of each of the typical botnets. The purpose of the experiments was
verification of the botnets detection method, the efficiency of the classifier in the
structure of the distributed system and determination of the dependence of the
percentage of detected nodes of the botnets, which had contained software implants. To
perform the experiments, 28 botnets and codes of known detected botnets were
constructed [
        <xref ref-type="bibr" rid="ref44">44</xref>
        ]. All generated botnets were grouped by classes. From generated botnets
25 structural elements in three stages of operation and 81 functions were allocated.
      </p>
      <p>The experiment was conducted for the classifier without adding instances of the
created botnets and with them, that is, the check was performed without training the
classifier on the created samples and with the preliminary classification of the
samples by classes. The second variant is necessary to check the accuracy of classifying
the same samples from which this class is built. This is important because during
monitoring API functions may occur errors. The monitoring time of the CS in LAN
was 350 hours for each instance of the botnet of each of the two classifiers. It is
should be noted that the functionality of the botnet nodes was simplified and did not
include the attack option. The botnet nodes only worked in control and support modes
of own functioning. Thus, for a distributed system the objects of research were
running processes on CS. In order to conduct the experiment botnets that use the strategy
of obtaining full control by activating their components were selected. That is
software implants that use undocumented software features were presents on each CS. In
order to obtain software profile in the CS we perform API monitoring call. Based on
the obtained profiles the features vectors are formed. After feature vector creation
their clusterization is done. The results of calculation different metrics are presented
in table. 2.</p>
      <p>The experiments involved determining the following metrics for the detection of
bot nodes:</p>
      <p>P1,1 – the percentage of vectors of malicious actions belonging to certain class
relative to all test samples that the system assigned to this class with previous training;
P1,2 – similar to metric P1,1 , but without previous training;</p>
      <p>P2,1 – the percentage of malicious action vectors belonging to a given subclass of a
class relative to all test vectors that the system assigned to that subclass of the class in
the test sample (those that were correctly assigned to the subclasses) with previous
training;</p>
      <p>P2,2 – similar to metric P2,1 , but without previous training;
P3,1 – the percentage of correctly detected botnet nodes with previous training
P3,2 – similar to metric P3,1 , but without previous training;</p>
      <p>P4,1 – the percentage of incorrectly classified botnet nodes as benign applications
(type I error) with previous training;</p>
      <p>P4,2 – similar to metric P4,1 , but without previous training;</p>
      <p>P5,1 – the percentage of incorrectly assigned bot nodes to one of the botnet classes
(type III error), with previous training;</p>
      <p>P5,2 – similar to metric P5,1 , but without previous training.</p>
      <p>The results of evaluating the efficiency of detection the software of botnets' nodes
based on the work of two classifiers for the entered classes and subclasses in the
classifier are shown in table 2.</p>
      <p>Metrics
P1,1 , %
P1,2 , %
P2,1 , %
P2,2 , %
P3,1 , %
P3,2 , %
P4,1 ,%
P4,2 ,%
P5,1 ,%
P5,2 ,%</p>
      <p>
        As a result of the experiment correctly clasterized 66% of test samples for the
classifier without the entered vectors of artificially generated botnets and 88% for the
classifier to which the vectors were previously added by performing its training. The
percentage of features that the distributed system used to detect botnets and have
related to manifestations of software implants, is approximately 27% of the overall
detected. The intensity of manifestations of software implants is significantly lower
than typical manifestations of botnets. Thus, software implants that use
undocumented software features within botnets can be detected by distributed systems [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ] and
the direction of such research is promising.
      </p>
    </sec>
    <sec id="sec-5">
      <title>Discussion and Future work</title>
      <p>Software implants that use undocumented software features used on local area
networks can be developed and used in various malicious models. Important task is
further developing formal profiles and its behavioral signatures. The combination of
these components will allow you to get metrics to investigate the presence of this type
of malware.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>Software implants that use undocumented software features used on local area
networks can cause significant harm to users of personal computers, especially to
businesses that use computer networks and use specialized software.</p>
      <p>
        The obtained class divisions according to the developed solution will allow to
perform further analysis of deviations for anomalies search in the classes. The use of
developed models of Software implants that use undocumented software features in
distributed detection systems [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ] has made it possible to improve the detection
efficiency of the botnets they were part of.
      </p>
      <p>The direction of further research is the specification and definition of the many
functions that will form elements of Software implants that use undocumented
software features, with the aim of representation of theirs behavioral signatures to
improve detection efficiency.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Sanjam</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gentr</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Halevi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raykova</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sahai</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Waters</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Hiding Secrets in Software: A Cryptographic Approach to Program Obfuscation</article-title>
          .
          <source>Communications of the ACM</source>
          , Vol.
          <volume>59</volume>
          , No.
          <issue>5</issue>
          , pp.
          <fpage>113</fpage>
          -
          <lpage>120</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <source>McAfee Mobile Threat Report Q1</source>
          ,
          <year>2019</year>
          . Available: https://www.mcafee.com/enterprise/en-us/assets/reports/rp-mobile
          <source>-threat-report-2019</source>
          .pdf
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. DSTU 3396.
          <article-title>2-97 Protection of information</article-title>
          .
          <source>Technical protection of information. Terms and definitions. State Committee of Ukraine</source>
          , Kyiv (
          <year>1997</year>
          ) [in Ukrainian]
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <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="ref5">
        <mixed-citation>
          5.
          <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>
          .
          <source>CEUR Workshop</source>
          , Vol.
          <year>1844</year>
          , pp.
          <fpage>555</fpage>
          -
          <lpage>569</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carvalho</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baracaldo</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ludwig</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Edwards</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          et al:
          <article-title>Detecting Backdoor Attacks on Deep Neural Networks by Activation Clustering</article-title>
          .
          <source>CEUR Workshop</source>
          , Vol.
          <volume>2301</volume>
          , (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Adups</given-names>
            <surname>Backdoor</surname>
          </string-name>
          . Available: https://www.kryptowire.com/adups_security_analysis.
          <source>html.</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Alminshid</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Omar</surname>
            ,
            <given-names>M. N.</given-names>
          </string-name>
          :
          <article-title>Detecting backdoor using stepping stone detection approach</article-title>
          .
          <source>In: Proc. of 2013 Second International Conference on Informatics &amp; Applications (ICIA)</source>
          , Lodz, Poland, pp.
          <fpage>87</fpage>
          -
          <lpage>92</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Zaddach</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurmus</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balzarotti</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blass</surname>
            ,
            <given-names>E.-O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Francillon</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , et al.:
          <article-title>Implementation and Implications of a Stealth Hard-drive Backdoor</article-title>
          .
          <source>In. Proc. of 29th Annual Computer Security Applications Conference</source>
          , New Orleans, Louisiana,
          <string-name>
            <surname>US</surname>
          </string-name>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Dullien</surname>
            ,
            <given-names>T. F.</given-names>
          </string-name>
          :
          <article-title>Weird machines, exploitability, and provable unexploitability</article-title>
          .
          <source>IEEE Transactions on Emerging Topics in Computing, No. 99</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Thomas</surname>
            ,
            <given-names>S. L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chothia</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia</surname>
            ,
            <given-names>F. D.:</given-names>
          </string-name>
          <article-title>HumIDIFy: A Tool for Hidden Functionality Detection in Firmware</article-title>
          .
          <source>In: Proc. of 14th International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment</source>
          , Bonn, Germany, pp.
          <fpage>279</fpage>
          -
          <lpage>300</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Thomas</surname>
            ,
            <given-names>S. L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chothia</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia</surname>
            ,
            <given-names>F. D.</given-names>
          </string-name>
          :
          <article-title>Measuring the Importance of Static Data Comparisons to Detect Backdoors and Undocumented Functionality</article-title>
          .
          <source>In: Proc. of 22nd European Symposium on Research in Computer Security</source>
          . Oslo, Norway, pp.
          <fpage>513</fpage>
          -
          <lpage>531</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Schönegge</surname>
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The Hidden Function Question Revisited</article-title>
          .
          <source>In: Proc. of Algebraic Methodology and Software Technology: 6th International Conference</source>
          , AMAST '
          <fpage>97</fpage>
          .
          <string-name>
            <surname>Sydney</surname>
          </string-name>
          , Australia, pp.
          <fpage>451</fpage>
          -
          <lpage>464</lpage>
          (
          <year>1997</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <article-title>The Secret Code of Software Validation…</article-title>
          .In 5 Easy Steps. Available: https://www.cebos.com/blog/the-secret
          <article-title>-code-of-software-validation-in-5-easy-steps/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Kawamoto</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yamamoto</surname>
          </string-name>
          , H.:
          <article-title>Secret function sharing schernes and their applications to the oblivious transfer</article-title>
          .
          <source>In: IEEE International Symposium on Information Theory</source>
          , pp.
          <fpage>281</fpage>
          -
          <lpage>295</lpage>
          , Yokohama, Japan (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Pomorova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <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>Kryshchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bobrovnikova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>A Technique for the Botnet Detection Based on DNS-Traffic Analysis</article-title>
          .
          <source>Communications in Computer and Information Science</source>
          , Vol.
          <volume>522</volume>
          , pp.
          <fpage>127</fpage>
          -
          <lpage>138</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Pomorova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <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>Kryshchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bobrovnikova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Anti-evasion Technique for the Botnets Detection Based on the Passive DNS Monitoring and Active DNS Probing</article-title>
          .
          <source>Communications in Computer and Information Science</source>
          , Vol.
          <volume>608</volume>
          , pp.
          <fpage>83</fpage>
          -
          <lpage>95</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <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>
          , pp.
          <fpage>453</fpage>
          -
          <lpage>458</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Desai</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamp</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A highly metamorphic virus generator</article-title>
          .
          <source>Int. J. Multimedia Intelligence and Security</source>
          , Vol.
          <volume>1</volume>
          (
          <issue>4</issue>
          ), pp.
          <fpage>402</fpage>
          -
          <lpage>427</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Podlovchenko</surname>
            ,
            <given-names>R.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuzyurin</surname>
            ,
            <given-names>N.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shcherbina</surname>
            <given-names>V.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zakharov</surname>
            <given-names>V.A.</given-names>
          </string-name>
          :
          <article-title>Using algebraic models of programs for detecting metamorphic malwares</article-title>
          .
          <source>Journal of Mathematical Sciences</source>
          , Vol.
          <volume>172</volume>
          (
          <issue>5</issue>
          ), pp.
          <fpage>740</fpage>
          -
          <lpage>750</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Anderson</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Quist</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neil</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Storlie</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lane</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Graph-based malware detection using dynamic analysis</article-title>
          .
          <source>Journal in Computer Virology</source>
          ,
          <volume>7</volume>
          , pp.
          <fpage>247</fpage>
          -
          <lpage>258</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <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>
          ,
          <volume>8</volume>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>52</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Nagaraju</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Metamorphic malware detection using base malware identification approach</article-title>
          .
          <source>Journal Security and Communication Networks</source>
          ,
          <volume>7</volume>
          , pp.
          <fpage>1719</fpage>
          -
          <lpage>1733</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Patel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Similarity tests for metamorphic virus detection</article-title>
          .
          <source>Master's thesis</source>
          , San Jose State University (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Wong</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Analysis and Detection of Metamorphic Computer Viruses</article-title>
          .
          <source>Master's thesis</source>
          , San Jose State University (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Kuriakose</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinod</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Unknown Metamorphic Malware Detection:
          <article-title>Modelling with Fewer Relevant Features and Robust Feature Selection Techniques</article-title>
          ,
          <source>IAENG International Journal of Computer Science</source>
          , Vol.
          <volume>42</volume>
          (
          <issue>2</issue>
          ),
          <fpage>p139</fpage>
          -
          <lpage>151</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Pomorova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <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>Kryshchuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Nicheporuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A technique for detection of bots which are using polymorphic code</article-title>
          .
          <source>In: 21st International Conference</source>
          , CN, Springer, Brunów, Poland, pp.
          <fpage>265</fpage>
          -
          <lpage>276</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Tarhio</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ukkonen</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Approximate BoyerMoore String Matching</article-title>
          .
          <source>SIAM Journal on Computing</source>
          , Vol.
          <volume>22</volume>
          , No.
          <issue>2</issue>
          , pp.
          <fpage>243</fpage>
          -
          <lpage>260</lpage>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Antoshchuk</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kharchenko</surname>
          </string-name>
          , V.:
          <article-title>Natural Development of the Resources in Design and Testing of the Computer Systems and their Components</article-title>
          .
          <source>In: 7th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications</source>
          , pp.
          <fpage>233</fpage>
          -
          <lpage>237</lpage>
          . Berlin, Germany (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Kondratenko</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kondratenko</surname>
          </string-name>
          , N.:
          <article-title>Soft Computing Analytic Models for Increasing Efficiency of Fuzzy Information Processing in Decision Support Systems. Chapter in book: Decision Making: Processes, Behavioral Influences and Role in Business Management</article-title>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hudson</surname>
          </string-name>
          (Ed.), Nova Science Publishers, New York,
          <fpage>41</fpage>
          -
          <lpage>78</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Proskurin</surname>
          </string-name>
          , V.:
          <article-title>Software malicious implant in secure systems</article-title>
          . Available: http://www.crimeresearch.ru/library/progwir98.htm [in Ukrainian].
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Kaarin</surname>
          </string-name>
          , О. V.:
          <article-title>Program protection theory and practice</article-title>
          .
          <source>MGUL</source>
          , pp.
          <volume>450</volume>
          (
          <year>2004</year>
          ) [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Kaarin</surname>
          </string-name>
          , О. V.
          <article-title>Computer system software security</article-title>
          .
          <source>MGUL</source>
          , pp.
          <volume>212</volume>
          (
          <year>2003</year>
          ) [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Shanugin</surname>
            ,
            <given-names>V. F.</given-names>
          </string-name>
          <article-title>Protection of computer information. Effective methods and tools: a textbook</article-title>
          . DMK Press, pp.
          <volume>544</volume>
          (
          <year>2008</year>
          ) [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Shanugin</surname>
            ,
            <given-names>V. F.</given-names>
          </string-name>
          <article-title>Protection of information in computer systems and networks</article-title>
          . DMK Press, pp.
          <volume>592</volume>
          (
          <year>2012</year>
          ) [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Balakrishnan</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reps</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>WYSINWYX: What You See Is Not What You eXecute</article-title>
          .
          <source>In: Proc of ACM Transactions on Programming Languages and Systems</source>
          , Vol.
          <volume>32</volume>
          ,
          <string-name>
            <surname>Issue</surname>
            <given-names>6</given-names>
          </string-name>
          , (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Igumnov</surname>
            ,
            <given-names>B. N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavgorondnyaya</surname>
            ,
            <given-names>T. P.</given-names>
          </string-name>
          <article-title>Cybernetic basis of construction of economic systems of enterprises</article-title>
          . Khmelnitsky, TUP, pp.
          <volume>344</volume>
          (
          <year>2000</year>
          ) [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Palyata</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>В</surname>
          </string-name>
          .
          <article-title>Comparative multidimensional analysis in economic research</article-title>
          . Statistica, pp.
          <volume>151</volume>
          (
          <year>1980</year>
          ) [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Shatalkin</surname>
            ,
            <given-names>A.I.</given-names>
          </string-name>
          <article-title>Taxonomy: Grounds, principles and rules</article-title>
          .
          <source>Tovarischestvo nauchnyih izdaniy KMK</source>
          , pp.
          <volume>600</volume>
          (
          <year>2012</year>
          ) [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Zhambyu</surname>
          </string-name>
          , М.
          <article-title>Hierarchical cluster analysis and matching</article-title>
          . Finance and statistics, pp.
          <volume>345</volume>
          (
          <year>1988</year>
          ) [in Russian].
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <surname>Ward</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          :
          <article-title>Hierarchical grouping to optimize an objective function</article-title>
          .
          <source>Journal of the American Statistical Association</source>
          , Vol.
          <volume>58</volume>
          , No.
          <volume>301</volume>
          , pp.
          <fpage>236</fpage>
          -
          <lpage>244</lpage>
          (
          <year>1963</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <surname>Savenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nicheporuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hurman</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lysenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Dynamic Signature-based Malware Detection Technique Based on API Call Tracing</article-title>
          .
          <source>CEUR Workshop</source>
          , Vol.
          <volume>2393</volume>
          , pp.
          <fpage>633</fpage>
          -
          <lpage>643</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          43.
          <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>Kryschuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>: Multi-agent based approach of botnet detection in computer systems</article-title>
          .
          <source>Communications in Computer and Information Science</source>
          , Vol.
          <volume>291</volume>
          , pp.
          <fpage>171</fpage>
          -
          <lpage>180</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          44.
          <string-name>
            <surname>Balyk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karpinski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Naglik</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shangytbayeva</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romanets</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Using graphic network simulator 3 for DDoS attacks simulation</article-title>
          .
          <source>International Journal of Computing</source>
          . Vol.
          <volume>16</volume>
          , Issue 4, pp.
          <fpage>219</fpage>
          -
          <lpage>225</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>