<!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>Research on a new hybrid random number sequence generator⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Serhii Yanushevskyi</string-name>
          <email>s.yanushevskyi@chnu.edu.ua</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Heorhii Prokhorov</string-name>
          <email>g.prokhorov@chnu.edu.ua</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksandr Hres</string-name>
          <email>o.hres@chnu.edu.ua</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yurii Yaremchuk</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Volodymyr Lytvynenko</string-name>
          <email>v.lytvynenko@kpi.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</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="aff1">
          <label>1</label>
          <institution>Vinnytsia National Technical University</institution>
          ,
          <addr-line>95 Khmelnytsky highway str., 21021 Vinnytsia</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Yuriy Fedkovych Chernivtsi National University</institution>
          ,
          <addr-line>2 Kotsiubynskoho Str., 58002 Chernivtsi</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <fpage>296</fpage>
      <lpage>306</lpage>
      <abstract>
        <p>The presented study reports the results of developing a hybrid random sequence generation system that combines both hardware and software components to achieve high performance and strong statistical quality. The proposed system integrates three primary components: a conventional webcam serving as a physical entropy source, cellular automata functioning as a nonlinear post-processing mechanism, and the Java SecureRandom library acting as the software-based random number generator. Such an architecture aims to merge the advantages of physical randomness with the reproducibility and speed of software generation. Previous research demonstrated that an ordinary webcam can be utilized to generate random bit sequences with a throughput exceeding 100 Mbit/s. Although these sequences exhibited significant randomness, their statistical parameters did not fully satisfy the core NIST standards. In particular, the value distribution of the generated elements lacked uniformity, despite displaying sufficiently chaotic behavior. While this shortcoming is not critical, further refinement was considered beneficial. To address this issue, linear cellular automata based on chaotic rules were incorporated. This modification improved the statistical quality of the output sequences but resulted in a noticeable reduction in performance.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;software engineering</kwd>
        <kwd>cybersecurity</kwd>
        <kwd>webcam</kwd>
        <kwd>cellular automata</kwd>
        <kwd>random number generation</kwd>
        <kwd>NIST</kwd>
        <kwd>encryption</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Random number generators (RNG) play a crucial role in modern cryptographic systems, as they
