<!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>Input:</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.1016/j.sigpro.2010.06.012</article-id>
      <title-group>
        <article-title>Application of Arithmetic Coding Methods in Cryptographic Information Protection Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dmytro Havrylov</string-name>
          <email>havrylov_d@ukr.net</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olexandr Shaigas</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oksana Stetsenko</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yurii Babenko</string-name>
          <email>babenkomahalych@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Valerii Yroshenko</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Kharkiv National University of Radio Electronics</institution>
          ,
          <addr-line>14 Nauky ave., Kharkiv, 61103</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Taras Shevchenko National University of Kyiv</institution>
          ,
          <addr-line>60 Volodymyrska str., Kyiv, 01033</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2011</year>
      </pub-date>
      <volume>00</volume>
      <issue>01</issue>
      <fpage>90</fpage>
      <lpage>97</lpage>
      <abstract>
        <p>The article analyzes recent publications, which indicated the rapid creation of data by different types of media. It is noted that one-fifth of the data created is critical and needs protection. To reduce the amount of data stored, it is recommended to use encoding methods without constructing an encoding table. That is why arithmetic and adaptive arithmetic coding from the point of view of the possibility of application in systems of cryptographic protection of information for systems of critical infrastructure are considered in detail. As a result of research for the guaranteed protection of the information, it is offered to use the technology of consecutive cryptographic protection of the information (after coding) with an application of adaptive arithmetic coding. For systems with streaming data processing (technology of selective protection of information), it is proposed to use arithmetic coding. Under the key information in the arithmetic coding algorithm, we understand the weight of each element, the rest of the information does not require additional protection.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Information security</kwd>
        <kwd>arithmetic coding</kwd>
        <kwd>adaptive arithmetic coding</kwd>
        <kwd>big data</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Despite the active development of technologies and principles of media construction aimed at
increasing the amount of data that can be stored (while reducing the physical volume and weight), the
need for algorithms to reduce the volume is still an urgent problem that needs to be addressed. This
effect persists due to the simultaneous development of data entry technologies. These technologies
include a photo and video cameras from different companies, which allow you to obtain
multidimensional data of high quality (resolution) and depth of image construction, which in turn
significantly increases the amount of information needed for storage and subsequent reproduction on
display media. At the same time, the use of high-tech devices is observed not only at the level of states
or enterprises, but also at the level of personal users, who in turn can provide access and/or cover photos,
videos, etc. on social networks, blogs, cloud storage or own sites. As a result of this feature, the user
initiates requirements for administrators, providers, owners of the above information resources from
the standpoint of resource requirements (storage) and performance (computing power) by closing the
circle “Information resource (storage)—Quality (volume)—Information resource (refuge).” After all,
the market for information services has grown so much that a dissatisfied user (long download time,
insufficient functionality, or even unsatisfactory site design) has the opportunity to easily and quickly
(within a few minutes) change the service provider, which will harm the latter. The multitude of users
united in the organization, the enterprise, the state has led to the emergence of the concept of Big Data.</p>
      <p>Under Big Data we understand work with the information of considerable volume and various on
structural, the semantic structure of the data which is updated every second and is in various sources
(storages) for the purpose of maintenance, an increase of efficiency of work, creation of new products
and increase of competitiveness. The consulting company Forrester gives a brief statement: “Big data
combines techniques and technologies that make sense of the data with maximum practicality.”</p>
    </sec>
    <sec id="sec-2">
      <title>2. Analysis of Existing Research</title>
      <p>According to analysts at IDC [10] and other researchers, in the coming years, the bulk of the data
will be provided not by users but by companies. Industry and other sectors of the economy will account
for up to 60% of all data in the world. For example, in 2015, companies generated a third of all global
data.</p>
      <p>The authors of these studies agree that in the future the quality of data will be much more important
than their quantity. “Not all data is equally important, and without context, they are not useful at all. In
this period of change, leadership will belong to the organizations that will be able to identify the most
critical subgroups of information with the maximum impact on the desired area of activity and focus on
them,” said in a report by IDC analyst.</p>
      <p>The publications also noted that by 2025 the amount of data created in the world will exceed 150
Zettabytes (10²¹ bytes) per year (Fig. 1). At the same time, one-fifth of all data by 2025 will be
considered critical. That is, this is the information on which will depend the lives and safety of people,
the preservation of capital by companies, the reputation of countries, the international situation, world
peace, and the existence of the planet Earth as a whole.</p>
      <p>Z
