<!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>New Technique for Hiding Data Using Adaptively Generated Pseudorandom Sequences</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>V. N. Karazin Kharkiv National University</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Svobody sq.</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kharkiv</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ukraine kuznetsov@karazin.ua</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>dianakovalhyk@ukr.net</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Central Ukrainian National Technical University</institution>
          ,
          <addr-line>avenue University, 8, Kropivnitskiy, 25006</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This article explores the steganographic techniques of hiding information using direct spectrum expansion technology. Using noise-like pseudorandom sequences (discrete signals), it is possible to reliably hide information messages in redundant digital data (cover files), for example, images, video and audio files, etc. However, the correlation of discrete signals and cover files can be a problem; the extracted information messages can cover a lot of the number of errors. Our experiments (on still images) show that the error rate in the reconstructed information messages is very high. We offer a new technique when the statistical properties of covers are taken into account when generating discrete signals. In this case, it is possible to significantly reduce the error rate without introducing additional distortion in-to the cover.</p>
      </abstract>
      <kwd-group>
        <kwd>pseudorandom sequence</kwd>
        <kwd>hidden information</kwd>
        <kwd>direct spectrum spread technology</kwd>
        <kwd>steganography</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Direct spread spectrum technology has traditionally been used in code division
multiple access radio communication systems (CDMA). These techniques are used for a
variety of reasons, including the establishment of secure communications, increasing
resistance to natural interference, noise, and jamming, to prevent detection, to limit
power flux density (e.g., in satellite down links), and to enable multiple-access
communications [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ].
      </p>
      <p>The technology of direct spectrum expansion uses discrete noise-like sequences
(discrete signals) to expand a usually narrowband information signal over a relatively
wideband (radio) frequency range. The receiver correlates received signals to extract
the original information signal.</p>
      <p>
        Thus, the basic principle of direct spectrum spreading is the use of noise-like
carriers and the bandwidth is much wider than that required for simple point-to-point
communication with the same data rate. This allows you to get significant advantages
in the organization of communication, for example [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ]:
Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
 Resistance to jamming (interference). High resistance to narrowband interference
      </p>
      <p>is provided;
 Resistance to eavesdropping. The selection of a particular pseudo-random
sequence can be saved as a secret key. In this case, it is very difficult to find the right
key and eavesdrop on the negotiations. In addition, when using very long
pseudorandom sequences, it is possible to arrange communication at very low signal to
noise ratios, which does not even allow the secret transmission of information to be
detected;
 Resistance to fading. The expansion of the frequency band leads to an increase in
the quality of communication, even in conditions of fading (attenuation) of the
signal;
 Multiple access capability. A large number of sequences allows to increase the
subscriber capacity of the communication system, i.e. after all, makes
communication much cheaper.</p>
      <p>Direct spectrum spreading technology can also be used for steganographic
purposes, i.e. to hide information messages in redundant digital data (cover files), for
example, in images, video and audio files, etc. Moreover, cover files are interpreted as
noise in communication channels, and the number of different discrete signals
determines the channel capacity of the steganosystem (similar to multiple access to
CDMA).</p>
      <p>This article explores the steganographic techniques of hiding information using
direct spectrum expansion technology. We offer a new technique when the statistical
properties of cover files are taken into account when generating discrete signals. This
allows you to significantly improve individual performance indicators of the
steganosystem. In particular, we manage to significantly reduce the bit error rate in the
extracted informational messages.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Literature review</title>
      <p>
        In the first works [
        <xref ref-type="bibr" rid="ref4 ref5 ref6 ref7">4-7</xref>
        ] on steganographic systems based on direct spectrum
expansion, the fundamental possibility of hiding data in various cover files was shown, the
main advantages of using pseudorandom sequences, as well as some dependences of
the error rate in the restored messages and cover file distortions are shown.
Subsequently, many techniques were finalized and improved. In particular, in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], combined
methods combining error correction, random positioning in pixels of a cover image,
and direct-sequence spread spectrum (DSSS) spectrum expansion were investigated.
In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], concealment is implemented in the frequency domain, i.e. spreading
modulation was applied to discrete cosine transform (DCT) coefficients. In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], the
implementation of the steganosystem was supplemented by several levels of security,
including cryptographic transformations. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], aspects of the practical
implementation of steganosystems when hiding information in audio files by the method of direct
spectrum expansion are considered. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], steganoanalysis methods using video files
and direct spectral expansion methods were studied. The work [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] is devoted to the
use of steganographic security techniques for transmitting medical images and
electronic medical records in teleradiology. Article [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] is devoted to a theoretical
panalysis of the safety of steganosystems based on direct sequence spreading of the
spectrum.
      </p>
      <p>
        Thus, methods of direct expansion of the spectrum are used to conceal data in
