<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Cryptographic system security approaches by monitoring the random numbers generation ⋆</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Svitlana</forename><surname>Popereshnyak</surname></persName>
							<email>spopereshnyak@gmail.com</email>
							<affiliation key="aff0">
								<orgName type="institution">National Technical University of Ukraine &quot;Igor Sikorsky Kyiv Polytechnic Institute&quot;</orgName>
								<address>
									<addrLine>37 Beresteiskyi ave</addrLine>
									<postCode>03056</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Yuriy</forename><surname>Novikov</surname></persName>
							<email>ynovikov@gmail.com</email>
							<affiliation key="aff1">
								<orgName type="department">Institute of Software Systems</orgName>
								<orgName type="institution">National Academy of Sciences of Ukraine</orgName>
								<address>
									<addrLine>40-5 Akademik Hlushkov ave</addrLine>
									<postCode>03187</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Yuliia</forename><surname>Zhdanova</surname></persName>
							<email>y.zhdanova@kubg.edu.ua</email>
							<affiliation key="aff2">
								<orgName type="institution">Borys Grinchenko Kyiv Metropolitan University</orgName>
								<address>
									<addrLine>18/2 Bulvarno-Kudryavska str</addrLine>
									<postCode>04053</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Cryptographic system security approaches by monitoring the random numbers generation ⋆</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">6F3539888CE5A1EC707F95EB6C7D2E3E</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T17:49+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>cryptography</term>
					<term>random number generation</term>
					<term>monitoring</term>
					<term>entropy</term>
					<term>statistical tests</term>
					<term>anomalies</term>
					<term>internet of things</term>
					<term>security 1</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The paper examines one of the approaches to ensuring the security of cryptographic systems by monitoring the generation of random numbers. Random numbers play a key role in cryptography, in particular for generating keys, initialization vectors, and other important cryptographic parameters. Unreliable or predictable random numbers can lead to successful attacks on cryptographic protocols, making generation monitoring critical to the security of systems. The paper proposes an automated monitoring system that utilizes statistical tests to check randomness, entropy level, and the presence of correlations between generated numbers. Particular attention is paid to researching methods of detecting anomalies and reacting to them in real-time. Furthermore, the paper examines the effect of limited entropy in resource-constrained devices like those used in the Internet of Things (IoT) and explores the application of machine learning to enhance the monitoring of random number generation. The results demonstrate that implementing the monitoring system significantly enhances the resilience of cryptographic systems against attacks targeting random number generation.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>In today's conditions of rapid technological development, information protection is becoming one of the priority tasks in cyber security. Most cryptographic systems for data encryption, key generation, and user authentication are based on the use of random numbers. The quality of the random numbers used in these systems directly affects their resistance to cryptographic attacks. However, many random number generators are susceptible to attacks that reduce entropy or make their sequences predictable, creating a vulnerability for the entire cryptographic system.</p><p>The introduction of a random number generation monitoring system becomes an important element of cyber protection, as it allows for real-time detection of anomalies in the generation process and response to them, minimizing the risk of data compromise. The use of such systems increases the overall reliability of cryptographic protocols, especially in the face of entropy attacks or sequence prediction attempts.</p><p>The main problem is that cryptographic systems may be exposed to vulnerabilities when random number generators produce weak or insufficiently unpredictable sequences. This creates an opportunity for attacks on pseudorandom number generators, which can lead to the disclosure of keys or other sensitive information. Traditional approaches to random number generation do not always provide reliable control over the quality and randomness of sequences in real-time, which increases the risk of system compromise.</p><p>The implementation of a random number generation monitoring system addresses this issue by continuously overseeing the generation process through statistical tests and anomaly detection mechanisms. Such a system can automatically signal random violations and propose measures to eliminate them, which significantly increases the resistance of cryptographic systems to attacks.</p><p>The purpose of the research is to develop and implement a monitoring system for the generation of random numbers, which will allow us to automatically evaluate the quality and compliance of the generation with the criteria of randomness. This entails employing statistical methods to identify deviations from expected outcomes and ensure the reliability of random number generators across various systems, particularly in security-critical sectors like cryptography and the IoT <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b1">2]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Review of literature and scientific publications</head><p>During the last decade, the issue of ensuring the security of cryptographic systems remains relevant, and many researchers pay attention to the generation of random numbers as one of the key aspects of this security. Random numbers are used to generate encryption keys, salt for hashing passwords, and other cryptographic processes. The poor quality of random numbers or their predictability can make cryptographic systems vulnerable to attack. One of the key areas of research is the study of attacks on Random Number Generators (RNGs) and their impact on the security of cryptographic systems. Various types of PRNGs and their vulnerabilities are considered in <ref type="bibr" target="#b2">[3]</ref><ref type="bibr" target="#b3">[4]</ref><ref type="bibr" target="#b4">[5]</ref>. Research indicates that predictable or insufficiently random sequences can compromise cryptographic keys. Additionally, various attacks on cryptographic systems have highlighted the necessity of real-time monitoring of random number generation quality.</p><p>Recent research indicates that merely employing cryptographically secure random number generators (CSPRNGs) is not always adequate for ensuring a high level of security. The works <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b6">7]</ref> propose the development of a system for real-time monitoring of random number generation to identify anomalies and deviations from randomness. These systems use statistical tests to assess the level of entropy and the presence of correlations in sequences of random numbers. Some of the popular monitoring methods include the Chi-square test for distribution uniformity, Pearson's test for correlations, and entropy analysis for measuring unpredictability. Such systems allow the detection of anomalies before they lead to real problems in cryptographic processes.</p><p>With the development of the IoT, there is a need to use lightweight and energy-efficient random number generation methods. Publications <ref type="bibr" target="#b7">[8,</ref><ref type="bibr" target="#b8">9]</ref> analyze the impact of insufficient entropy in IoT devices on the cryptographic stability of these systems. The researchers particularly highlight the significance of monitoring random number generators, especially given the limited resources of IoT devices. Insufficient entropy sources can lead to duplication of keys and other cryptographic data, which poses a security threat.</p><p>Recent studies, such as <ref type="bibr" target="#b9">[10]</ref><ref type="bibr" target="#b10">[11]</ref><ref type="bibr" target="#b11">[12]</ref><ref type="bibr" target="#b12">[13]</ref>, have proposed the application of machine learning techniques for monitoring random number generation. Machine learning algorithms can analyze large volumes of data, and identify hidden patterns and anomalies that may go unnoticed using traditional statistical methods. These studies show that hybrid approaches combining statistical tests and machine learning can significantly improve the reliability of cryptographic systems.</p><p>With the development of cloud computing, cryptographic systems increasingly rely on random number generation in cloud environments. Research <ref type="bibr" target="#b13">[14,</ref><ref type="bibr" target="#b14">15]</ref> emphasizes the need to monitor the generation of random numbers in the conditions of scalable cloud environments <ref type="bibr" target="#b15">[16,</ref><ref type="bibr" target="#b16">17]</ref>. The publications describe the use of distributed monitoring systems that can monitor the performance of RNGs in different virtual environments and detect anomalies related to the computational load.</p><p>The literature review shows the importance of monitoring the generation of random numbers as a critical component of the security of cryptographic systems. Most modern studies point to the need to implement automated monitoring systems to detect anomalies and maintain a high level of entropy. This applies to both classic cryptographic systems and modern platforms such as IoT and cloud computing <ref type="bibr" target="#b17">[18]</ref>.</p><p>Employing advanced techniques, such as machine learning and statistical analysis, can significantly enhance the resilience of random number generators against attacks, thereby ensuring the reliability and unpredictability of cryptographic operations.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Analysis of stability of generators</head><p>Analysis of the stability of pseudorandom number generators (PRNGs) in real conditions consists in determining how well they can withstand external factors that can affect the quality of random number generation (Table <ref type="table" target="#tab_0">1</ref>). Such factors include noise, limited computing resources, changes in the execution environment, and other technical or physical influences.</p><p>The research conducted yielded the following results:  A decrease in the quality of random numbers can be observed in conditions of unstable power supply or increased loads on the system, which leads to a decrease in entropy or an increase in the predictability of sequences.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head></head><p>Reliable generators exhibit consistent random number generation even in the face of significant fluctuations in available resources or external conditions, ensuring high levels of randomness and speed. Noise attacks. Generators can be subject to noise attacks, where the input data is distorted by exposure to external noise. For example, for hardware generators, it could be electromagnetic radiation, while for software generators it could be a malfunction of the hardware or operating system.</p><p>During the testing, experiments are carried out with the addition of artificial noise to the system to check the resistance of the HPC to such influences. This can be done by emulating an unstable environment, such as generating random numbers under varying power levels or network failures. Testing in conditions of limited resources Limitation of computing resources. IoT devices and other low-power systems often have limits on computing power, RAM, and energy. Generators must remain reliable even with minimal resources.</p><p>Experiments are being carried out with the limitation of available resources during the execution of HPC. For example, artificially reducing the amount of available RAM or increasing delays in processor cycles allows you to assess how this will affect the performance and quality of random numbers. Resistance to entropy attacks Entropy reduction. One important factor is the level of entropy from which random numbers are generated. If entropy decreases due to external influences or a lack of sufficient sources of entropy, this can lead to predictable generation results.</p><p>Entropy sources are analyzed during testing. For example, there may be limited input data (noise from physical sensors or random sources from the OS) to test whether the HPC can generate sufficiently random numbers.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Analysis under conditions of high loads</head><p>High load on the system. Real-world conditions often include HPC operation under high load, for example, when several processes simultaneously use generator resources.</p><p>Conducting stress tests, which include increasing the number of requests to the generator or performing other computational tasks at the same time, allows you to evaluate how this affects the speed and randomness of the generated numbers. The influence of the reliability of hardware components Hardware failures. Hardware oscillators can be susceptible to problems with the components themselves, such as aging or defects in the chips.</p><p>Simulating hardware component failures or conducting tests on various devices with differing levels of wear and tear enables the evaluation of their resistance to such factors. Analysis using statistical tests Some statistical tests (eg, Chi-squared test, Pearson test, autocorrelation analysis) are used to detect outliers or non-random patterns during testing.</p><p>Testing using multivariate statistical methods allows you to assess the quality of randomness under variable external conditions <ref type="bibr" target="#b18">[19,</ref><ref type="bibr" target="#b19">20]</ref>.</p><p>Testing pseudorandom number generators in real conditions allows you to determine their resistance to various external influences, such as noise, limited resources, and high loads. The analysis results contribute to enhancing generators for use in critical systems like IoT and cryptographic algorithms, thereby ensuring reliable random number generation even in challenging conditions.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Study of the effectiveness of PRNGs</head><p>Investigating the performance of PRNGs for IoT infrastructure applications is an important step in determining their suitability in terms of resources and performance. The primary criteria for assessing efficiency include computational complexity, speed, energy consumption, and memory utilization. Let's examine the key steps along with examples of research and evaluations regarding the effectiveness of various PRNGs. (Table <ref type="table" target="#tab_1">2</ref>). Performance evaluation criteria: Computational complexity. An estimate of the number of operations required to generate one random number. Algorithms of different complexity are studied (linear complexity O(n), logarithmic complexity O(log n), constant complexity O(1)).</p><p>Example: A simple algorithm of congruent HPC has linear complexity since at each step a simple operation of multiplication, addition, and subtraction is performed modulo.</p><p>Speed action. It quantifies the number of random numbers a generator can produce within a given time frame (such as numbers generated per second). Algorithms on different processor architectures are studied: ARM for IoT devices, which often have limited computing power.</p><p>Example: Comparing a classic LCG (Linear Congruent Generator) and a more complex algorithm such as Mersenne Twister can show that LCG has a speed advantage on simple IoT device processors.</p><p>Energy consumption. The total power consumption for random number generation over a certain time or number of operations is measured. Important for batterypowered IoT devices where energy savings are critical.</p><p>Example: Simple algorithms with minimal computing load will be less energy-consuming compared to more complex generators that require a lot of resources for their work.</p><p>Memory usage. The amount of RAM required for the operation of the generator is estimated. In many IoT devices, memory is limited, so memory efficiency is a key factor.</p><p>Example: Algorithms such as LCG require less memory compared to algorithms based on complex tables, such as the Mersenne Twister, which requires large buffers for its operation. For IoT devices, where speed and energy efficiency are crucial, simple generators such as LKG or XORShift demonstrate superior performance in both speed and power consumption. However, in cases where cryptographic robustness is required, CSPRNG, despite the higher resource costs, is a necessary choice.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Description of the random number generation monitoring system</head><p>A random number generation monitoring system should automate data collection, analysis, and visualization processes to ensure real-time control of generation quality and stability. This will effectively detect any deviations from randomness or other anomalies in the operation of PRNGs and hardware generators. Let's consider the main components of the monitoring system (Fig. <ref type="figure" target="#fig_0">1</ref>): Generation quality analysis module. The analysis module assesses the quality of randomness in the collected numbers. It uses statistical methods to detect correlations, and predictable patterns and checks whether the generation meets the criteria of randomness. Methods that can be utilized in this module: Chi-square test and Pearson's test to test for uniform distribution; autocorrelation analysis to check dependencies between numerical sequences; multivariate tests for analyzing correlations between several parameters; Entropy test for evaluating the degree of unpredictability in numbers.</p><p>Visualization module and user interface design. Offers an interface for visualizing monitoring results. The graphical interface should show indicators such as entropy level, distribution uniformity, frequency deviations, and other quality metrics. Types of visualizations that can be implemented: Histograms and distribution graphs that show the distribution of numbers and reveal possible deviations from uniformity; heat maps of correlations that visualize dependencies between different random number generations; real-time monitoring shows current generation performance and quality metrics, allowing for immediate detection of deviations or anomalies.</p><p>Notification and logging module. This module is responsible for logging events and notifying about deviations in the generation. It provides logging of all generation processes and provides the ability to view historical data for in-depth analysis. If serious deviations are detected, the system sends a notification to the administrator or interested parties via email, mobile application, or other means of communication.</p><p>Configuration and settings module. This module enables the configuration of various parameters for the monitoring system, including data collection frequency, alert threshold values, selection of statistical tests for analysis, and user interface settings. The system should support flexible configuration for different types of generators and usage scenarios, allowing it to be adapted to specific needs.</p><p>Reporting system. Automatic generation of detailed reports on the quality of random number generation. These reports can be saved as PDF or other formats, allowing detailed analysis of the generation history and making it available to interested parties. Reports usually include the following factors: randomness metrics, detected deviations, and recommendations for improving the quality of generation.</p><p>The use of a monitoring system is particularly useful for the following industries:</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head></head><p>Cryptographic systems where the reliability of random number generation is critical for security.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head></head><p>IoT devices, where constrained resources may impact the quality of generation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head></head><p>Mobile applications that utilize random number generation for security purposes or gaming.</p><p>Here are the key advantages of the system. Increased reliability. Continuous monitoring ensures the stable operation of generators, helping to avoid failures and anomalies.</p><p>Instant reaction to deviations. Thanks to built-in notifications, the system allows you to quickly react to any failures in the generation process.</p><p>Real-time analysis. The system supports real-time data collection and analysis, which allows you to quickly obtain information about the quality of random numbers.</p><p>This system provides an opportunity to flexibly configure the generation of random numbers to ensure their high quality, convenient visualization, and timely detection of problems in real conditions of use.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Modeling the operation of the</head><p>random number generation monitoring system 6.1. Overview of the system's general algorithm</p><p>Let's examine the key stages of the random number generation monitoring system (Fig. <ref type="figure" target="#fig_2">2</ref>). System initialization. The system is initiated and configured to monitor random number generation. The sources of random number generation, whether software or hardware generators, are identified. Data collection. The system collects numerical sequences from generators in real-time. Data collection is conducted based on pre-defined intervals or events. Data pre-processing. Collected data is sequenced for further analysis. The accuracy of the collected data is verified to ensure there are no omissions or errors.</p><p>Analysis of generation quality. Statistical tests are applied to the collected data to check for randomness:</p><p>Check for anomalies. The analysis results are compared against reference indicators. If deviations or anomalies are identified (indicating non-compliance with randomness criteria), the system triggers a response.</p><p>Decision on anomalies. If no anomalies are detected, the system continues to collect and log data. If anomalies are detected, the system initiates a response procedure.</p><p>Actions when anomalies are detected  Logging and reporting. All monitoring actions and results are stored in logs. The system automatically generates reports on the status of random number generation (daily, weekly, etc.).</p><p>Completion of the cycle. The system ends the current monitoring cycle and starts a new one.</p><p>Periodic audit and optimization. Periodically, the system conducts an in-depth audit of the operation of generators for further improvement of settings or algorithms.</p><p>The algorithm is aimed at automatic quality control of random number generation with minimal user intervention. The system can quickly react to deviations, ensuring stability and reliability of generation in critical systems.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2.">Mathematical model of the system for monitoring the generation of random numbers</head><p>A mathematical model for a random number generation monitoring system can be constructed using several key components. This model should include a process of data collection, random analysis, anomaly detection, and response. Let:</p><p> 𝑋(𝑡) -is a sequence of random numbers generated at time 𝑡.  𝑓(𝑋(𝑡)) -is a function describing the properties of the sequence 𝑋(𝑡), which is responsible for checking its randomness.  𝑇 -is a set of statistical tests for checking randomness (for example, Chi-square test, entropy test).  𝑃 -is the probability of an anomaly occurring in the generation process.  𝐷(𝑡)-is the deviation from the randomness reference values at time 𝑡.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2.1.">Modeling the generation of random numbers</head><p>The generation of random numbers in the system is described as a set of sequences of numbers: 𝑋(𝑡) = {𝑥 , 𝑥 , . . . , 𝑥 }, (1) where 𝑥 ∈ [𝑎, 𝑏] is a single random number within the interval [𝑎, 𝑏], generated at time 𝑡.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2.2.">Modeling the quality of randomness</head><p>The randomness test function 𝑓(𝑋(𝑡)) applies statistical tests to the sequence 𝑋(𝑡). For example, for the Chi-square test:</p><formula xml:id="formula_0">𝑓 (𝑋(𝑡)) = (𝑂 − 𝐸 ) 𝐸 ,<label>(2)</label></formula><p>where 𝑂 are the observed frequencies of random numbers, 𝐸 are the expected frequencies of random numbers. The test results are compared against critical values. If the result surpasses the 𝜒 threshold, this indicates a deviation from a uniform distribution, and an anomaly is recorded.</p><p>Other tests (for example, the entropy test 𝐻(𝑋)) can estimate the level of entropy:</p><formula xml:id="formula_1">𝐻(𝑋) = 𝑝(𝑥 ) log 𝑝(𝑥 ),<label>(3)</label></formula><p>where 𝑝(𝑥 ) is the probability of the number 𝑥 appearing.</p><p>A high entropy means a more random sequence.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2.3.">Modeling the probability of occurrence of anomalies</head><p>The probability of an anomaly occurring, denoted as 𝑃 , is influenced by the extent to which the test results deviate from the reference values. If the deviation function 𝐷(𝑡)exceeds the permissible value 𝐷 , an anomaly is considered to have occurred: 𝑃 = 𝑃(𝐷(𝑡) &gt; 𝐷 ).</p><p>(4) Here 𝐷(𝑡) = 𝑓(𝑋(𝑡)) − 𝑓 (𝑋) , where 𝑓 (𝑋)-the reference value of the randomness function.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2.4.">Modeling the response of the system</head><p>If the probability of an anomaly exceeds the permissible 𝑃 &gt; 𝑃 , the system goes into response:</p><formula xml:id="formula_2"> Notification:</formula><p>The system generates a notification for the operator.  Automatic intervention: It is possible to restart the generator or connect a backup source of random number generation.</p><p>Formally, the reaction process can be described as follows:</p><formula xml:id="formula_3">𝑅(𝑡) = 0, 𝑃 ≤ 𝑃 1, 𝑃 &gt; 𝑃 ,<label>(5)</label></formula><p>where 𝑅(𝑡) is the system response at time 𝑡 (0-normal operation, 1-intervention or notification).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2.5.">Modeling the logging and reporting process</head><p>To provide historical analytics, the system keeps a log of all data stored in the form: 𝐿(𝑡) = {𝑋(𝑡) , 𝑓(𝑋(𝑡)), 𝑃 , 𝑅(𝑡)}.</p><p>(6) This log allows you to track all events related to the generation of random numbers and generate reports to analyze the monitoring results.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.2.6.">General mathematical model</head><p>Mathematically, the model of the random number generation monitoring system can be represented as a set of functions:</p><p>1. Generation of a sequence of random numbers 𝑋(𝑡) = {𝑥 , 𝑥 , . . . , 𝑥 }.</p><p>Evaluation of the quality of randomness using tests:</p><formula xml:id="formula_5">𝑓 (𝑋(𝑡)) = ∑ ( ) , 𝐻(𝑋) = 𝑝(𝑥 ) log 𝑝(𝑥 ).<label>(8) 3.</label></formula><p>Probability of anomaly:</p><formula xml:id="formula_6">𝑃 = 𝑃(𝐷(𝑡) &gt; 𝐷 ).<label>(9) 4.</label></formula><p>System reaction:</p><formula xml:id="formula_7">𝑅(𝑡) = 0, 𝑃 ≤ 𝑃 1, 𝑃 &gt; 𝑃 .<label>(10) 5.</label></formula><p>Logging and storage of results:</p><p>𝐿(𝑡) = {𝑋(𝑡) , 𝑓(𝑋(𝑡)), 𝑃 , 𝑅(𝑡)}.</p><p>(11) This mathematical model allows for building a system that automatically collects, analyzes, and controls the quality of random number generation in real-time, providing visualization and responding to anomalies.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Overview of the software 7.1. Library of statistical tests</head><p>The library of statistical tests is a component of the monitoring server but can be used as a separate product if necessary. The simplest method to utilize it is by adding a ".jar" file to the project during compilation. However, it is advisable to use tools like "Maven" or "Gradle" for automating tasks within Java projects. This avoids manually downloading and compiling the project with the library and is a safer approach.</p><p>In Maven, you need to define a new repository "jitpack.io" and add the library as a dependency (Fig. <ref type="figure">3</ref>).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure 3: Import the library using Maven</head><p>The process is almost identical for Gradle, but the repository should be slightly different. The library does not contain any configuration parameters or settings that must be made before use, so you can perform statistical tests (Fig. <ref type="figure">3</ref>) simply by calling methods on the library classes.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.2.">Monitoring server</head><p>The monitoring server can be used locally for testing, but it is likely to be more useful to deploy it in a cluster, cloud environment, or on local servers in a network where client applications are already deployed (or planned to be deployed in the future).</p><p>A simple and working solution would be to use a docker container to deploy the server.</p><p>Just like the integration library, the server has several environment variables used for mail and database connections. They must be specified for correct operation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.3.">Web application</head><p>The web application does not contain a "Home Page" per se, so the user will be immediately redirected to the "Random Numbers" page (Fig. <ref type="figure" target="#fig_3">4</ref>). This page can be conventionally divided into 2 parts-a random number filter and a table with random numbers.  The panels under the heading "Graphs" contain 5 graphs. In Fig. <ref type="figure" target="#fig_4">5</ref> you can see two of them-the number of random numbers processed by the server and the distribution of random numbers by client programs. Additionally, the program features a graph that shows the distribution of random numbers by values for each label. This can help identify whether a generator has a flaw that causes it to produce an excess or deficiency of random numbers within a specific range.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="8.">Recommendations for improving the reliability of generators</head><p>Based on the monitoring and testing results, we will develop recommendations for enhancing random number generation algorithms, focusing on methods to improve their stability and performance in critical systems.</p><p>To boost the reliability of random number generators, the following recommendations can be made based on these findings.</p><p>Improvement of algorithmic stability of generators.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head></head><p>Use of cryptographically stable generators (CSPRNG). Utilizing generators based on cryptographic algorithms, such as AES or SHA, ensures reliable randomness, even in critical systems like secure communication or data protection.  Update generation algorithms. Consistently update and optimize generators to address emerging attacks or vulnerabilities. This includes improvements to pseudo-random generators such as Xorshift, Mersenne Twister, or newer variants based on block ciphers.</p><p>Protection against the influence of external factors.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head></head><p>Addition of noise sources (entropy pool). It is important to supplement generators with external sources of randomness (for example, noise from sensors, and physical processes), which will increase the resistance of the generator to predictable attacks or distortions due to the reduction of internal entropy.  Input quality monitoring. Automated control of input entropy level and periodic updating of noise sources can prevent generation randomness from decreasing.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Minimization of correlations and predictability</head><p> Regular verification of correlation between generations: Applying statistical tests to verify the correlation between sequences of numbers will help to identify and eliminate patterns that reduce the reliability of the generator.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head></head><p>Increasing the number of random bits: To increase robustness, it is recommended to generate a larger number of random bits from different independent sources, which reduces the chances of correlation or predictability of the results.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Durability testing in real conditions</head><p> High-load and stress-testing: It is important to regularly test generators under real-world operating conditions, particularly in high-load and resource-constrained (power, memory) situations, to verify their robustness.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head></head><p>Integration with monitoring systems: The creation of systems that automatically monitor the operation of generators in real time allows timely detection of possible failures or loss of randomness.</p><p>Backup and restoration of the generation system These guidelines will enhance the reliability of pseudorandom number generators, particularly in critical systems like cryptographic algorithms, IoT security, and other fields where the quality of randomness is essential for the security and stable operation of systems.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="9.">Conclusions</head><p>Random number generators are an important tool for solving a variety of simulation, numerical methods, cryptography, and programming problems. Generation facilities can adopt one of several available approaches, each with its strengths and weaknesses. Nevertheless, the most critical feature of generators is their capacity to produce truly random numbers, as the security of cryptographic applications and the efficiency and speed of numerical applications hinges on the randomness of these numbers.</p><p>Utilizing generation tools necessitates prior research through statistical tests and cryptographic attacks to ensure confidence in the quality of the generated numbers and the security of the tool. During operation, generators sometimes show worse performance than was obtained during initial tests. This may be due to problems in the entropy source, incorrect application, or software implementation. Depending on the generator's specific task, implementing a monitoring system is advisable to identify and address potential defects promptly. The created monitoring system provides the functions of monitoring the operation of generation means and alerting in case of exceptional situations. Programs or hardware devices connect to a centralized server and send random numbers generated by them for statistical testing and storage for future research. The monitoring system consists of the following components:</p><p>A library including 15 NIST tests and 8 multivariate statistics tests. The NIST statistical tests are a comprehensive approach to the verification of random numbers and means of their generation, while the methods of multivariate statistics complement them by providing the possibility to verify short sequences of bits.</p><p>An integration library designed to quickly connect a monitoring server and generators or applications containing random number generators. Application integration is done only with the use of metadata and configuration.</p><p>The monitoring server primarily functions to aggregate random numbers transmitted by client programs, along with their pre-processing and storage in the database. Additional features include various settings for tracking and notification processes, as well as detailed reports and realtime random number testing.</p><p>A web application that is completely based on the functions and application interface of the monitoring server and is designed to provide a convenient interface for users.</p><p>The monitoring system is recommended to be used in the case of operation or research of several generators of random numbers and sequences created by them at random. Practical application of the product is possible in:</p><p>Cryptography, development, and maintenance of software products and hardware-tracking the operation of autonomous random number generators and programs that use built-in generators;</p><p>Scientific research-simultaneous statistical testing of several random number generators, development and testing of new random number generators.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: The main components of the monitoring system Data collection module. This module gathers data from various random number generation sources, including both PRNGs and hardware generators. Data can be collected from local or remote generating systems. The module facilitates real-time data collection, in addition to storing historical data for subsequent analysis. Data sources can be generators in cryptographic systems, IoT devices, mobile applications, or other systems that rely on PRNG.Generation quality analysis module. The analysis module assesses the quality of randomness in the collected numbers. It uses statistical methods to detect correlations, and predictable patterns and checks whether the generation meets the criteria of randomness. Methods that can be utilized in this module: Chi-square test and Pearson's test to test for uniform distribution; autocorrelation analysis to check dependencies between numerical sequences; multivariate tests for analyzing correlations between several parameters; Entropy test for evaluating the degree of unpredictability in numbers.Visualization module and user interface design. Offers an interface for visualizing monitoring results. The graphical interface should show indicators such as entropy level, distribution uniformity, frequency deviations, and other quality metrics. Types of visualizations that can be implemented: Histograms and distribution graphs that show the distribution of numbers and reveal possible deviations from uniformity; heat maps of correlations that visualize dependencies between different random number generations; real-time monitoring shows current generation performance and quality metrics, allowing for immediate detection of deviations or anomalies.</figDesc><graphic coords="4,87.12,256.08,187.68,129.36" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head></head><label></label><figDesc>Notification: the system alerts the administrator or the individual responsible for security systems about any identified issues.  Automatic actions: an adjustment attempt is possible (restarting the generator or changing the entropy source).  Problem logging: details of the anomaly are captured for further analysis.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: The main stages of the general scheme of the random number generation monitoring system</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Graph of the number of random numbers processed by the server In the upper right corner of the screen, there is a form that enables you to adjust the time parameters of the graphs and display values for the past hour, day, week, or month, as well as select grouping by labels or programs.</figDesc><graphic coords="7,73.68,158.64,214.32,76.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: The graph illustrating the distribution of random numbers by client programs</figDesc><graphic coords="7,73.68,326.88,215.04,158.64" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>Types of generators testing for resistance to external factors</figDesc><table><row><cell>Type</cell><cell>Problem</cell><cell>Testing</cell></row><row><cell>Noise immunity</cell><cell></cell><cell></cell></row><row><cell>testingм</cell><cell></cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2</head><label>2</label><figDesc>Evaluating the effectiveness of various PRNGs</figDesc><table><row><cell>PRNG</cell><cell>Complexity</cell><cell>Speed (numb./sec)</cell><cell>Energy consumption (mW)</cell><cell>Memory usage (kB)</cell></row><row><cell>LCG</cell><cell>𝑂(1)</cell><cell>10^6</cell><cell>50</cell><cell>2</cell></row><row><cell>Mersenne Twister</cell><cell>𝑂(𝑛)</cell><cell>10^4</cell><cell>150</cell><cell>10</cell></row><row><cell>XORShift</cell><cell>𝑂(1)</cell><cell>10^5</cell><cell>70</cell><cell>3</cell></row><row><cell>CSPRNG</cell><cell>𝑂(𝑛 )</cell><cell>10^3</cell><cell>200</cell><cell>20</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Methods of the Objects Identification and Recognition Research in the Networks with the IoT Concept Support</title>
		<author>
			<persName><forename type="first">O</forename><surname>Shevchenko</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Cybersecurity Providing in Information and Telecommunication Systems</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="volume">2923</biblScope>
			<biblScope unit="page" from="277" to="282" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Platform for the Security of Cyber-Physical Systems and the IoT in the Intellectualization of Society</title>
		<author>
			<persName><forename type="first">V</forename><surname>Dudykevych</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Workshop on Cybersecurity Providing in Information and Telecommunication Systems, CPITS</title>
				<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="volume">3654</biblScope>
			<biblScope unit="page" from="449" to="457" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">A True Random Number Generator Based on Gait Data for the Internet of You</title>
		<author>
			<persName><forename type="first">C</forename><surname>Camara</surname></persName>
		</author>
		<idno type="DOI">10.1109/ACCESS.2020.2986822</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="page" from="71642" to="71651" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Guidelines for the Design of Random Telegraph Noise-based True Random Number Generators</title>
		<author>
			<persName><forename type="first">T</forename><surname>Zanotti</surname></persName>
		</author>
		<idno type="DOI">10.1109/TDMR.2024.3394576</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Device and Materials Reliability</title>
		<imprint>
			<biblScope unit="volume">24</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="184" to="193" />
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Evaluation of Cryptographically Secure Pseudo Random Number Generators for Post Quantum Era</title>
		<author>
			<persName><forename type="first">A</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mishra</surname></persName>
		</author>
		<idno type="DOI">10.1109/I2CT54291.2022.9824543</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE 7 th International Conference for Convergence in Technology (I2CT)</title>
				<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Acceptance and Random Generation of Event Sequences under Real Time Calculus Constraints</title>
		<author>
			<persName><forename type="first">K</forename><surname>Banerjee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Dasgupta</surname></persName>
		</author>
		<idno type="DOI">10.7873/DATE.2014.267</idno>
	</analytic>
	<monogr>
		<title level="m">Design, Automation &amp; Test in Europe Conference &amp; Exhibition</title>
				<meeting><address><addrLine>DATE</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2014">2014</date>
			<biblScope unit="page" from="1" to="6" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Design Automation of Single Photon Counting Method for Quantum Random Number Generation</title>
		<author>
			<persName><forename type="first">D</forename><surname>Novazrianto</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICoICT52021.2021.9527529</idno>
	</analytic>
	<monogr>
		<title level="m">9 th International Conference on Information and Communication Technology (ICoICT)</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="411" to="416" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Low-Latency Reconfigurable Entropy Digital True Random Number Generator with Bias Detection and Correction</title>
		<author>
			<persName><forename type="first">L</forename><surname>Carreira</surname></persName>
		</author>
		<idno type="DOI">10.1109/TCSI.2019.2960694</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Circuits and Systems I: Regular Papers</title>
		<imprint>
			<biblScope unit="volume">67</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="1562" to="1575" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">A Novel Pseudo-Random Number Generator Algorithm based on Entropy Source Epoch Timestamp</title>
		<author>
			<persName><forename type="first">D</forename><surname>Origines</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sison</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Medina</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICOIACT46704.2019.8938509</idno>
	</analytic>
	<monogr>
		<title level="m">International Conference on Information and Communications Technology (ICOIACT)</title>
				<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="50" to="55" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">NIST&apos;s Post-Quantum Cryptography Standards Competition</title>
		<author>
			<persName><forename type="first">B</forename><surname>Schneier</surname></persName>
		</author>
		<idno type="DOI">10.1109/MSEC.2022.3184235</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Security &amp; Privacy</title>
		<imprint>
			<biblScope unit="volume">20</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="107" to="108" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Quantum random number generators</title>
		<author>
			<persName><forename type="first">М</forename><surname>Herrero-Collantes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">C</forename><surname>Garcia-Escartin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Reviews of Modern Physics</title>
		<imprint>
			<biblScope unit="volume">89</biblScope>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">An Asynchronous and Low-Power True Random Number Generator using STT-MTJ</title>
		<author>
			<persName><forename type="first">B</forename><surname>Perach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kvatinsky</surname></persName>
		</author>
		<idno type="DOI">10.1109/ISCAS45731.2020.9181042</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE International Symposium on Circuits and Systems (ISCAS)</title>
				<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="1" to="11" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">A New Side Channel Resistant Hybrid PUF Based Light Weight True Random Number Generator</title>
		<author>
			<persName><forename type="first">B</forename><surname>Narayanapuram</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Panda</surname></persName>
		</author>
		<idno type="DOI">10.1109/TEMSMET56707.2023.10150018</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE 3 rd International Conference on Technology, Engineering, Management for Societal Impact using Marketing, Entrepreneurship and Talent (TEMSMET)</title>
				<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="1" to="6" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Quantum Random Number Cloud Platform</title>
		<author>
			<persName><forename type="first">L</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zhou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Feng</surname></persName>
		</author>
		<idno type="DOI">10.1038/s41534-021-00442-x</idno>
	</analytic>
	<monogr>
		<title level="j">NPJ Quantum Information</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="issue">107</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Security on Cloud Computing Using Pseudo-random Number Generator Along with Steganography</title>
		<author>
			<persName><forename type="first">M</forename><surname>Sharma</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-030-36178-5_54</idno>
	</analytic>
	<monogr>
		<title level="j">Artificial Intelligence and Applied Mathematics in Engineering Problems</title>
		<imprint>
			<biblScope unit="volume">43</biblScope>
			<biblScope unit="page" from="654" to="665" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Automation of Data Management Processes in Cloud Storage</title>
		<author>
			<persName><forename type="first">V</forename><surname>Shapoval</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Workshop on Cybersecurity Providing in Information and Telecommunication Systems, CPITS</title>
				<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="volume">3654</biblScope>
			<biblScope unit="page" from="410" to="418" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Automated Conformity Verification Concept for Cloud Security</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Martseniuk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Workshop on Cybersecurity Providing in Information and Telecommunication Systems, CPITS</title>
				<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="volume">3654</biblScope>
			<biblScope unit="page" from="25" to="37" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Bandwidth Research of Wireless IoT Switches</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Hu</surname></persName>
		</author>
		<idno type="DOI">10.1109/tcset49122.2020.2354922</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE 15 th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering</title>
				<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="546" to="550" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Joint Distribution of Some Statistics of Random Bit Sequences</title>
		<author>
			<persName><forename type="first">V</forename><surname>Masol</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Popereshnyak</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="volume">57</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="139" to="145" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Checking the Randomness of Bits Disposition in Local Segments of the (0, 1)-Sequence</title>
		<author>
			<persName><forename type="first">V</forename><surname>Masol</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Popereshnyak</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Cybernetics and Systems Analysis</title>
		<imprint>
			<biblScope unit="volume">56</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="513" to="520" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