ettab
ytes</p>
      <p>However, in the coming years, the gap between the amount of data that needs to be protected and
the information actually protected will only grow, increasing the amount of data even more. By 2025,
up to 90% of all information must be protected in one way or another. However, in fact, less than half
of all information will be protected.</p>
      <p>The researchers also note that a significant amount of data will come from the devices that surround
us every day in accordance with the concept of the Internet of Things, so we can conclude that:</p>
      <p>First, by 2025, 75% of the world's population will have permanent access to the Internet. The amount
of data sent to the world by type of media is shown in Fig. 2.</p>
      <p>Secondly, the number of smart gadgets and home robots that will produce so-called metadata—
service information that machines will exchange with each other for coordinated work.</p>
      <p>Compared to today, everyone will interact 20 times more often with the Internet or with devices with
Internet access. If now the average number of interactions is a little more than 1400, then by 2025 we
will face the network more than 4900 times a day (Fig. 3).</p>
      <p>Therefore, looking for ways to solve the problem of storing large amounts of information, it was
found that there are different approaches to solving the problem of reducing the code sequence (data
volume) for processing, storage, and/or transmission of information. Analysis of coding methods based
on the construction of Huffman tables, RLE, Lempel-Ziv, arithmetic coding, and adaptive arithmetic
coding indicated both positive and negative properties of each method. Given that the main criteria for
selecting the algorithm are the ability to reduce the amount of data (without increasing in exceptional
cases) when entering the data processing with the probability of occurrence of elements close to equal
probability and the time of the algorithm. Empirically, using an object-oriented Java programming
language, statistics were collected from about 10,000 objects, which included numbers in binary and
decimal representations, data arrays (matrices, blocks), words and sentences, and selected for more
detailed study of arithmetic coding and adaptive arithmetic coding.</p>
      <p>The purpose of this work is to determine the suitability of arithmetic coding and adaptive arithmetic
coding for use in technologies for cryptographic protection of information in critical infrastructure.</p>
    </sec>
    <sec id="sec-3">
      <title>3. The Main Part of the Research</title>
      <p>The choice of methods based on the principles of arithmetic coding as research is due to the fact that
these methods are exceptional because they do not build code tables, like most coding methods, and in
the case of adaptive arithmetic coding have the ability to current coding. As a result of coding, we get</p>
      <p>coding 0 «1»
«0»</p>
      <p>coding 0
«0» coding 1</p>
      <p>«1»
«0»
«0»
«0»
coding 0
coding 1
coding 1
«0»
coding 1</p>
      <p>
        «1»
«0»
0,2403
coding 0 «1»
«1»
«1»
«1»
«1»
1
0,5
0,33
0,33
0,248
0,248
0,248
0,248
a real number within the interval (
        <xref ref-type="bibr" rid="ref1">0,1</xref>
        ) (the beginning of the working interval; the end of the working
interval), which allows us to unambiguously reproduce the coded sequence.
      </p>
      <p>
        The algorithm of arithmetic coding (Fig. 5) and decoding (Fig. 6) allows finding a discrepancy with
the algorithm of adaptive coding (Fig. 7) and decoding (Fig. 8), which is that the weights of the symbols
coming to the input of the encoder, for arithmetic coding are formed before the coding process and must
be transmitted to the decoder. At the same time, with adaptive arithmetic encoding, the value of the
weights of each symbol is formed in the encoding process, without the need to transmit these service
data to the decoder.
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
0
0
0
0,167
0,167
0,201
0,219
0,232
  =
      </p>
      <p>ℎ −  
 =  + ℎ

 
2
,
,</p>
      <p>The weight of the element is based on the formula:
1.6.
( ),
“1” on the ith step,</p>
      <p>( ) is the weight w on the ith step;</p>
      <p>
        The value of the segment in the ith step is by the formula:
where   is the sum of the weights on the ith step,  
(0) is the weight "0" on the ith step,  
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is the weight
      </p>
      <p>The final step is to find the code number by determining the arithmetic mean between the beginning
and end of the working interval of the last encoded character in the message:
where  is the code number of the message.</p>
      <p>Graphically, the process of adaptive arithmetic coding of the bit sequence “0 0 1 0 1 1 1 0” will take
the form of Fig. 4. As a result, we obtain the coded number 242 = 1 1 0 0 0 with a compression ratio of
xi
where i  1: n;
Yes
Yes
Yes
Yes
[low; high)</p>
      <p>code