serve as the fundamental source of unpredictability required to ensure the confidentiality, integrity,
and authenticity of information. By producing data sequences that are statistically random and
unpredictable, RNGs enable the generation of cryptographic keys, the establishment of secure
network connections, and the maintenance of robust authentication mechanisms [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In practice,
random numbers are applied in a wide range of domains—from the creation of session keys and
digital signatures to load balancing, data integrity verification, initialization vectors, PIN and
password generation, and simulation of stochastic processes in scientific and financial
computations [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
      </p>
      <p>Unlike the generation of single random values, the production of random number sequences
introduces additional challenges and requirements. Beyond meeting the fundamental NIST SP
80022 statistical standards, a high-quality random sequence generator must also demonstrate sufficient
productivity rate to support real-time cryptographic operations. For practical implementations, a
performance rate of at least 100 Mbps is typically considered the minimum threshold for effective
integration into modern high-speed communication and security systems. Achieving this balance</p>
      <p>0009-0007-3426-2868 (S. Yanushevskyi); 0000-0001-7810-2785 (H. Prokhorov); 0000-0002-8465-193X (O. Hres);
00000002-6303-7703 (Y. Yaremchuk); 0000-0002-1536-5542 (V. Lytvynenko)
between statistical quality and performance is one of the key objectives in the design of advanced
RNG systems.</p>
      <p>RNGs implemented purely in software are commonly referred to as pseudo-random number
generators (PRNGs). These systems rely on deterministic algorithms, meaning that the sequence of
generated numbers is completely determined by an initial value, or seed. Although the resulting
sequences can appear random, they are not truly unpredictable if the underlying algorithm or seed
is known. Nevertheless, software-based RNGs are widely used because they can fully comply with
NIST requirements, ensuring excellent uniformity, randomness, and reproducibility under
controlled conditions.</p>
      <p>One of the major advantages of software-based generators is their predictable performance and
scalability. Their output rate and efficiency depend primarily on the computational power of the
system, including the CPU clock frequency, number of processing cores, and operating system
efficiency in managing multithreaded tasks. Advanced implementations, such as those integrated
into programming libraries like Java’s SecureRandom or OpenSSL’s RAND_bytes, can achieve very
high throughput levels, making them suitable for most cryptographic applications..</p>
    </sec>
    <sec id="sec-2">
      <title>2. Literature review</title>
      <p>The deterministic nature of pseudo-random number generators (PRNGs) remains a fundamental
limitation, particularly in applications that demand true unpredictability and high levels of
cryptographic strength. Since PRNGs operate according to predefined mathematical algorithms,
their output sequences are entirely determined by an initial value, or seed. Consequently, if an
attacker is able to infer or reconstruct the internal state or the seeding mechanism of the generator,
it becomes possible to predict all subsequent outputs, effectively compromising the entire
cryptographic system.</p>
      <p>This inherent vulnerability emphasizes the necessity of developing hybrid random number
generation systems, which integrate software algorithms with physical entropy sources such as
electronic or thermal noise, optical sensors, micro-phone input, or user interaction data. These
physical process-es introduce a level of unpredictability that cannot be reproduced by deterministic
algorithms alone, thereby enhancing the entropy and security of the generated sequences.</p>
      <p>
        From a theoretical perspective, a PRNG based on mathematical computation can achieve an
unbounded or effectively infinite sequence length, meaning it can continuously produce random
numbers without entropy depletion. However, this advantage comes at the cost of predictability –
since the generation process follows a known algorithmic model, its randomness is ultimately
simulated rather than intrinsic. Thus, despite the potential for high performance and
reproducibility, the primary drawback of purely algorithmic approaches lies in their susceptibility
to reverse engineering and the absence of true physical randomness [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ].
      </p>
      <p>
        True random number generators (TRNGs) generate random numbers from the inherent chaos of
real physical stochastic processes, such as photocurrent, thermal noise in resistors and diodes,
radioactive decay, etc. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The main advantage is complete randomness and unpredictability.
      </p>
      <p>
        The main limitations of true random number generators (TRNGs) stem from their relatively low
performance rates and, in some cases, suboptimal statistical characteristics when compared to their
software-based analogues. Because TRNGs rely on the measurement of physical phenomena—such
as thermal noise, radioactive decay, or optical fluctuations—their generation speed is inherently
constrained by the physical process itself and the sampling frequency of the measuring system.
Moreover, these physical entropy sources often require precise calibration, environmental stability,
and complex circuitry to ensure consistent output quality. As a result, TRNG devices tend to be
costly, technically intricate, and difficult to maintain in long-term or large-scale implementations
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>From the standpoint of software engineering and applied cryptography, this situation creates a
strong motivation to investigate hybrid and adaptive methods of random sequence generation.
Such approaches aim to combine the high entropy and unpredictability of hardware-based sources
with the high performance, flexibility, and scalability of software algorithms. In recent years,
research in this direction has focused on integrating physical entropy sources—for example,
webcams, microphones, or hardware sensors—with software-based post-processing modules that
refine and normalize the statistical properties of the output sequences.</p>
      <p>
        Therefore, exploring new hardware—software architectures for random number generation is
both theoretically significant and practically relevant. These hybrid systems can potentially
overcome the trade-off between true randomness and computational efficiency, providing secure,
high-speed, and statistically reliable random sequences suitable for modern cryptographic, data
protection, and simulation applications [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Main part</title>
      <p>
        In previous studies [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ], the webcam was examined as a potential source of entropy for random
number generation. The ability of a standard consumer webcam to produce image data at a rate of
approximately 25 frames per second in SVGA resolution (800×600 pixels) provides a substantial
data throughput, making it an attractive candidate for use in high-performance random sequence
generators. Each captured frame contains numerous sources of micro-level randomness, including
sensor noise, variations in lighting, and subtle environmental fluctuations, which together
contribute to a significant level of entropy.
      </p>
      <p>Subsequent experimental investigations have confirmed that webcam-based entropy generation
exhibits strong randomness and high unpredictability of output sequences. Under optimal
conditions, theoretical calculations suggest that a high-resolution webcam can achieve data rates of
up to 5 Gbps, making it one of the most promising low-cost physical entropy sources for practical
cryptographic and simulation applications.</p>
      <p>
        Nevertheless, this approach is not without limitations. The statistical characteristics of the
generated sequences, when evaluated according to NIST SP 800-22 standards, reveal certain
deviations from ideal uniformity. Specifically, the distribution of generated elements tends to be
non-uniform, although the overall sequence remains sufficiently chaotic and unpredictable, as
illustrated in Figure 1. This imbalance does not completely disqualify the webcam as an entropy
source but indicates the need for additional post-processing or normalization techniques to
improve compliance with statistical quality requirements [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
The histogram shown in Figure 1 illustrates the value distribution of the random sequence
generated using a webcam-based RNG. The diagram reveals that the occurrence frequency of
certain byte values varies noticeably across the output stream. For instance, byte 15 appears in only
0.1% of cases, whereas byte 55 occurs approximately 1.0% of the time. Such deviations indicate that
the overall distribution of values is not perfectly uniform, which suggests the presence of bias
within the generated sequence. In some limited contexts, for example, non-cryptographic
stochastic simulations, such irregularities may be considered acceptable. However, for applications
that require strict compliance with NIST SP 800-22 statistical standards, this behavior is regarded as
unsatisfactory and requires correction.
      </p>
      <p>The overall shape of the distribution is chaotic and irregular, which in itself can be interpreted
as a positive characteristic, since higher chaotic behavior often correlates with improved
randomness and unpredictability. Nonetheless, this same property can also lead to unintended side
effects. Specifically, the distinctive statistical pattern of the generated sequence may serve as a
unique “fingerprint” of the particular webcam used, reflecting the inherent noise characteristics of
its optical sensor and electronics. In certain scenarios, especially those involving privacy-sensitive
or security-critical systems, such device-specific signatures may be undesirable, as they could
potentially be exploited to identify or trace the entropy source.</p>
      <p>
        Nevertheless, generating raw random number sequence (RNS) output in SVGA mode already
demonstrates a data rate of up to 200 Mbps, which is a notable performance indicator for a
lowcost, consumer-grade entropy source. By increasing the camera’s resolution and frame capture
rate, the achievable rate can be significantly improved. Theoretical estimations indicate that, under
optimal conditions and with modern high-resolution webcams operating at full HD or higher frame
rates, the data generation speed could potentially reach up to 5 Gbps. This performance level
positions webcams as a promising foundation for the development of high-performance hybrid
random sequence generators, combining physical entropy acquisition with software-based
postprocessing to achieve both speed and statistical robustness [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ].
      </p>
      <p>
        To mitigate the disadvantages of raw random sequence generation, the computational power of
cellular automata (CA) was employed. Among the well-known chaotic rules (30, 90, 105, 150), rule
30 was selected as the most chaotic one [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>
        As demonstrated in previous research [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ], applying first 10–20 iterations of cellular
automata–based post-processing is sufficient to adjust the distribution histogram of
webcamgenerated random sequences to a statistically satisfactory and nearly uniform shape, as shown in
Figure 2.
      </p>
      <p>However, this improvement in statistical quality comes at the cost of performance degradation.
Each iteration introduces additional computational overhead, significantly increasing the total
processing time. Experimental results show that after approximately 10 iterations, the overall
generation speed of the system decreases by about an order of magnitude compared to the initial
configuration. In the specific experimental setup, SVGA resolution at 25 frames per second, the
effective throughput was reduced from approximately 200 Mbps to around 20 Mbps.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Hybrid generation algorithm</title>
      <p>This paper proposes a hybrid approach to pseudo-random number sequence generation based on
the integration of a webcam, cellular automata, and the SecureRandom library. The structural
diagram of the proposed hybrid generator RNG is given
A random number generation module based on a webcam. A post-processing mechanism for the
generated sequences using chaotic-type cellular automata. A software pseudo-random number
generator based on the SecureRandom function (with the use of initial seed conditions).</p>
      <p>
        The extraction method for random number sequences (RNS) from webcam frames is detailed in
[
        <xref ref-type="bibr" rid="ref11 ref14">11, 14</xref>
        ]. The received sequence of bits from the webcam is post-processed according to certain
rules of cellular automata, after which the obtained sequences act as initial conditions for
generating sequences of random numbers using the SecureRandom library and the function...
      </p>
      <p>
        For this purpose, the research employs the built-in Java SecureRandom library—a
wellestablished component designed to provide cryptographically strong random number generation.
SecureRandom serves as a core element of the Java Cryptography Architecture (JCA) and can
integrate multiple entropy sources and algorithms depending on the selected security provider.
This study presents a comprehensive analysis of the library’s security features, internal
mechanisms, and entropy acquisition methods, as described in the literature [
        <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
        ].
      </p>
      <p>The most reliable method of random number sequence (RNS) generation involves using a
pregenerated list of random numbers as a seed. In this investigation, the seed list was derived from the
aforementioned hybrid generation method:</p>
      <p>SecureRandom secure = new SecureRandom();
byte[] randomsFromWebCam = new byte[440];</p>
      <p>secure.setSeed(randomsFromWebCam);</p>
      <p>
        The Java code fragment presented above illustrates the initial implementation of the
SecureRandom object, which serves as the core component of the proposed random sequence
generation system. The SecureRandom class is part of the standard Java Development Kit (JDK)
and therefore requires no additional Maven dependencies or external libraries, ensuring full
portability and seamless integration across various software environments [
        <xref ref-type="bibr" rid="ref20 ref21 ref22">20–22</xref>
        ].
      </p>
      <p>To evaluate the quality and statistical robustness of the generated sequences, the NIST SP
80022 test suite was employed. The results of these tests serve as a benchmark for comparing
software-based randomness with the hybrid webcam–cellular automata–SecureRandom approach
proposed in this study.</p>
      <p>In this implementation, the value 440 is used as a so-called magic number, representing the
minimum seed length required to satisfy the NIST SP 800-22 standard for adequate entropy
initialization. This seed ensures that the generator starts with a sufficiently large pool of random
bits, providing a robust foundation for producing statistically sound and cryptographically secure
random sequences. The chosen seed length aligns with established cryptographic best practices,
achieving a balance between security, performance, and compatibility within existing Java-based
security frameworks.</p>
      <p>The paper presents a study of sequences generated by the secure random function. The study
covers 10 RNS with a volume of 100 MB (20). The results of the study are presented in Table 1.</p>
      <p>In this work, the sequences generated by a hybrid generator were tested using NIST tests. For
this purpose, an array of 100 sequences, each 100 MB in size, was generated. The research results
are presented in Table 2.</p>
      <p>For the experimental analysis, 100 random number sequences (RNS) were generated using the
aforementioned hybrid algorithm shown on Figure 4. The size of each RNS is equal to 100 MB.</p>
      <p>According to the experimental results, the proposed hybrid generation method, unlike a
generator, based on a webcam and a secure random function, successfully produces statistically
secure random sequences. As demonstrated by the study, out of the 15 standard tests included in
the NIST SP 800-22 suite, all tests were passed at a high level, confirming the overall reliability and
robustness of the generated sequences.</p>
      <p>In this study, a 440-byte seed was employed, which satisfies the minimum entropy requirement
but may still limit performance in certain high-complexity tests. Therefore, additional research is
necessary to determine the optimal trade-off between seed size, generation throughput, and the
overall statistical quality of the produced random number sequences.</p>
      <sec id="sec-4-1">
        <title>The obtained NIST testing results are presented in Table 2.</title>
        <p>In the conducted experiments, the generation performance of the SecureRandom-based
implementation reached approximately 2 Gbps, confirming that the proposed hybrid approach
effectively combines high statistical reliability with exceptional data throughput.</p>
        <p>The research results indicate that the proposed pseudo-random sequence generation method
can be applied to the development of cryptographically secure encryption techniques and used in
various cryptographic applications.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Information encryption method based on a new Hybrid PRNG</title>
      <p>This paper also provides an example of using the developed hybrid RNG generator in information
encryption methods. Figure 5 shows a diagram of the proposed method of information encryption
using a hybrid RNG generator. The proposed method is implemented in Java.
values of the previous bytes of the input information on the subsequent bytes of the encrypted
information. The diffusion transformation is determined by the following formula:
C ( k )=φ ( k )⊕ {[S ( k )+φ ( k ) ] mod N } ⊕ I ( k −1 )
(2)
where I ( k− 1) is the previous byte of input data, φ ( k) is a chaotic function, for which either a
logistic mapping or a modified cosine mapping can be used:</p>
      <p>φ ( k + 1)= 3,99 φ ( k ) [1− φ ( k ) ]</p>
      <sec id="sec-5-1">
        <title>The reverse diffusion process can be described by the equation:</title>
        <p>S ( k )= { φ ( k )⊕C ( k )⊕ I ( k −1 )+ N −φ ( k ) } mod N
(3)
(4)</p>
        <p>The so-called additional parameters for diffusion conversion are two additional values: C ( 0 )
and φ ( 0 ), the so-called additional parameters for diffusion conversion are two additional values.</p>
        <p>The decryption process is performed in reverse order with the same initial condition and
control parameter values for discrete mappings used in encryption, since this encryption algorithm
is symmetric. The method was tested using color image encryption as an example.</p>
        <p>Based on the results of image encryption, it can be concluded that a modified diffusion
transformation with an additional parameter for encryption should be used as the final stage of
encryption. with different values of which, when encrypting and decrypting information, there is
no identity between the transmitted and received information, indicating the high cryptographic
strength of the developed method.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>This paper proposes a hybrid RNG generator based on a combination of sequences generated by a
web camera, chaotic cellular automata, and the SecureRandom function.</p>
      <p>The use of chaotic cellular automata as a mechanism for post-processing sequences generated
by a web camera has significantly improved the statistical properties of the generated sequences,
and the use of random sequences generated by a web camera as the initial entropy value for the
software generator, in particular the Java SecureRandom library, made it possible to create a hybrid
generator of pseudo-random sequences that effectively combines the unpredictability of hardware
with the efficiency of software, ensuring stable and continuous generation of random sequences.</p>
      <p>Research on sequences generated by a hybrid generator using the NIST SP 800-22 test suite
showed that all tests were passed at a high level, confirming the overall reliability and stability of
the generated sequences. Therefore, this hybrid pseudorandom sequence generator can be used to
build cryptographically secure encryption methods and for use in cryptographic applications.
The paper also proposes a method for encrypting information using this hybrid generator as a key
sequence generator.</p>
      <p>Based on the results obtained using this method on the example of color images encryption, it
can be concluded that when encrypting and decrypting information, there is no identity between
the transmitted and received information, which indicates the high cryptographic strength of the
developed method.</p>
    </sec>
    <sec id="sec-7">
      <title>Declaration on Generative AI</title>
      <p>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>P.</given-names>
             
            <surname>Petriv</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
           Opirskyy,
          <string-name>
            <given-names>N.</given-names>
             
            <surname>Mazur</surname>
          </string-name>
          , Modern Technologies of Decentralized Databases, Authentication, and
          <article-title>Authorization Methods, in: Cybersecurity Providing in Information and Telecommunication Systems II</article-title>
          , vol.
          <volume>3826</volume>
          ,
          <year>2024</year>
          ,
          <fpage>60</fpage>
          -
          <lpage>71</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>S.</surname>
          </string-name>
           Popereshnyak,
          <string-name>
            <given-names>Y.</given-names>
             
            <surname>Novikov</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.</surname>
          </string-name>
           
          <article-title>Zhdanova, Cryptographic System Security Approaches by Monitoring the Random Numbers Generation, in: Cybersecurity Providing in Information and Telecommunication Systems II (CPITS-II)</article-title>
          ,
          <volume>3826</volume>
          ,
          <year>2024</year>
          ,
          <fpage>301</fpage>
          -
          <lpage>309</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
             
            <surname>Proskurin</surname>
          </string-name>
          , et al.,
          <string-name>
            <surname>Hybrid</surname>
            <given-names>RNN</given-names>
          </string-name>
          -
          <article-title>CNN-based Model for PRNG Identification</article-title>
          , in: Classic, Quantum, and
          <string-name>
            <surname>Post-Quantum Cryptography</surname>
          </string-name>
          (CQPC),
          <volume>3829</volume>
          ,
          <year>2024</year>
          ,
          <fpage>47</fpage>
          -
          <lpage>53</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>F.</given-names>
            <surname>Martinez</surname>
          </string-name>
          ,
          <article-title>Attacks on Pseudo Random Number Generators Hiding a Linear Structure</article-title>
          , in: S. D.
          <string-name>
            <surname>Galbraith</surname>
          </string-name>
          (Ed.),
          <source>Topics in Cryptology - CT-RSA, Lect. Notes Comput. Sci.</source>
          , vol.
          <volume>13161</volume>
          (
          <year>2022</year>
          )
          <fpage>145</fpage>
          -
          <lpage>168</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cornejo</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Ruhault</surname>
          </string-name>
          ,
          <article-title>(In)security of Java SecureRandom Implementations</article-title>
          , in: Journées Codage et Cryptographie,
          <year>2014</year>
          . https://www-fourier.ujf-grenoble.fr/JC2/exposes/ruhault.pdf
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. G.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kwon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <article-title>Efficient Hardware Implementation and Analysis of true Random-Number Generator based on Beta Source</article-title>
          , ETRI J.,
          <volume>42</volume>
          (
          <issue>4</issue>
          ) (
          <year>2020</year>
          )
          <fpage>518</fpage>
          -
          <lpage>526</lpage>
          . doi:
          <volume>10</volume>
          .4218/etrij.2020-
          <fpage>0083</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Toffoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Margolus</surname>
          </string-name>
          , Cellular Automata Machines, MIT Press, Cambridge, MA,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ostapov</surname>
          </string-name>
          , et al.,
          <source>Symmetrical Cryptosystems based on Cellular Automata, Int. J. Comput.</source>
          ,
          <volume>22</volume>
          (
          <issue>1</issue>
          ) (
          <year>2023</year>
          )
          <fpage>15</fpage>
          -
          <lpage>20</lpage>
          . doi:
          <volume>10</volume>
          .47839/ijc.22.1.
          <fpage>2874</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>H.</given-names>
            <surname>Prokhorov</surname>
          </string-name>
          , D. Trembach,
          <article-title>Research into the Efficiency of Processing a Numerical Random Sequence by Chaotic-Type Cellular Automata</article-title>
          , SISIOT,
          <volume>2</volume>
          (
          <issue>2</issue>
          ) (
          <year>2024</year>
          )
          <year>02010</year>
          . doi:
          <volume>10</volume>
          .31861/sisiot2024.2.02010
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D. V.</given-names>
            <surname>Hanzhelo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. V.</given-names>
            <surname>Prokhorov</surname>
          </string-name>
          ,
          <article-title>Investigation of Inter-Frame Correlation of Webcamgenerated Chaos, Meas</article-title>
          . Comput. Devices Technol. Process.,
          <volume>2</volume>
          (
          <year>2024</year>
          )
          <fpage>154</fpage>
          -
          <lpage>159</lpage>
          . doi:
          <volume>10</volume>
          .31891/
          <fpage>2219</fpage>
          -9365-2024-78-18
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>R.</given-names>
            <surname>Diachuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dobrovolsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hanzhelo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Prokhorov</surname>
          </string-name>
          , D. Trembach,
          <article-title>Research of the Level of Chaoticity and Reliability in Webcam-Generated Random Number Sequences</article-title>
          , SISIOT,
          <volume>2</volume>
          (
          <issue>1</issue>
          ) (
          <year>2024</year>
          )
          <article-title>01004</article-title>
          . doi:
          <volume>10</volume>
          .31861/sisiot2024.1.
          <fpage>01004</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <article-title>National Institute of Standards and Technology, A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, NIST Spec</article-title>
          .
          <source>Publ. 800-22 Rev. 1</source>
          ,
          <string-name>
            <surname>Aug</surname>
          </string-name>
          .
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Dobrovolsky</surname>
          </string-name>
          , et al.,
          <source>Development of a Hash Algorithm based on Cellular Automata and Chaos Theory</source>
          ,
          <string-name>
            <surname>East</surname>
          </string-name>
          .-
          <string-name>
            <surname>Eur</surname>
          </string-name>
          . J.
          <string-name>
            <surname>Enterp</surname>
          </string-name>
          . Technol.,
          <volume>5</volume>
          (
          <issue>9</issue>
          ) (
          <year>2021</year>
          )
          <fpage>48</fpage>
          -
          <lpage>55</lpage>
          . doi:
          <volume>10</volume>
          .15587/
          <fpage>1729</fpage>
          -
          <lpage>4061</lpage>
          .
          <year>2021</year>
          .242849
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>V.</given-names>
            <surname>Maksymovych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Harasymchuk</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Opirskyy</surname>
          </string-name>
          ,
          <article-title>The Designing and Research of Generators of Poisson Pulse Sequences on base of Fibonacci Modified Additive Generator</article-title>
          ,
          <source>in: Advances in Intelligent Systems and Computing</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          ,
          <fpage>43</fpage>
          -
          <lpage>53</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -91008-
          <issue>6</issue>
          _
          <fpage>5</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hanzhelo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Prokhorov</surname>
          </string-name>
          ,
          <article-title>Investigation of Statistical Characteristics of Numerical Random Sequence Obtained from a Web Camera Frame, Herald Khmelnytskyi Natl</article-title>
          .
          <source>Univ. Techn. Sci.</source>
          ,
          <volume>337</volume>
          (
          <issue>3</issue>
          /2) (
          <year>2024</year>
          )
          <fpage>46</fpage>
          -
          <lpage>51</lpage>
          . doi:
          <volume>10</volume>
          .31891/
          <fpage>2307</fpage>
          -5732-2024-337-3-6
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Oracle</surname>
          </string-name>
          ,
          <source>Java SE 8 Documentation</source>
          , Class SecureRandom,
          <year>2021</year>
          . https://docs.oracle.com/ javase/8/docs/api/java/security/SecureRandom.html
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>K.</given-names>
            <surname>İnce</surname>
          </string-name>
          ,
          <article-title>Security analysis of Java SecureRandom library</article-title>
          ,
          <source>in: 2nd Int. Conf. Access Recent Adv. Eng. Digitization (ARACONF)</source>
          ,
          <year>2021</year>
          . doi:
          <volume>10</volume>
          .31590/ejosat.900956
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>F. J.</given-names>
            <surname>Ibáñez-López</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rubio-Aparicio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pedreño-Plana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sánchez-Martín</surname>
          </string-name>
          , Descriptive Statistics and
          <article-title>Basic Graphs Tutorial to Help You Succeed in Statistical Analysis</article-title>
          ,
          <source>Espiral. Cuad. Profesorado</source>
          ,
          <volume>17</volume>
          (
          <issue>36</issue>
          ) (
          <year>2024</year>
          )
          <fpage>88</fpage>
          -
          <lpage>99</lpage>
          . doi:
          <volume>10</volume>
          .25115/ecp.v17i36.
          <fpage>9570</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>L.</given-names>
            <surname>Crocetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nannipieri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Di</given-names>
            <surname>Matteo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fanucci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Saponara</surname>
          </string-name>
          ,
          <article-title>Review of Methodologies and Metrics for Assessing the Quality of Random Number Generators</article-title>
          , Electronics,
          <volume>12</volume>
          (
          <issue>3</issue>
          ) (
          <year>2023</year>
          )
          <article-title>723</article-title>
          . doi:
          <volume>10</volume>
          .3390/electronics12030723
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jammi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Raju</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Munishankaraiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Srinivas</surname>
          </string-name>
          ,
          <source>Steganography: An Overview, Int. J. Eng. Sci. Technol</source>
          .,
          <volume>2</volume>
          (
          <issue>10</issue>
          ) (
          <year>2010</year>
          )
          <fpage>5985</fpage>
          -
          <lpage>5992</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Oracle</surname>
          </string-name>
          ,
          <string-name>
            <surname>Class</surname>
            <given-names>SecureRandom</given-names>
          </string-name>
          ,
          <source>Java Platform Standard Edition 8 Documentation</source>
          . https://docs.oracle.com/javase/8/docs/api/java/security/SecureRandom.html
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>C.-H. Hsieh</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <string-name>
            <surname>Yao</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Lv</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>B. Ni,</given-names>
          </string-name>
          <article-title>BCsRNG: A Secure Random Number Generator based on Blockchain</article-title>
          , IEEE Access,
          <volume>10</volume>
          (
          <year>2022</year>
          )
          <fpage>98117</fpage>
          -
          <lpage>98126</lpage>
          . doi:
          <volume>10</volume>
          .1109/ACCESS.
          <year>2022</year>
          .3206450
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>G. V.</given-names>
            <surname>Prokhorov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Diachuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. G.</given-names>
            <surname>Hanzhelo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. V.</given-names>
            <surname>Yanushevskyi</surname>
          </string-name>
          ,
          <article-title>New Approaches to the Design of a Hybrid Random Sequence Generator</article-title>
          ,
          <source>in: Phys. Technol. Probl. Transm. Process. Storage Inf. Infocommun. Syst.: 10th Int. Sci. Pract</source>
          . Conf.,
          <string-name>
            <surname>Chernivtsi</surname>
          </string-name>
          ,
          <year>2025</year>
          ,
          <fpage>134</fpage>
          -
          <lpage>135</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>O. V.</given-names>
            <surname>Hres</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. I.</given-names>
            <surname>Skrypskyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. M.</given-names>
            <surname>Kosovan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. M.</given-names>
            <surname>Rozorinov</surname>
          </string-name>
          ,
          <source>Research of Pseudorandom Sequence Generators based on Discrete Mappings, Herald Khmelnytskyi Natl. Univ. Techn. Sci.</source>
          ,
          <volume>4</volume>
          (
          <year>2017</year>
          )
          <fpage>243</fpage>
          -
          <lpage>251</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>