Random numbers play an important role in many areas, for example, encryption, cryptography, static analysis, simulations.It is also a fundamental resource in science and engineering.There are algorithmically generated numbers that are similar to random distributions, but are not actually random, called pseudo random number generators.In many cases the tasks to be solved are based on the unpredictability of random numbers, which cannot be guaranteed in the case of pseudo random number generators, true randomness is required.In such situations, we use real random number generators whose source of randomness is unpredictable random events.Quantum Random Number Generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements.Our goal is to generate fast random numbers at a lower cost.At the same time, a high level of randomness is essential.Through quantum mechanics, we can obtain true numbers using the unpredictable behavior of a photon, which is the basis of many modern cryptographic protocols.It is essential to trust cryptographic random number generators to generate only true random numbers.This is why certification methods are needed which will check both the operation of the device and the quality of the random bits generated.We present the improved novel quantum random number generator, which is based the on time of arrival QRNG.It uses the simple version of the detectors with few requirements.The novel QRNG produces more than one random bit per each photon detection.It is rather efficient and has a high level of randomness.Self-testing as well as device independent quantum random number generation methods are analyzed.The advantages and disadvantages of both methods are identified.The model of a novel semi self-testing certification method for quantum random number generators (QRNG) is offered in the paper.This method combines different types of certification approaches and is rather secure and efficient.Finally, the novel certification method is integrated into the model of the new quantum random number generator.The paper analyzes its security and efficiency.
Random numbers play an important role in many areas, for example, encryption, cryptography, static analysis, simulations.It is also a fundamental resource in science and engineering.There are algorithmically generated numbers that are similar to random distributions, but are not actually random, called pseudo random number generators.In many cases the tasks to be solved are based on the unpredictability of random numbers, which cannot be guaranteed in the case of pseudo random number generators, true randomness is required.In such situations, we use real random number generators whose source of randomness is unpredictable random events.Quantum Random Number Generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements.Our goal is to generate fast random numbers at a lower cost.At the same time, a high level of randomness is essential.Through quantum mechanics, we can obtain true numbers using the unpredictable behavior of a photon, which is the basis of many modern cryptographic protocols.It is essential to trust cryptographic random number generators to generate only true random numbers.This is why certification methods are needed which will check both the operation of the device and the quality of the random bits generated.We present the improved novel quantum random number generator, which is based the on time of arrival QRNG.It uses the simple version of the detectors with few requirements.The novel QRNG produces more than one random bit per each photon detection.It is rather efficient and has a high level of randomness.Self-testing as well as device independent quantum random number generation methods are analyzed.The advantages and disadvantages of both methods are identified.The model of a novel semi self-testing certification method for quantum random number generators (QRNG) is offered in the paper.This method combines different types of certification approaches and is rather secure and efficient.Finally, the novel certification method is integrated into the model of the new quantum random number generator.The paper analyzes its security and efficiency.
The subject matter of the article is pseudo-random number generators. Random numbers play the important role in cryptography. Using not secure pseudo-random number generators is a very common weakness. It is also a fundamental resource in science and engineering. There are algorithmically generated numbers that are similar to random distributions but are not random, called pseudo-random number generators. In many cases the tasks to be solved are based on the unpredictability of random numbers, which cannot be guaranteed in the case of pseudo-random number generators, true randomness is required. In such situations, we use real random number generators whose source of randomness is unpredictable random events. Quantum Random Number Generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements. The goal is to develop a mathematical model of the generator, which generates fast random numbers at a lower cost. At the same time, a high level of randomness is essential. Through quantum mechanics, we can obtain true numbers using the unpredictable behavior of a photon, which is the basis of many modern cryptographic protocols. It is essential to trust cryptographic random number generators to generate only true random numbers. This is why certification methods are needed which will check both the operation of the device and the quality of the random bits generated. The goal of the research is also to develop the model of a hybrid semi self-testing certification method for quantum random number generators (QRNG). The tasks to be solved are to create the mathematical model of a random number generator, which generates the fast random numbers at a lower cost. To create the mathematical model of a hybrid semi self-testing certification method for quantum random number generators. To integrate a hybrid semi self-testing certification method to the hybrid random number generator. the methods used are mathematical optimization and simulation. The following results were obtained: we present the improved hybrid quantum random number generator, which is based on QRNG, which uses the time of arrival of photons. The model of a hybrid semi self-testing certification method for quantum random number generators (QRNG) is offered in the paper. This method combines different types of certification approaches and is rather secure and efficient. Finally, the hybrid certification method is integrated into the model of the new quantum random number generator. Conclusions. The scientific novelty of the results obtained is as follows: 1. The hybrid quantum random number generator is offered, which is based on QRNG, which uses the time of the arrival of photons. It uses the simple version of the detectors with few requirements. The hybrid QRNG produces more than one random bit per the detection of each photon. It is rather efficient and has a high level of randomness. 2. The hybrid semi self-testing certification method for quantum random number generators (QRNG) is offered. The Self-testing, as well as device-independent quantum random number generation methods, are analyzed. The advantages and disadvantages of both methods are identified. Based on the result the hybrid method is offered. 3. The hybrid semi self-testing certification method for quantum random number generators is integrated into the offered model of the quantum random number generator. The paper analyzes its security and efficiency. The paper offers to use the new random number generator in the crypto-schemes.
Random numbers are a fundamental resource in science and engineering, and are also widely used in many fields, such as simulation, cryptography, lotteries, fundamental science. There are algorithmically generated numbers that look like random numbers but are not truly random. These pseudo random numbers are generated from a computer, using deterministic algorithms. Because, we cannot use pseudo random generators in situations, where true randomness is necessary, we use true random number generators. In this case, we use unpredictable random events as a random source. Quantum random number generators (QRNG) output true random numbers based on inherent randomness in quantum measurements. Our goal is to generate fast random numbers at a lower cost. At the same time, a high level of randomness is essential. We present the improved novel quantum random number generator, which is based the on time of arrival QRNG. It is rather efficient, as it uses the simple version of the detectors with rather few requirements. The novel QRNG produces more than one random bit per each photon detection.
Random numbers have many uses, but finding true randomness is incredibly difficult. Therefore, quantum mechanics is used, using the essentially unpredictable behavior of a photon, to generate truly random numbers that form the basis of many modern cryptographic protocols. It is essential to trust cryptographic random number generators to generate only true random numbers. This is why certification methods are needed which will check both the performance of our device and the quality of the random bits generated. Self-testing as well as device independent quantum random number generation methods are analyzed in the paper. The advantages and disadvantages of both methods are identified. The model of a novel semi self-testing certification method for quantum random number generators is offered in the paper. This method combines different types of certification approaches and is rather secure and efficient. The method is very important for computer science, because it combines the best features from selftesting and device independent methods. It can be used, when the random numbers’ entropy depends on the device and when it does not. In the related researches, these approaches are offered to be used separately, depending on the random number generator. The offered novel certification technology can be properly used, when the device is compromised or spoiled. The technology can successfully detect unintended irregularities, operational problems, abnormalities and problems in the randomization process. The offered mythology assists to eliminate problems related to physical devices. The offered system has the higher certification randomness security and is faster than self-testing approaches. The method is rather efficient because it implements the different certification approaches in the parallel threads. The offered techniques make the offered research must more efficient than the other existing approaches. The corresponding programming simulation is implemented by means of the simulation techniques.
Quantum random number generators (QRNGs) use the inherent unpredictability of quantum mechanics to generate true randomness, as opposed to classical random number generators. However, ensuring the authenticity of this randomness still requires robust verification. Self-testing QRNGs address this need by enabling the validation of the randomness produced based on the observed data from the experiment while requiring few assumptions. In this work, we present a practical, self-testing QRNG designed to operate with an untrusted measurement device and a partially characterized source, allowing the user to check the adequate functioning of the setup in real time. Our experiment yields a rate of certified random bits of 450 kbps.
Random Number Generators (RNGs) are used in various applications, including cryptography, scientific simulations, gaming, and virtual reality. The quality of these random numbers is crucial, especially for computational approaches that rely on unpredictability to produce accurate results. In this thesis, we perform a comprehensive assessment of the quality of a novel Quantum Random Number Generator (QRNG) based on single photon. QRNGs leverage quantum mechanical properties to produce truly random numbers. This ensures high entropy, unpredictability, and security, making QRNGs particularly useful in fields that require high-quality randomness.We evaluate the statistical properties of strings generated by our QRNG and then its practical application by comparing it to traditional Pseudo-Random Number Generators (PRNGs) in Monte Carlo Integration (MCI), a technique that estimates integrals using random sampling. In particular, we use two statistical randomness test suits, namely NIST and Dieharder, to assess the statistical properties of our QRNG. All tests within these tests were passed, confirming that the corresponding QRNG achieves true randomness with sufficient high entropy. Next, we use our QRNG-generated numbers to seed Monte Carlo Integration (MCI) and compare it against results obtained using classical PRNG. The QRNG-based MCI demonstrated more accurate and stable numerical estimates, showing lower error rates and improved convergence compared to PRNG-based simulations.These findings highlight the advantages of QRNGs in enhancing numerical accuracy and computational security. While QRNGs may have slower generation rates than PRNGs, their superior randomness quality allows for more reliable Monte Carlo-based simulations, suggesting that fewer samples may be needed to achieve the same level of accuracy compared to classical PRNGs. This research underscores the potential of QRNG-powered numerical methods, paving the way for their integration into more advanced applications, including scientific computing, financial modeling, and cryptographic security.
This paper explores the design of cryptographic algorithms leveraging the inherent randomness of quantum random number generators (QRNGs). Traditional cryptographic algorithms often rely on pseudo-random number generators (PRNGs), which are deterministic and therefore vulnerable to attacks if their internal state is compromised. QRNGs, on the other hand, derive their randomness from quantum mechanical phenomena, offering a fundamentally unpredictable source of numbers. This research investigates the application of QRNGs to enhance cryptographic security, focusing on constructing algorithms that exploit this unique property. The core claim is that utilizing QRNG characteristics allows for the design of more secure cryptographic algorithms. The proposed mechanism involves capitalizing on the non-deterministic nature of QRNGs to build algorithms with heightened security levels. This approach presents a novel security guarantee method by incorporating true randomness into cryptographic processes. We examine specific algorithm designs and analyze their security implications compared to traditional PRNG-based approaches. The paper concludes with a discussion on the challenges and future directions of utilizing QRNGs in cryptography.