<!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>
      <journal-title-group>
        <journal-title>Workshop on Cybersecurity Providing in Information and Telecommunication Systems, February</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Random-Bit-Sequence Generator based on the Fundamental Physical Process for Secure Wideband Communication Links⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ihor Koriakov</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksandr Pliushch</string-name>
          <email>oleksandr.pliushch@knu.ua</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maryan Kyryk</string-name>
          <email>marian.i.kyryk@lpnu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bohdan Zhurakovskyi</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Serhii Toliupa</string-name>
          <email>serhii.toliupa@knu.ua</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Lviv Polytechnic National University</institution>
          ,
          <addr-line>12 Bandery str., 79013 Lviv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute</institution>
          ,”
          <addr-line>37 Beresteiskyi ave., 03056 Kyiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Taras Shevchenko National University of Kyiv</institution>
          ,
          <addr-line>60 Volodymyrska str., 01601 Kyiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>28</volume>
      <issue>2025</issue>
      <fpage>381</fpage>
      <lpage>391</lpage>
      <abstract>
        <p>Information warfare in general and electronic warfare in particular have assumed the paramount role in modern war settings. One of the main techniques to secure electronic communication systems is the spread-spectrum method. The robustness of the pseudorandom codes used in spread-spectrum communications is considered insufficient. The paper examines the creation of an entropy source for use in random bit generators for creating true random sequences for spread-spectrum and cryptographic applications. It is shown that the real source of entropy can only be based on some fundamental physical processes; therefore, the random bit generator is designed on the base of a thermal noise generated by the active impedance in an electrical circuit. It is shown that the characteristics of the entropy source can be brought so close to those of the ideal random sources that it would take a very long time for the observer to detect the difference between the proposed entropy source and the ideal one. The designed bit generator can be used in modern communication links for spread-spectrum and cryptographic applications.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;information warfare</kwd>
        <kwd>entropy</kwd>
        <kwd>spread-spectrum technique</kwd>
        <kwd>pseudorandom sequences</kwd>
        <kwd>cryptography</kwd>
        <kwd>random bit generator</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        modern battlefields [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
electronic warfare [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Electronic communication systems and networks play a crucial part in
modern
military
applications [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Therefore, information warfare in general and electronic warfare in particular
have assumed the paramount role in the strategy and tactics employed by the warring parties at
For radio communication links, three main approaches are used to achieve the aims of
Firstly, jamming is the most widely utilized technique which is mainly employed to disrupt
communication links altogether or make them impossible to be used properly.
      </p>
      <p>Secondly, spoofing can be highly effective. This approach means that valid messages in the
communication links are replaced by misleading or deceptive ones.</p>
      <p>
        Thirdly, an alternative approach to the jamming of communication links is to intercept
transmitted traffic of the enemy and use it for the aims of intelligence instead of simply disrupting
(jamming) those links [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ].
To counter the electronic warfare techniques listed above, most modern communication systems
and networks include implementation of the following methods [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1–3</xref>
        ]:




      </p>
      <p>Wide use of fiber optic links to prevent useful signal suppression, as well as to preclude the
interception and injection of confusing or disrupting radiations into the communication
links.</p>
      <p>
        Use of highly directional antennas (adaptive antenna arrays) with low-level side lobes
creates substantial problems for the enemy for useful signal detection and jamming [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
Use of special waveforms in time, frequency, and coding domains that allows one to
counter and restrict all forms of enemy impacts: jamming, useful signals detection, and
injection of deceptive or disrupting signals [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ].
      </p>
      <p>Use of encryption to encode sensitive messages, so that they cannot be compromised.</p>
      <p>
        One can observe that at present, in addition to the listed above, the majority of electronic
communication systems widely deploy different information technologies that prevent spoofing
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], but this is beyond the scope of this paper.
      </p>
      <p>
        Although fiber optic links are more and more used on the battlefield (to control drones as well
as to get visual information back to the operator), these links cannot be employed in many military
settings yet. Highly directional antennas usually have big dimensions and, therefore, are visible to
the enemy forces and can be easily destroyed [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        It is well-known that the widespread utilization of modern encryption methods has mostly
rendered the interception of the opposing party messages very challenging, if not altogether
impossible. As a result, due to the inability to use the enemy’s electronic communications to
intercept the messages and try to deploy spoofing, the only viable approach is to use intensive
jamming techniques [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        As a result of the analysis made above, the vast majority of electronic communication systems
commonly use an approach known as spread-spectrum communications [
        <xref ref-type="bibr" rid="ref10 ref11 ref9">9–11</xref>
        ]. If one compares
this approach with the encryption/decryption of the relayed messages [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], the spread spectrum
technique presents itself as the encryption/decryption of the radiofrequency signals carrying these
messages [
        <xref ref-type="bibr" rid="ref13 ref14 ref15">13–15</xref>
        ].
      </p>
      <p>
        The nature of spread-spectrum communications is such that the signal is spread over a wide
radiofrequency band by deploying a pseudorandom code [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        The opposite procedure involves the process of correlating the received pseudorandom code
with the beforehand stored copy of this code at the receiver’s side [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <p>
        This correlation process, as the vital part of this spread-spectrum technique, possesses the
advantage that it suppresses interference (non-correlated) by the spreading factor, which can be in
the range of 20 to 60 dB [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>
        As a result, the spread-spectrum technique provides the following benefits for electronic
communication channels [
        <xref ref-type="bibr" rid="ref1 ref14 ref15">1, 14, 15</xref>
        ]:




      </p>
      <p>
        Strong resistance to interference and jamming [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
      </p>
      <p>Multiple spread-spectrum signals transmission through communication channels using the
code division multiple access (CDMA) method.</p>
      <p>Low probability of intercept characteristics.</p>
      <p>Highly accurate range measurements.</p>
      <p>
        The two main types of spread-spectrum methods are known as direct sequence and frequency
hopping [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        Direct sequence spreading is more widely used [
        <xref ref-type="bibr" rid="ref14 ref15 ref16">14–16</xref>
        ]. In this method, a random code carrier is
deployed to spread the spectrum of the message by multiplying useful bits by the chips of the
spreading code.
The characteristics of the spreading code are vital for the spread-spectrum technique to operate
efficiently [
        <xref ref-type="bibr" rid="ref16 ref20">16, 20</xref>
        ]. Usually, pseudorandom codes are generated with the help of primitive
polynomials [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. But with the advanced current state of commuter technologies, these
pseudorandom codes can be compromised, which leaves the whole approach vulnerable [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Therefore, to secure the integrity of information over electronic communication links for both
spread-spectrum techniques and encryption methods as well, one needs to obtain a code that
would be random and not pseudorandom, as is the case at present [
        <xref ref-type="bibr" rid="ref1 ref10 ref11">1, 10, 11</xref>
        ]. When constructing a
non-deterministic (physical, true) random bit (number, sequence) generator for spread-spectrum
techniques and cryptographic applications, a high-entropy source is required [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Therefore, this
paper aims to develop a high-entropy code with characteristics so close to the ideal ones that it will
take a lot of time to detect the difference between the output signal of such a source and the ideal
one. To state it differently, the length of the analyzed sequence will be unrealistically large and the
electronic communication channel will never be compromised.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. High-entropy noise generator</title>
      <p>An efficient source of entropy can only be based on some fundamental physical process, that is, an
immutable natural phenomenon, and not on some technological achievement. For example, the
thermal noise voltage at the ends of a conductor (resistor) is generated by a fundamental natural
phenomenon, while the noise voltage determined by the effect of avalanche breakdown of a
reverse-biased p-n junction is the result of a technological achievement.</p>
      <p>Let’s consider a noise generator based on thermal noise.</p>
      <p>One should not forget that the thermal noise voltage is created by the active component of the
complex resistance of any circuit, regardless of how many resistors there are and whether there are
any at all. The thermal noise electromotive force (EMF) et is equal to (in modern notation)
et=√ 4 kTRB ,
where k is the Boltzmann constant (1.38e–23), T is the temperature in degrees Kelvin, R is the
active component of the circuit resistance in Ohms, and B is the noise bandwidth in Hz.</p>
      <p>Typically, a thermal noise generator contains a resistor and an amplifier. The equivalent circuit
of such a generator is shown in Fig. 1.
In this figure, R is the active component of the circuit resistance, generating the EMF et; ea is the
source of the amplifier’s noise voltage; i a is the source of the amplifier’s noise current; KU is the
amplifier’s voltage gain (we assume the input resistance of the amplifier to be infinite); Uo is the
amplifier’s output voltage. For the noise at the output to be as random as possible, one needs to
minimize the noise figure (NF), which determines the contribution of the amplifier’s noise to the
output signal:</p>
      <p>NF =1+</p>
      <p>Pa ,
Pt
where Pa is the amplifier’s noise power, Pt is the thermal noise power generated by the active
component of the input circuit resistance. Considering the bandwidths of all the noises and the
gain for all the noises to be the same, we can express NF through the parameters of the noise
sources as follows:</p>
    </sec>
    <sec id="sec-3">
      <title>3. Circuitry of an analog noise generator based on thermal noise sources</title>
      <p>It is important to consider several possible options and, as a result, to choose the best practical
realization among them for the equivalent circuit shown in Fig. 1. Let us remind ourselves here that
et in this figure is formed by the active component of the complex resistance of the amplifier input
circuit, regardless of its configuration.</p>
      <p>One should consider several circuit diagrams of a generator based on thermal noise. In all of
them hereinafter, R is the noisy resistor, Rf is the resistor in the op-amp feedback circuit, et is the
source of thermal noise EMF, and Uo is the op-amp output voltage. The first circuit diagram is
shown in Fig. 2.
For this circuit, we consider the resistance Rf to be significantly higher than the resistance of the
noisy resistors and, since the EMFs of the resistor’s noise et are independent, then
.</p>
      <p>In this case, Uo remains unchanged.</p>
      <p>Let us consider the second circuit, shown in Fig. 3.
.
that is, Uo will decrease by the root of 2 times.</p>
      <p>In the third circuit, shown in Fig. 4, the output voltage of the op-amp can be expressed as
follows:
√2 et Rf ,</p>
      <p>Ri</p>
      <p>In this case, by doubling the value of the resistor R, we obtain the following:
that is, Uo will increase by the root of 2 times.</p>
      <p>Let us consider the fourth option, in the form of the circuit diagram shown in Fig. 5.
The output voltage of the op-amp in Fig. 5 can be expressed in the following way:
,
that is, Uo will increase by 2 times.</p>
      <p>Let us consider once again the equivalent circuits of the noise generators taken with account of
the amplifier noise. There are two possible options. The first one is shown in Fig. 6.
In this circuit, R is the active component of the circuit resistance, generating the EMF et; ea is the
source of the amplifier’s noise voltage; ia is the source of the amplifier’s noise current; KU is the
amplifier’s voltage gain (it is assumed that the amplifier’s input resistance to be infinite), and Uo is
the amplifier’s output voltage.</p>
      <p>For the noise at the output to be as random as possible, that is, so that the amplifier’s noise is
represented in the output voltage of the op-amp to a minimum degree, one needs to minimize the
noise factor NF, which determines the contribution of the amplifier’s noise to the output signal in
the following way:</p>
      <p>NF =1+</p>
      <p>Pa
P ,</p>
      <p>t
where Pa is the amplifier’s noise power, Pt is the thermal noise power generated by the active
component of the input circuit resistance.</p>
      <p>Considering the bandwidths of all noises and the gain for all noises to be the same, we can
express NF through the parameters of the noise sources as follows:
e2
a +i2a R</p>
      <p>R
NF =1+ .</p>
      <p>4 kT</p>
      <p>And if, given ea and ia, we have chosen the value of R that minimizes NF, then knowing the
required value of Uo, we can calculate the required gain coefficient KU.</p>
      <p>Let us consider the second variant of the equivalent circuit that is shown in Fig. 7.
In Fig. 7, R is the resistance of the noisy resistor generating the EMF et, Ri is the input resistance of
the amplifier generating the EMF ei.</p>
      <p>According to Ohm’s law for the complete circuit, the maximum power from the source R can be
received under the condition Ri = R.</p>
      <p>Thus, the circuit of the noise generator shown in Fig. 2 should be considered the best option, in
which (with sufficiently large values of the resistance of the resistors Rf) the equality of the active
impedances of the source and the receiver of the noise signal is observed. This is true because the
resistors R in the circuit of each input simultaneously represent the output resistances of the
thermal noise sources and the input resistances of the amplifier.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Violation of the sampling theorem</title>
      <p>At a sampling frequency of Fs, the sampling theorem is valid not only for signals whose spectrum is
limited by frequencies from 0 to Fs/2, but also for signals in bands from Fs/2, to Fs, from Fs to 3Fs/2,
and so on. These bands are called Nyquist zones: 1st zone, 2nd zone, 3rd and so on.</p>
      <p>Modern analog-to-digital converters (ADCs) are technologically catching up with this capability
and allow working not only in the 1st zone but also in zones with much higher numbers. For
example, assume that we need to process a signal with a bandwidth of 30 MHz, in the frequency
range from 450 to 480 MHz. To achieve this, we need to install a bandpass filter at the ADC input
that selects the required frequency range of 450–480 MHz, and this filter has to operate at a
sampling frequency of 60 MHz in the 16th Nyquist zone as if this range lies in the region from 0 to
30 MHz. It is only necessary to remember that for odd Nyquist zones, the signal spectrum remains
unchanged, and for even ones it is mirrored, that is, when the frequency of the original signal
changes from the lower boundary to the upper boundary of the zone, the frequency of the resulting
signal presented in the first zone will change from the upper boundary to the lower. In this case, a
one-to-one correspondence is maintained between the analog signal as a continuous function and
the signal presented (restored from) by digital samples (with an accuracy of up to the Nyquist
zone).</p>
      <p>Now we will violate the sampling theorem. Let us take a signal with a band from 0 to 480 MHz
and digitize it without any filters with a frequency of Fs = 60 MHz. We will obtain the sum of the
signals in 16 Nyquist zones, and the components of the sum from the even zones will be
mirrorreflected. This phenomenon is called the aliasing effect and is considered harmful.</p>
      <p>The power of the resulting signal will be equal to the sum of the power of the components of all
Nyquist zones, and the one-to-one correspondence between the analog signal and the sample
values will be irreversibly lost.</p>
      <p>Fig. 8 and Fig. 9 show the graphs of a continuous noise signal with a bandwidth of 30 MHz and
a signal with a bandwidth of 480 MHz, respectively (the bold dots show the samples with a
sampling frequency of 60 MHz).</p>
    </sec>
    <sec id="sec-5">
      <title>5. Sampling of broadband noise</title>
      <p>If we take a broadband signal from a physical noise source and subject it to analog-to-digital
conversion with a sampling frequency significantly lower than the upper frequency of the noise
signal, we get the aliasing effect.</p>
      <p>What it gives one is as follows:
1. Everything is normalized, that is, summing up many independent random variables, even
not quite normal ones, leads to a normal distribution of the probability density of the
resulting signal.
2. Not quite white noise is whitened to the degree of averaging.</p>
      <p>The noise power increases by n times compared to using a narrow-band analog filter in the
1st Nyquist zone.</p>
      <p>The correlation between the original signal samples decreases to a power of times.</p>
      <p>The main inference is that the signal, possibly not ideal, is idealized to a power corresponding to
the number of steps of averaging. In practice, 16 of them is more than enough.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Vanishing difference</title>
      <p>Let us there be two independent binary sequences a and b with probabilities of zero and one,
respectively, p0, p1 and bias d = |p0–p1|. Then, when summing modulo 2 sequences a and b, the bias
of the probability of zero and one for the summed sequence will be equal to 2d2. In the general case,
the expectation of the bias of the sum of m independent sequences with the same biases will have
the order of the m-th power of the expectation of the bias of one sequence.</p>
      <p>For the confidence probability β and the number of elements in the sequence N, we define the
admissible interval ε, into which the bias d must fall when p0 = p1, as,
ε =</p>
      <p>To secure that with probability β the shift dm of the sum of m sequences of length N does not
go beyond the permissible interval ε, i.e. to satisfy the condition dm&lt;ε, we can define the minimum
required number m of summed sequences as
ln d
m=⌈ ⌉</p>
      <p>ln ε .</p>
      <p>Below are the values of m for a range of values of β, d, and N.
Individual ADC digits can be selected as independent sequences for summation (to eliminate
possible correlations between digits, we will delay the values of different digits by a different
number of clock cycles). If an m-digit ADC is used, then the estimate of the value of the permissible
interval ε for a given value of d will be:</p>
      <p>For example, for an 8-bit ADC with m = 8 and d&lt;1%, we obtain an interval estimate of ε = 1e–16.</p>
      <p>According to the law of the iterated logarithm (the limit law of probability theory), the
following condition may be violated for some sufficiently large n if the sequence differs from the
ideal Bernoulli sequence
ε =exp ( m⋅ln d ) .
xn&lt; √( 2 lnln n )/ n</p>
      <p>.
,</p>
      <p>Here xn is the estimate of the deviation of the probability of the sequence values from the
expectation value of 0.5 in n experiments, equal to
n−1
∑ ( bk−0 . 5 )
x = k=0</p>
      <p>n
where bk is the k-th bit of the sequence.</p>
      <p>Our degree of difference is the value xn, comparable with the boundaries of the interval ε = 1e–
16, by the value of which we can easily calculate n = 1.0e33.</p>
      <p>If our generator produces random bits at a rate of 60 Mbit/s, then the time to detect the
difference between our sequence and the ideal Bernoulli sequence will be:</p>
      <p>1.0e33/60000000/3600/24/366=5e18 years.</p>
      <p>It looks like the result is more than sufficient.</p>
      <p>Even for m = 8 and d&lt;5%, we get an interval estimate of ε = 4e–11, for which we calculate
n = 1e22 and 1.0e22/60000000/3600/24/366 = 5.2 million years.</p>
    </sec>
    <sec id="sec-7">
      <title>7. The generator block diagram</title>
      <p>So, our proposed entropy source consists of a noise generator in the form of a resistor with an
amplifier and an ADC, part of bits of which are delayed for a different number of cycles and
modulo 2 added, forming an output sequence of random bits, as is shown in Fig. 10. This is enough,
no additional or other elements are required for the entropy source, they will be superfluous.</p>
    </sec>
    <sec id="sec-8">
      <title>Conclusions</title>
      <p>We have built a block diagram of an entropy source with characteristics close to the ideal ones.
Such a source can become the basis of a truly random bit generator, close to an ideal one.</p>
      <p>To complete the generator, it is necessary to add power nodes (the power supply of the noise
generator must be especially stable (filtered), or without fluctuations; power node control circuits; a
noise source quality control node; nodes implementing tests for switching on, initialization,
periodic and on-demand operator tests, continuous tests of primary sequences, tests of the output
random sequence; nodes for blocking the generator operation in the case of violation of the
conditions for its correct functioning; a controller for exchange with the computer (technician). It is
also necessary to implement electrical and mechanical requirements for preventing external
electromagnetic interference and other possible adverse effects on the generator.</p>
      <p>In addition, the generator must be equipped with drivers, a library of application programming
interface functions for creating applications, and test software.</p>
      <p>Then it will be a fully-fledged non-deterministic generator of truly random bit sequences. These
sequences can be used for spread-spectrum techniques in modern robust electronic communication
links and cryptographic applications as well.
While preparing this work, the authors used the AI programs Grammarly Pro to correct text
grammar and Strike Plagiarism to search for possible plagiarism. After using this tool, the authors
reviewed and edited the content as needed and took full responsibility for the publication’s content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D</given-names>
            <surname>.</surname>
          </string-name>
           C. 
          <string-name>
            <surname>Schleher</surname>
          </string-name>
          ,
          <article-title>Electronic warfare in the information age</article-title>
          , Artech House, Inc.,
          <string-name>
            <surname>Norwood</surname>
          </string-name>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Electronic</surname>
            <given-names>warfare</given-names>
          </string-name>
          :
          <source>Handbook</source>
          <year>2008</year>
          , Ed. Peter Donaldson, The Shephard Press Ltd, Berkshire, UK,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname> </surname>
          </string-name>
          <article-title>A. Poisel, Introduction to communication electronic warfare systems, Artech House Inc</article-title>
          ., Norwood, MA,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>V.</given-names>
             
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
             
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
           
          <article-title>Platonenko, Jump-stay jamming attack on Wi-Fi systems</article-title>
          ,
          <source>in: IEEE 18th International Conference on Computer Science and Information Technologies</source>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          . doi:
          <volume>10</volume>
          .1109/CSIT61576.
          <year>2023</year>
          .10324031
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
             
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
             
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
           
          <article-title>Astapenya, Bluetooth low-energy beacon resistance to jamming attack</article-title>
          ,
          <source>in: IEEE 13th International Conference on Electronics and Information Technologies</source>
          (
          <year>2023</year>
          )
          <fpage>270</fpage>
          -
          <lpage>274</lpage>
          . doi:
          <volume>10</volume>
          .1109/ELIT61488.
          <year>2023</year>
          .10310815
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>O.</given-names>
             
            <surname>Pliushch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
             
            <surname>Zhurakovskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
             
            <surname>Kyryk</surname>
          </string-name>
          ,
          <article-title>Adaptive algorithm for four-element antenna array for GNSS</article-title>
          ,
          <source>in: IEEE 17th Int. Conf. on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering</source>
          ,
          <year>2024</year>
          ,
          <fpage>564</fpage>
          -
          <lpage>569</lpage>
          . doi:
          <volume>10</volume>
          .1109/TCSET64720.
          <year>2024</year>
          .10755781
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
             
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
             
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
           
          <article-title>Astapenya, Wi-Fi interference resistance to jamming attack</article-title>
          ,
          <source>in: IEEE 5th International Conference on Advanced Information and Communication Technologies</source>
          (
          <year>2023</year>
          )
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          . doi:
          <volume>10</volume>
          .1109/AICT61584.
          <year>2023</year>
          .10452687
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V.</given-names>
             
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
             
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
           
          <article-title>Korshun, ZigBee network resistance to jamming attacks</article-title>
          ,
          <source>in: IEEE 6th International Conference on Information and Telecommunication Technologies and Radio Electronics</source>
          (
          <year>2023</year>
          )
          <fpage>161</fpage>
          -
          <lpage>165</lpage>
          . doi:
          <volume>10</volume>
          .1109/UkrMiCo61577.
          <year>2023</year>
          .10380360
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>A.</surname>
          </string-name>
           J. Viterbi,
          <string-name>
            <surname>CDMA</surname>
          </string-name>
          :
          <article-title>Principles of spread spectrum communication</article-title>
          , Addison-Wesley Publishing Company, Reading, Massachusetts,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
             A. 
            <surname>Abu-Rgheff</surname>
          </string-name>
          ,
          <article-title>Introduction to CDMA wireless communications</article-title>
          ,
          <source>Elsevier Ltd</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>F.</given-names>
             
            <surname>Ouyang</surname>
          </string-name>
          ,
          <article-title>Digital communication for practicing engineers</article-title>
          , John Wiley &amp; Sons, Ltd.,
          <string-name>
            <surname>Hoboken</surname>
          </string-name>
          , New Jersey,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname> Baumslag</surname>
          </string-name>
          , et al.,
          <article-title>A course in mathematical cryptography</article-title>
          , Walter de Gruyter GmbH, Berlin,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>K.</given-names>
             
            <surname>Wesołowski</surname>
          </string-name>
          ,
          <article-title>Introduction to digital communication systems</article-title>
          , John Wiley &amp; Sons, Ltd.,
          <string-name>
            <surname>West</surname>
            <given-names>Sussex</given-names>
          </string-name>
          , United Kingdom,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>K.</given-names>
             
            <surname>Fazel</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
           
          <article-title>Kaiser, Multi-carrier and spread spectrum systems: From OFDM and MC-CDMA to LTE and WiMAX</article-title>
          , John Wiley and Sons, Ltd, Chichester, United Kingdom,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>L.</given-names>
             
            <surname>Hanzo</surname>
          </string-name>
          , T. Keller, OFDM and
          <string-name>
            <surname>MC-CDMA</surname>
          </string-name>
          :
          <article-title>A primer</article-title>
          , John Wiley &amp; Sons, Chichester,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>D.</surname>
          </string-name>
           Torrieri,
          <article-title>Principles of spread-spectrum communication systems</article-title>
          , Springer, Switzerland,
          <year>2022</year>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -75343-6
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>O.</given-names>
             
            <surname>Pliushch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
             
            <surname>Zhurakovskiy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
             
            <surname>Klymash</surname>
          </string-name>
          ,
          <article-title>Robust control channel of unmanned aerial vehicle</article-title>
          ,
          <source>in: IEEE 5th International Conference on Advanced Information and Communication Technologies (AICT)</source>
          ,
          <year>2023</year>
          ,
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          . doi:
          <volume>10</volume>
          .1109/AICT61584.
          <year>2023</year>
          .10452677
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>O.</given-names>
             
            <surname>Pliushch</surname>
          </string-name>
          , et al.,
          <source>Performance Study of Spread Spectrum Systems with Hard Limiters, Int. J. Comput. Netw. Inf. Secur</source>
          .
          <volume>5</volume>
          (
          <issue>2020</issue>
          )
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          . doi:
          <volume>10</volume>
          .5815/ijcnis.
          <year>2020</year>
          .
          <volume>05</volume>
          .01
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>V.</given-names>
             
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
             
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
             
            <surname>Mazur</surname>
          </string-name>
          ,
          <article-title>Wi-Fi repeater influence on wireless access</article-title>
          ,
          <source>in: IEEE 5th International Conference on Advanced Information and Communication Technologies</source>
          (
          <year>2023</year>
          )
          <fpage>33</fpage>
          -
          <lpage>36</lpage>
          . doi:
          <volume>10</volume>
          .1109/AICT61584.
          <year>2023</year>
          .10452421
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>V.</given-names>
             
            <surname>Girardin</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
           Limnios, Applied probability:
          <article-title>From random experiments to random sequences</article-title>
          and statistics, Springer, Switzerland,
          <year>2022</year>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -97963-8
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>