various multimedia files (images, video, audio, etc.). Moreover, transformations can be
used both in the spatial domain [
        <xref ref-type="bibr" rid="ref4 ref5 ref6 ref7">4-7</xref>
        ] and in the field of orthogonal transformations,
for example, in DCT [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. At the same time, the main problem of using DSSS in
steganography is the high level of errors in the restored messages.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Purpose and objectives of the article</title>
      <p>The main goal of this work is to introduce a new technique for hiding informational
messages in cover files using direct spectrum expansion and adaptively generated
pseudorandom sequences. We propose a new approach consisting in the formation of
noise-like sequences taking into account the statistical properties of cover files. The
task is to ensure that each sequence does not correlate with the cover file used. This
can significantly reduce the bit error rate in the extracted informational messages. Our
experiments clearly confirm this.</p>
      <p>
        The article is organized as follows. First, we briefly present the known information
on the use of direct spectrum spreading technology in steganography (we use basic
information from several articles and US patents), and also show that the practical
failure to fulfill certain theoretical assumptions will lead to the guaranteed occurrence
of errors in the restored information data. Our experiments on still images clearly
demonstrate this, and the error rate remains very high even with amplification of the
spreading signal and with a small number of hidden data. We also show examples of
specific images of covers, as well as an assessment of their distortions at various
parameters of the steganosystem. Finally, we propose a new technique for hiding
information, which is based on the obligatory fulfillment of the theoretical assumption
about the uncorrelatedness of extension sequences and cover files. The experiments
presented in the article show that in practical implementation it is really possible to
significantly reduce the bit error rate. Preliminary results were abridged at the
conference [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Hiding data in images using direct spread spectrum technology</title>
      <p>
        As a prototype of an improved method of hiding data in cover images, the technique
proposed in the dissertation by L. Marvel was selected, described in detail and studied
in [
        <xref ref-type="bibr" rid="ref16 ref17 ref6 ref7">6, 7, 16, 17</xref>
        ]. Let's consider it in more detail.
      </p>
      <p>
        The method of concealing data using the direct spread spectrum, proposed in US
patent [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], based on the fact that (on the transmission side after encryption and noise
immunity coding) separate blocks mi  mi0 , mi1 ,..., mik1  , i  0,..., N 1 of data of
information message m  m0 , m1,..., mN 1  the blocks are modulated by noise-like
discrete signals with the help of appropriate devices i  i0 ,i1 ,...,in1  ,
i    0 , 1,..., M 1 , k  M , with a base B  TF , where T is the duration
of the signal element i j , F is the frequency band of the signal i . Since
result, a modulated information signal block is generated for each
block
m *ij  11,,mmiijj  10;;
which, according to statistical properties, takes the form of a random (noise-like)
sequence
      </p>
      <p> k 1 k 1 k 1 
Ei    m *ij  j0 ,  m *ij  j1 ,...,  m *ij  jn1  ,</p>
      <p> j0 j0 j0 
and due to the large base of discrete signals, the frequency spectrum is spreaded by
B  n times.</p>
      <p>The resulting modulated message Ei is supplied to an alternationing device on
which the elements of Ei are mixed with the corresponding rule f by means of a
secret key K1 . The obtained data Ei  f (Ei , K1) з using the appropriate device is
added to the data of the image Ci (digital image data in the spatial domain)
according to the rule: Si  Ci  Ei  G , where G  0 is the gain of the expansion
signal, which sets the "power" of the hidden blocks of information messages.</p>
      <p>The obtained data Si is supplied to the quantization device, which performs a
certain transformation to store the primary dynamic range of the cover image,
resulting in the formation of separate blocks of the steganogram Si and the cover
S  S0  S1  ...  SN 1 , which is transmitted to the receiving side.</p>
      <p>On the receiving side, the resulting steganogram blocks Si after filtration, are,
supplied to a reverse interleaving device, on which the elements of the filtered blocks
Since Si  Ci  Ei  G we have:
1 n1</p>
      <p> S *iz  jz  G 
n z0
1 n1
 E </p>
      <p>iz jz 
n z0
1 n1
C </p>
      <p>iz jz
n z0</p>
      <p>Suppose that the data block of the image block Ci has a random statistical
structure, that is, suppose that the second term on the right side of expression (2) is
close to zero and can be ignored. Then we have:</p>
      <p>k1
  S *i ,  j   G  m *iu  u ,  j .</p>
      <p>u0
of the stegogram Si are mixed by rule f 1 , which is an inverse rule of alternation f
on the transmitting side. The extraction of blocks of information data is carried out
using a correlation receiver, which calculates the value of the correlation coefficient
obtained after the reverse alternation of data S *i  f 1(Si , K1) and corresponding
discrete  j , signals identical to those used on the transmitting side:
  S *i ,  j  
1 n1</p>
      <p> S *iz  jz .
n z0
(2)
(3)
(4)
(5)</p>
      <p>Since all sequences of the set  are formed by a pseudorandom sequence
generator initiated by a secret key K2 , the corresponding discrete signals are weakly
correlated, that is, at u  j we have  u ,  j   0 .</p>
      <p>According to this, all terms, except case u  j , in the right-hand side of equation
(3) can be ignored. Where do we have:</p>
      <p>1 n1 2 G;
  S *i ,  j   G  m *ij  n z0  jz   G  m *ij  G.</p>
      <p>The corresponding value of the seized data is taken with a threshold device
according to the calculated correlation coefficient.</p>
      <p>Since G  0 and n  0 of   S *i ,  j  character in (4) depends only on m *ij ,
from where we have:
1,   Si ,  j   0;
m *ij  sign   S *i ,  j   1,   Si ,  j   0.</p>
      <p>If   S *i ,  j   0 in (5) we will assume that the hidden information has been lost
(erased). Separate blocks of data are formed from the extracted data on the receiving
side
mi  mi0 , mi1 ,..., mik1  ,
i  0,..., N 1
of
information
messages
m  m0 , m1,..., mN 1 , where mij  10,, mm**iijj  11;; of which information messages
are generated after noise immunity decoding and decryption of the extracted data.</p>
      <p>The secret key K2 sets the rule for the formation of pseudorandom sequences
i  i0 ,i1 ,...,in1  , which are formed by the corresponding generator and are used
as noise-like discrete signals i    0 , 1,..., M 1 from the ensemble (set)
 of power M .</p>
      <p>The encryption and decryption rule on the transmitting and receiving side is
initiated by the secret key K3 .</p>
      <p>The use of encryption and alternation devices in the process of hiding and
retrieving data can improve the statistical properties of the modulated message Ei , ie
to bring it closer to a random sequence. The use of noise immunity coding devices
can improve the reliability of the transmission of information messages
m  m0 , m1,..., mN 1  during steganographic conversions.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Experimental researches</title>
      <p>The disadvantage of the prototype under consideration is that in the process of
steganographic hiding, the statistical properties of the blocks of the image Ci , are not
taken into account, that is, the digital image data can be correlated with the applied
discrete signals, which will lead to an error when extracting information data on the
receiving side.</p>
      <p>So, for example, if the correlation coefficient of the i -th block Ci of the image
will be higher behind the module and opposite in value of sign G  m *ij , that is, when
the second summand in the right part of expression (2) will be higher in module and
opposite in value of sign of the first summand (and the condition of mutual
orthogonality of applied discrete signals will be fulfilled), it is guaranteed that an
error will the result at data extract according to rule (5). In practice, as our researches
have shown, such cases occur very often. This is due to the fact that the digital data of
real images used to hide information messages do not have a random statistical
structure, that is, the applied assumption in the transition from formula (2) to formula
(3) is not fulfilled in practice and is false. Typically, steganographic hiding uses
realistic images and the corresponding digital data is not a random process, and even
in its statistical properties are not similar to pseudorandom sequences. The
corresponding values of the correlation coefficient  Сi ,  j  
1 n1
C </p>
      <p>
        iz jz  0 , and
n z0
can take large amplitude (  Сi ,  j   1 ) and random values. In this case, it is
possible to increase the reliability of the extracted data only by applying low-speed
noise immunity codes (as in the prototype discussed above [
        <xref ref-type="bibr" rid="ref16 ref17 ref6 ref7">6, 7, 16, 17</xref>
        ]), which
leads to a decrease in the relative transmission rate of information, or an increase in
the gain G , which leads to an increase in the introduced errors.
      </p>
      <p>To confirm this fact, Fig. 1 shows the empirical estimates of BER dependence in
message recovery using the considered prototype method (interrupted line). The
G  4 gain was applied, and the number of bits k , hidden in one block Ci of the
cover image varied from 1 to 255. Fig. 2. shows empirical estimations of dependence
of the average proportion of introduced errors (in relation to the dynamic range of 256
levels) in the cover image with respect to the number of bits embedded in one element
of the cover. From the given dependencies (Fig. 1, 2, interrupted line) it is visible, that
at entering errors in the cover image below a visual threshold of human sensitivity
(23%) it is possible to hide no more than 10 bits of data in one block of the image Ci .
But even with such an insignificant amount of hidden data, BER takes the value
0.05..0.25, which requires the use of low-speed noise immunity codes with the
permission to correct multiple errors.</p>
      <p>In Fig. 3, 4 show, accordingly, the obtained empirical estimates of the BER
dependence when restoring the messages and the dependence of the average fraction
of the input errors on the G gain values using the considered prototype method
(intermittent lines). At the same time, k  4 bits of information data were embedded
in one block Ci of the cover, and the gain G changed from 1 to 8. From the given
dependencies (Fig. 3, 4, interrupted line) it is visible, that at value of gain G  6
hiding of the information data leads to entering of errors, part of which ( relative to a
dynamic range ) is above a visual threshold of human sensitivity (2-3 %). That is, the
fact of hiding data in the image turns out to be a visual observation and
steganographic hiding with these parameters is not reasonable But at G  6 gain
value, there is a large number of errors when extracting individual data bits from the
spatial area of the image corresponding to BER  0, 2 .</p>
      <p>In Fig. 5-7 shows examples of images used in research:
 Fig. 5 – original image;
 Fig. 6 – image with hidden messages using prototype method;
 Fig. 7 – image with hidden messages using the proposed method.</p>
      <p>Data hiding is done with the following parameters: G  4 , k  4 .</p>
    </sec>
    <sec id="sec-6">
      <title>Proposed data hiding technique</title>
      <p>Our task is based on the following: by taking into account the statistical properties of
cover Ci , significantly reduce the BER of hidden data. Indeed, the introduction of
additional constraints on the correlation coefficient of the discrete signals used and
individual fragments of the image can significantly reduce the number of errors when
recovering the message on the receiving side.</p>
      <p>This problem is solved due to the special (we call adaptive) formation of
pseudorandom sequences  j   j0 , j1 ,..., jn1  , taking into account the statistical
properties of these blocks of cover Сi . That is, the value of the correlation coefficient
 Сi ,  j  for all i  0,.., N 1 and for all j  0,.., M 1 by the module should not
exceed some predetermined value  max (value of the set threshold):
 Сi ,  j  
1 n1
C </p>
      <p>iz jz  max .
n z0
(6)</p>
      <p>Thus, the formation of  j    0 , 1,..., M 1 sequences is performed by a
pseudo-random rule, which is initiated by the secret key K2 , and taking into account
conditions (6) for all i  0,.., N 1 and all j  0,.., M 1.</p>
      <p>In this formation of discrete signals, each sequence of the set of
  0 , 1,..., M 1 will not be correlated (up to the set limit) with any block of
the cover image, and, accordingly, the correlation coefficient of the i -th block Ci of
the cover on the module will never be higher than the module and the opposite in sign
 max . In accordance with this (and when the conditions of mutual orthogonality of
the applied discrete signals) the second term in the right part of expression (2) may
exceed in module and be opposite in sign to the first term only when
G  m *ij  max . It is in this case that an error of data extraction will happen, but the
probability of such an event will be much less than in case of an error of data
extraction in the prototype method. If the value of the  max threshold is lower than
the G gain value, i.e. when the unequal is performed G  m *ij  max the error will
not occur at all, i.e. an unmistakable transfer of secret information will be achieved.</p>
      <p>In Figs. 1-6, solid lines show empirical estimates of the probability properties of
steganographic concealment using the proposed method, which confirms our
conclusion:
 in Fig. 1 shows the bit error rate in the recovered messages depending on the size
of the message;
 in Fig. 2 shows the proportion of distortion introduced into the cover image
depending on the size of the message;
 in Fig. 3 shows bit error rate in the recovered messages depending on the gain
factor;
 in Fig. 4 shows the proportion of distortion introduced into the cover image
depending on the gain factor.</p>
    </sec>
    <sec id="sec-7">
      <title>Discussion of the results</title>
      <p>From the above dependencies in Fig. 1, 2 (solid line) shows that when making errors
in the cover image lower than the visual threshold of human sensitivity (2-3%)
manages to embed no more than 10 bits of data in one block of the C coniner (as in
the prototype method). But with so a number of hidden data, the BER value is much
less than 0.1 and several dozen times less than in the prototype method.</p>
      <p>From the given dependencies in the fig. 3, 4 (solid line) can be seen that at the
value of gain hiding information data in the cover image leads to the introduction of
errors whose fate (in relation to the dynamic range) is higher than the visual threshold
of human sensitivity (2-3%) as well as in the method prototype. At G  6 values, the
errors introduced into the cover image are lower than the human visual sensitivity
threshold, i.e. they are invisible. In compared with the method-prototype, there is a
significant reduction in the number of errors when extracting individual data bits from
the spatial area of the image. In addition, at the H gain value, there is a total non
occurrence of errors in remote data, which confirms the above conclusion about the
error-free transmission of hidden information. Indeed, if G  4 then the inequality is
being realized G  m *ij  max , that is, assuming the validity of the mutual
orthogonality of the applied discrete error signals, no errors occur at all and an
errorfree transmission of hidden information is achieved.</p>
      <p>From the given dependencies in the fig. 5, 6 (solid line) shows that in almost all
cases, when hiding data the proposed method is a gain in relation to the
methodprototype (interrupted line). Thus, when the number of k bits hidden in one element
of the cover image increases, as well as in the prototype method, there is an increase
in the probability of false data extracted on the receiving side. However, this increase
is much slower than in the prototype method. As the G gain increases, the probability
of false data extraction decreases, but the proposed method (solid line) has
significantly improved probabilistic properties than the prototype method (interrupted
line).
8</p>
    </sec>
    <sec id="sec-8">
      <title>Conclusions</title>
      <p>Spread spectrum technologies are traditionally used in multiple access radio
communication systems. Direct-sequence modulation makes the transmitted signal wider in
bandwidth than the information signal. The resulting transmitted signal resembles
white noise limited in bandwidth. This noiselike signal is used to accurately restore
the source data on the host side by multiplying it by the same expansion sequence.
This process is mathematically a correlation, i.e. on the receiving side the recovery of
information data is performed by calculating the correlation coefficient of the
accepted sequence and the spreading sequence.</p>
      <p>Application of the technology of direct spread-spectrum in radio communication
systems allows obtaining specific advantages: resistance to jamming (interference);
resistance to eavesdropping; resistance to fading; multiple access capabilities. Some
radiocommunication industry standards take advantage of these advantages. However,
this technology can also be successfully applied in steganography. Excess data
(images, audio and video files, text documents, etc.) are interpreted as noise in a
communication channel. The task is to hide information data in such a way that redundant data
(cover files) are not distorted, i.e., photo or video images are visually
indistinguishable from the original data. The technology of direct spread-spectrum is suitable for
this very well.</p>
      <p>The main theoretical assumption that explains the operation of this technology is
the uncorrelation of the spreading sequence and noise in the communication channel.
In radio communications systems with white noise, this assumption is fulfilled and
there are few errors on the receiving side. In steganographic systems, however, this
assumption may not work. Noise is understood here to be excess digital data, for
example, it can be realistic images. And such cover files can strongly correlate with the
spreading sequence. As a result of the correlation reception, a large number of errors
occur when restoring information messages. We offer an effective way to reduce such
errors. In fact, we offer a new way to form spreading sequences that takes into
account the statistical properties of cover files. We call this method adaptive. As a
result, we have a set of spreading sequences that do not correlate with cover files and
almost no errors occur when restoring information messages. Experiments show that
this is indeed the case. Our approach is much more efficient. Thus, a specific
technical result is achieved, namely: by taking into account the statistical properties of the
digital data of the cover images (in the adaptive formation of pseudorandom
sequences) it is possible to significantly reduce the number of errors in the recovery of
information data on the receiving side.</p>
      <p>
        A promising trend is to study the properties of steganosystems using complex
discrete signals with special correlation properties. For example, we want to use
sequences from our previous work [
        <xref ref-type="bibr" rid="ref18 ref19">18-19</xref>
        ] to hide information in cover images.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Torrieri</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Principles of Spread-Spectrum Communication Systems</article-title>
          . Springer International Publishing (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>S.-M.M.</given-names>
          </string-name>
          :
          <source>Modern Digital Radio Communication Signals and Systems</source>
          . Springer International Publishing (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. CDMA. TelecomSpace, (
          <year>2020</year>
          ). http://www.telecomspace.com/cdma.html
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>A. Z.</given-names>
            <surname>Tirkel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. F.</given-names>
            <surname>Osborne</surname>
          </string-name>
          and
          <string-name>
            <surname>R. G. Van Schyndel</surname>
          </string-name>
          ,
          <article-title>"Image watermarking-a spread spectrum application,"</article-title>
          <source>Proceedings of ISSSTA'95 International Symposium on Spread Spectrum Techniques and Applications</source>
          , Mainz, Germany,
          <year>1996</year>
          , pp.
          <fpage>785</fpage>
          -
          <lpage>789</lpage>
          vol.
          <volume>2</volume>
          . doi:
          <volume>10</volume>
          .1109/ISSSTA.
          <year>1996</year>
          .
          <volume>563231</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>J. R.</given-names>
            <surname>Smith</surname>
          </string-name>
          and
          <string-name>
            <given-names>B. O.</given-names>
            <surname>Comiskey</surname>
          </string-name>
          , “
          <article-title>Modulation and information hiding in images</article-title>
          ,
          <source>” Lecture Notes in Computer Science</source>
          , pp.
          <fpage>207</fpage>
          -
          <lpage>226</lpage>
          ,
          <year>1996</year>
          . doi:
          <volume>10</volume>
          .1007/3-540-61996-8_
          <fpage>42</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Marvel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. G.</given-names>
            <surname>Boncelet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jr.</surname>
          </string-name>
          , and
          <string-name>
            <surname>Charles</surname>
            <given-names>T.</given-names>
          </string-name>
          ,
          <article-title>“Methodology of Spread-Spectrum Image Steganography</article-title>
          ,” Jun.
          <year>1998</year>
          . doi:
          <volume>10</volume>
          .21236/ada349102.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Marvel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. G.</given-names>
            <surname>Boncelet</surname>
          </string-name>
          and
          <string-name>
            <given-names>C. T.</given-names>
            <surname>Retter</surname>
          </string-name>
          ,
          <article-title>"Spread spectrum image steganography,"</article-title>
          <source>in IEEE Transactions on Image Processing</source>
          , vol.
          <volume>8</volume>
          , no.
          <issue>8</issue>
          , pp.
          <fpage>1075</fpage>
          -
          <lpage>1083</lpage>
          , Aug.
          <year>1999</year>
          . doi:
          <volume>10</volume>
          .1109/83.777088.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Youail</surname>
            ,
            <given-names>R.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Samawi</surname>
            ,
            <given-names>V.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kadhim</surname>
          </string-name>
          , A.
          <string-name>
            <surname>-K.A.-R.:</surname>
          </string-name>
          <article-title>Combining a spread spectrum technique with error-correction code to design an immune stegosystem</article-title>
          .
          <source>In: Security and Identification 2008 2nd International Conference on Anti-counterfeiting</source>
          . pp.
          <fpage>245</fpage>
          -
          <lpage>248</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Agrawal</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>DCT Domain Message Embedding in Spread-Spectrum Steganography System</article-title>
          .
          <source>In: 2009 Data Compression Conference</source>
          . pp.
          <fpage>433</fpage>
          -
          <lpage>433</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Nugraha</surname>
            ,
            <given-names>R.M.:</given-names>
          </string-name>
          <article-title>Implementation of Direct Sequence Spread Spectrum steganography on audio data</article-title>
          .
          <source>In: Proceedings of the 2011 International Conference on Electrical Engineering and Informatics</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Yadav</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dutta</surname>
          </string-name>
          , M.:
          <article-title>3-Level security based spread spectrum image steganography with enhanced peak signal to noise ratio</article-title>
          .
          <source>In: 2017 Fourth International Conference on Image Information Processing (ICIIP)</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Zarmehi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Akhaee</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          :
          <article-title>Video steganalysis of multiplicative spread spectrum steganography</article-title>
          .
          <source>In: 2014 22nd European Signal Processing Conference (EUSIPCO)</source>
          . pp.
          <fpage>2440</fpage>
          -
          <lpage>2444</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Eze</surname>
            ,
            <given-names>P.U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parampalli</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Evans</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Spread Spectrum Steganographic Capacity Improvement for Medical Image Security in Teleradiology*</article-title>
          .
          <source>In: 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.-G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kwong</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shi</surname>
            ,
            <given-names>Y.-Q.</given-names>
          </string-name>
          :
          <article-title>A Study on the Security Levels of SpreadSpectrum Embedding Schemes in the WOA Framework</article-title>
          .
          <source>IEEE Transactions on Cybernetics</source>
          .
          <volume>48</volume>
          ,
          <fpage>2307</fpage>
          -
          <lpage>2320</lpage>
          (
          <year>2018</year>
          ). https://doi.org/10.1109/TCYB.
          <year>2017</year>
          .2735989
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smirnov</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Onikiychuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Makushenko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Anisimova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Arischenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Adaptive Pseudo-Random Sequence Generation for Spread Spectrum Image Steganography</article-title>
          .
          <source>In: 2020 IEEE 11th International Conference on Dependable Systems, Services and Technologies (DESSERT)</source>
          . pp.
          <fpage>161</fpage>
          -
          <lpage>165</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>F. S.</given-names>
            <surname>Brundick</surname>
          </string-name>
          and
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Marvel</surname>
          </string-name>
          , “Implementation of Spread Spectrum Image Steganography,” Mar.
          <year>2001</year>
          . doi:
          <volume>10</volume>
          .21236/ada392155.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. Patent No.
          <source>: US 6</source>
          ,
          <issue>557</issue>
          ,103 B1, Int.
          <source>Cl. G06F</source>
          <volume>11</volume>
          /30. Charles G. Boncelet, Jr.,
          <string-name>
            <surname>Lisa</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Marvel</surname>
          </string-name>
          , Charles T. Retter.
          <article-title>Spread Spectrum Image Steganography</article-title>
          . Patent No.
          <source>: US 6</source>
          ,
          <issue>557</issue>
          ,103 B1, Int.
          <source>Cl. G06F</source>
          <volume>11</volume>
          /30. - №
          <volume>09</volume>
          /257,136;
          <string-name>
            <given-names>Filed</given-names>
            <surname>Feb</surname>
          </string-name>
          .
          <volume>11</volume>
          ,
          <year>1999</year>
          ; Date of Patent Apr.
          <volume>29</volume>
          ,
          <year>2003</year>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>A.</given-names>
            <surname>Kuznetsov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kavun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Panchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Prokopovych-Tkachenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kurinniy</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.</given-names>
            <surname>Shoiko</surname>
          </string-name>
          ,
          <article-title>"Periodic Properties of Cryptographically Strong Pseudorandom Sequences," 2018 International Scientific-Practical Conference Problems of Infocommunications</article-title>
          . Science and
          <string-name>
            <surname>Technology (PIC S&amp;T)</surname>
          </string-name>
          , Kharkiv, Ukraine,
          <year>2018</year>
          , pp.
          <fpage>129</fpage>
          -
          <lpage>134</lpage>
          . doi:
          <volume>10</volume>
          .1109/INFOCOMMST.
          <year>2018</year>
          .8632021
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>A.</given-names>
            <surname>Kuznetsov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Smirnov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kovalchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Averchev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pastukhov</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Kuznetsova</surname>
          </string-name>
          ,
          <article-title>"Formation of Pseudorandom Sequences with Special Correlation Properties,"</article-title>
          <source>2019 3rd International Conference on Advanced Information and Communications Technologies (AICT)</source>
          , Lviv, Ukraine,
          <year>2019</year>
          , pp.
          <fpage>395</fpage>
          -
          <lpage>399</lpage>
          . doi:
          <volume>10</volume>
          .1109/AIACT.
          <year>2019</year>
          .8847861
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>