zi pi(ib),pi(ic)
zipi(ic) ,pi(ie)</p>
      <p>Decryption
a  00; b  11; c  01; e  10; f  !;
i(a) 0.3; i(b) 0.2; i(c) 0.2; i(e)0.2; i(f)  0.1
xi
code</p>
      <p>Decoder
Decryption</p>
      <p>code
Yes
Yes
Yes
Yes
[low; high)</p>
      <p>The analysis of Fig. 5 and 6 allows us to draw the following conclusions on the possibility of
applying these methods in cryptographic protection systems: due to the importance of the weight values
of the element w in the ith step, we can conclude that this information is key. Removing or replacing the
weight values of the element w in the ith step will make it impossible to correctly reproduce the encoded
sequence. It should be noted that the value of the weight of the element w at each step is equal to:
 1( ) =  2( ) =  3( ) = ⋯ =</p>
      <p>This feature makes it possible to assume that the use of cryptographic data for the values of the
weight of the element w can increase the degree of data security; due to the need to pass to determine
the weight of the element w, the application of the method of arithmetic coding increases the time for
data processing.</p>
      <p>The analysis of Fig. 7 and 8 allows us to draw the following conclusions on the possibility of
applying these methods in cryptographic protection systems:


</p>
      <p>In comparison with the method of arithmetic coding to reduce the time for data processing
during coding due to the lack of a passage to determine the weight of the element w.
In comparison with the method of arithmetic coding, this method usually has a lower
compression ratio.</p>
      <p>Due to the fact that by the end of the processing of coded elements it is impossible to
determine the value of the weight of the element w application of the method of adaptive
arithmetic coding in cryptographic information protection technologies is reduced to
sequential data processing.</p>
      <p>For the general analysis, the estimation of efficiency of to-do methods of arithmetic coding and
adaptive arithmetic coding in the system of cryptographic protection of the information is carried out
(Fig. 9).</p>
      <sec id="sec-3-1">
        <title>Initial volume</title>
      </sec>
      <sec id="sec-3-2">
        <title>Arithmetic coding with information protection</title>
      </sec>
      <sec id="sec-3-3">
        <title>Adaptive arithmetic coding with</title>
        <p>information protection</p>
      </sec>
      <sec id="sec-3-4">
        <title>Compression methods based on the construction of coding tables</title>
        <p>)
а</p>
      </sec>
      <sec id="sec-3-5">
        <title>Arithmetic coding with information protection</title>
      </sec>
      <sec id="sec-3-6">
        <title>Adaptive arithmetic coding with</title>
        <p>information protection</p>
      </sec>
      <sec id="sec-3-7">
        <title>Compression methods based on the construction of coding tables</title>
        <p>)
b</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions</title>
      <p>The paper considers in detail the arithmetic and adaptive arithmetic coding from the standpoint of
the possibility of application in systems of cryptographic protection of information for critical
infrastructure systems.</p>
      <p>Based on this, arithmetic coding methods can be used in cryptographic protection systems to reduce
the original amount of data. Moreover, the analysis indicated that adaptive coding allows obtaining a
higher compression ratio and fewer data processing times than adaptive arithmetic coding. Thus, we
believe that arithmetic coding is a more acceptable solution for use in cryptographic information
security systems compared to adaptive arithmetic coding and compression methods based on the
construction of coding tables.</p>
    </sec>
    <sec id="sec-5">
      <title>5. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ramakrishnan</surname>
          </string-name>
          , et al.,
          <article-title>Cryptographic and Information Security Approaches for Images and Videos</article-title>
          . CRC Press,
          <year>2018</year>
          , 962 p..
          <source>doi: 10</source>
          .1201/9780429435461.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>[2] Announcing the ADVANCED ENCRYPTION STANDARD (AES)</article-title>
          .
          <source>Federal Information Processing Standards Publication</source>
          ,
          <volume>197</volume>
          (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>[3] DSTU</source>
          <volume>7624</volume>
          :
          <year>2014</year>
          :
          <string-name>
            <given-names>Information</given-names>
            <surname>Technology</surname>
          </string-name>
          .
          <article-title>Cryptographic protection of information. Symmetric block transformation algorithm</article-title>
          .
          <source>Order of the Ministry of Economic Development of Ukraine №</source>
          <volume>1484</volume>
          (
          <issue>29</issue>
          .
          <fpage>12</fpage>
          .
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>DSTU</given-names>
            <surname>GOST</surname>
          </string-name>
          <article-title>28147:2009: Information processing system</article-title>
          .
          <source>Cryptographic protection. Cryptographic transformation algorithm GOST 28147-89</source>
          (
          <issue>22</issue>
          .
          <fpage>12</fpage>
          .
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Dufaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ebrahimi</surname>
          </string-name>
          ,
          <article-title>Toward a Secure JPEG</article-title>
          .
          <source>Applications of Digital Image Processing XXIX</source>
          , Vol.
          <volume>6312</volume>
          ,
          <year>2006</year>
          . doi:
          <volume>10</volume>
          .1117/12.686963.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Farajallah</surname>
          </string-name>
          ,
          <article-title>Chaos-based crypto and joint crypto-compression systems for images and videos, 2015</article-title>
          . URL: https://hal.archives-ouvertes.fr/tel-01179610.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Honda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Murakami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yanagihara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kumaki</surname>
          </string-name>
          , T. Fujino,
          <article-title>Hierarchical image-scrambling method with scramble-level controllability for privacy protection</article-title>
          ,
          <source>in: IEEE 56th International Midwest Symposium on Circuits and Systems (MWSCAS)</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>1371</fpage>
          -
          <lpage>1374</lpage>
          . doi:
          <volume>10</volume>
          .1109/MWSCAS.
          <year>2013</year>
          .
          <volume>6674911</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Information</surname>
          </string-name>
          technology
          <article-title>- JPEG 2000 image coding system: Secure JPEG 2000</article-title>
          .
          <article-title>International Standard ISO/IEC 15444-8;</article-title>
          <string-name>
            <surname>ITU-T Recommendation</surname>
          </string-name>
          T.
          <volume>807</volume>
          ,
          <year>2007</year>
          , 108 p.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Sh</surname>
          </string-name>
          .
          <string-name>
            <surname>Ji</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Tong</surname>
            ,
            <given-names>M. Zhang,</given-names>
          </string-name>
          <article-title>Image encryption schemes for JPEG and GIF formats based on 3D baker with compound chaotic sequence generator</article-title>
          ,
          <year>2012</year>
          . URL: https://arxiv.org/abs/1208.0999.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>JPEG</given-names>
            <surname>Privacy</surname>
          </string-name>
          &amp;
          <article-title>Security Abstract</article-title>
          and
          <string-name>
            <given-names>Executive</given-names>
            <surname>Summary</surname>
          </string-name>
          ,
          <year>2015</year>
          . URL: https://jpeg.org/items/ 20150910_privacy_security_summary.html.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Rivest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shamir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. M.</given-names>
            <surname>Adleman</surname>
          </string-name>
          ,
          <article-title>A method for obtaining digital signatures and public-key cryptosystems</article-title>
          .
          <source>Communications of the ACM</source>
          , (
          <volume>2</volume>
          )
          <fpage>21</fpage>
          ,
          <year>1978</year>
          , pp.
          <fpage>120</fpage>
          -
          <lpage>126</lpage>
          . doi:
          <volume>10</volume>
          .1145/359340.359342
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Bollavarapu</surname>
          </string-name>
          ,
          <article-title>Data Security using Compression and Cryptography Techniques</article-title>
          .
          <source>International Journal of Computer Applications</source>
          , Vol.
          <volume>117</volume>
          , No.
          <volume>14</volume>
          ,
          <year>2015</year>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>18</lpage>
          . doi:
          <volume>10</volume>
          .5120/
          <fpage>20621</fpage>
          -
          <lpage>3342</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>V. B.</given-names>
            <surname>Vasiliev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. N.</given-names>
            <surname>Okov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Yu. N.</given-names>
            <surname>Strezhik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Ustinov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. V.</given-names>
            <surname>Shvetsov</surname>
          </string-name>
          ,
          <article-title>Video data compression and protection in UAV information exchange radio channels, in: Scientific and practical conference on Prospects for the development and use of complexes with unmanned aerial vehicles, 924 State Center for Unmanned Aviation of the Ministry of Defense of the Russian Federation</article-title>
          ,
          <year>2016</year>
          , pp.
          <fpage>202</fpage>
          -
          <lpage>204</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>K.</given-names>
            <surname>Wong</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Tanaka, DCT based scalable scrambling method with reversible data hiding functionality</article-title>
          ,
          <source>in: 4th International Symposium on Communications, Control and Signal Processing (ISCCSP)</source>
          ,
          <year>2010</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          . doi:
          <volume>10</volume>
          .1109/ISCCSP.
          <year>2010</year>
          .
          <volume>5463307</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>L.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Korshunov</surname>
          </string-name>
          , T. Ebrahimi,
          <article-title>Secure JPEG Scrambling enabling Privacy in Photo Sharing</article-title>
          ,
          <source>in: 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG)</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . doi:
          <volume>10</volume>
          .1109/FG.
          <year>2015</year>
          .
          <volume>7285022</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>K. M. Faraoun</surname>
          </string-name>
          ,
          <article-title>A parallel block-based encryption schema for digital images using reversible cellular automata</article-title>
          .
          <source>Engineering Science and Technology</source>
          , Vol.
          <volume>17</volume>
          ,
          <year>2014</year>
          , pp.
          <fpage>85</fpage>
          -
          <lpage>94</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.jestch.
          <year>2014</year>
          .
          <volume>04</volume>
          .001.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bliem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Engel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Uhl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Unterweger</surname>
          </string-name>
          ,
          <article-title>Bitstream-based JPEG Encryption in Real-time</article-title>
          , in:
          <source>International Journal of Digital Crime and Forensics</source>
          (
          <year>2013</year>
          ). doi:
          <volume>10</volume>
          .4018/jdcf.2013070101.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>H.</given-names>
            <surname>Kobayashi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kiya</surname>
          </string-name>
          ,
          <article-title>Bitstream-Based JPEG Image Encryption with File-Size Preserving</article-title>
          ,
          <source>in: IEEE 7th Global Conference on Consumer Electronics (GCCE)</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          . doi:
          <volume>10</volume>
          .1109/gcce.
          <year>2018</year>
          .
          <volume>8574605</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>K.</given-names>
            <surname>Minemura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Moayed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Qi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Tanaka</surname>
          </string-name>
          ,
          <article-title>JPEG image scrambling without expansion in bitstream size</article-title>
          ,
          <source>in: 19th IEEE International Conference on Image Processing</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>261</fpage>
          -
          <lpage>264</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICIP.
          <year>2012</year>
          .
          <volume>6466845</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Phatak</surname>
          </string-name>
          ,
          <article-title>A Non-format Compliant Scalable RSA-based JPEG Encryption Algorithm</article-title>
          .
          <source>International Journal of Image, Graphics and Signal Processing</source>
          , Vol.
          <volume>8</volume>
          , No.
          <volume>6</volume>
          ,
          <issue>2016</issue>
          , pp
          <fpage>64</fpage>
          -
          <lpage>71</lpage>
          . doi:
          <volume>10</volume>
          .5815/ijigsp.
          <year>2016</year>
          .
          <volume>06</volume>
          .08.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Ch</surname>
          </string-name>
          .-L. Tsai,
          <string-name>
            <surname>Ch</surname>
          </string-name>
          .-J. Chen, W.-L.
          <article-title>Hsu, Multi-morphological image data hiding based on the application of Rubik's cubic algorithm</article-title>
          ,
          <source>in: IEEE International Carnahan Conference on Security Technology (ICCST)</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>135</fpage>
          -
          <lpage>139</lpage>
          . doi:
          <volume>10</volume>
          .1109/CCST.
          <year>2012</year>
          .
          <volume>6393548</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>K.-W. Wong</surname>
          </string-name>
          ,
          <article-title>Image encryption using chaotic maps</article-title>
          .
          <source>Intelligent Computing Based on Chaos</source>
          , Vol.
          <volume>184</volume>
          ,
          <year>2009</year>
          , pp.
          <fpage>333</fpage>
          -
          <lpage>354</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>540</fpage>
          -95972-4_
          <fpage>16</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Yu. Wu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Agaian</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Noonan</surname>
          </string-name>
          ,
          <article-title>Sudoku Associated Two Dimensional Bijections for Image Scrambling</article-title>
          , in: IEEE Transactions on multimedia,
          <year>2012</year>
          , 30 p. URL: https://arxiv.org/abs/1207.5856v1.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. B.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Yu1, Efficient and Syntax-Compliant JPEG 2000 Encryption Preserving Original Fine Granularity of Scalability</article-title>
          .
          <source>EURASIP Journal on Information Security</source>
          , Vol.
          <year>2007</year>
          ,
          <string-name>
            <surname>Article</surname>
            <given-names>ID</given-names>
          </string-name>
          56365,
          <year>2008</year>
          , 13 p. doi:
          <volume>10</volume>
          .1155/
          <year>2007</year>
          /56365.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Barannik</surname>
          </string-name>
          , Yu. Ryabukha,
          <string-name>
            <given-names>D.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <article-title>Indirect Steganographic Embedding Method Based On Modifications of The Basis of the Polyadic System</article-title>
          , in: 15th IEEE International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET'
          <year>2020</year>
          ),
          <year>2020</year>
          , pp.
          <fpage>699</fpage>
          -
          <lpage>702</lpage>
          . doi:
          <volume>10</volume>
          .1109/TCSET49122.
          <year>2020</year>
          .
          <volume>235522</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <article-title>Binomial-Polyadic Binary Data Encoding by Quantity of Series of Ones</article-title>
          , in: 15th IEEE International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET'
          <year>2020</year>
          ),
          <year>2020</year>
          , pp.
          <fpage>775</fpage>
          -
          <lpage>780</lpage>
          . doi:
          <volume>10</volume>
          .1109/TCSET49122.
          <year>2020</year>
          .
          <volume>235540</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Belikova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gurzhii</surname>
          </string-name>
          ,
          <article-title>The model of threats to information and psychological security, taking into account the hidden information destructive impact on the subconscious of adolescents</article-title>
          ,
          <source>in: 2019 IEEE International Conference on Advanced Trends in Information Theory (ATIT)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>656</fpage>
          -
          <lpage>661</lpage>
          . doi:
          <volume>10</volume>
          .1109/ATIT49449.
          <year>2019</year>
          .
          <volume>9030432</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>V. V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Karpinski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. V.</given-names>
            <surname>Tverdokhleb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. V.</given-names>
            <surname>Himenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Aleksander</surname>
          </string-name>
          ,
          <article-title>The technology of the video stream intensity controlling based on the bit-planes recombination</article-title>
          ,
          <source>in: 2018 IEEE 4th International Symposium on Wireless Systems within the International Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS)</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>25</fpage>
          -
          <lpage>28</lpage>
          . doi:
          <volume>10</volume>
          .1109/IDAACS-SWS.
          <year>2018</year>
          .
          <volume>8525560</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>V. V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Yu. N.</given-names>
            <surname>Ryabukha</surname>
          </string-name>
          , О. S. Kulitsa,
          <article-title>The method for improving security of the remote video information resource on the basis of intellectual processing of video frames in the telecommunication systems</article-title>
          ,
          <source>Telecommunications and Radio Engineering</source>
          , Vol.
          <volume>76</volume>
          , No 9,
          <year>2017</year>
          , pp.
          <fpage>785</fpage>
          -
          <lpage>797</lpage>
          . doi:
          <volume>10</volume>
          .1615/TelecomRadEng.v76.
          <year>i9</year>
          .
          <fpage>40</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shulgin</surname>
          </string-name>
          ,
          <article-title>The method of increasing accessibility of the dynamic video information resource</article-title>
          ,
          <source>in: 2016 13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET)</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>621</fpage>
          -
          <lpage>623</lpage>
          . doi:
          <volume>10</volume>
          .1109/TCSET.
          <year>2016</year>
          .
          <volume>7452133</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>V.</given-names>
            <surname>Barannik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tarasenko</surname>
          </string-name>
          ,
          <article-title>Method coding efficiency segments for information technology processing video</article-title>
          , in: 2017 4th
          <string-name>
            <given-names>International</given-names>
            <surname>Scientific-Practical Conference</surname>
          </string-name>
          Problems of Infocommunications. Science and
          <string-name>
            <surname>Technology (PIC S&amp;T)</surname>
          </string-name>
          ,
          <year>2017</year>
          , pp.
          <fpage>551</fpage>
          -
          <lpage>555</lpage>
          . doi:
          <volume>10</volume>
          .1109/INFOCOMMST.
          <year>2017</year>
          .
          <volume>8246460</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Ch</surname>
          </string-name>
          .-Ch. Chen,
          <string-name>
            <surname>W.-J. Wu</surname>
          </string-name>
          ,
          <article-title>A secure Boolean-based multi-secret image sharing scheme</article-title>
          .
          <source>Journal of Systems and Software</source>
          , Vol.
          <volume>92</volume>
          ,
          <year>2014</year>
          , pp.
          <fpage>107</fpage>
          -
          <lpage>114</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.jss.
          <year>2014</year>
          .
          <volume>01</volume>
          .001.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>