Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.
Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.
Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.
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.
Randomness occurs in every kind of application in which random events should be experienced such as gambling, statistical calculations, computer simulations, information security and encryption. The quality of randomness is very important for the events using randomness. In particular, the need for random numbers used in the field of cryptology to be unpredictable increases the importance of random number generators. \n \nRandom Number Generators (RNGs) are software or hardware components that can be used to generate numbers that cannot be predicted in any pattern or relationship. Software-based RNGs are deterministic applications, while hardware-based RNGs are the devices that can be integrated into the system. \n \nEncryption using numbers generated by software-based RNG can be broken in varying times depending on the strength of the encryption because it was developed in deterministic ways. It is expected that the decoding time will be shortened considerably by the quantum computers which are tried to be developed today besides classic computers that takes a long time to analyze. The hardware RNGs are more powerful in randomness quality than software-based generators, but cost-effective and use-limited generators. \n \nQuantum Random Number Generators (QRNGs) is a kind of generator based on quantum physics laws instead of classical physics. In photonic based QRNGs are produced the random numbers after various software and hardware operations by taking advantage of the uncertainty of photons. These generated numbers are unpredictably strong random numbers. \n \nIn this study, a QRNG was obtained by using the RGB (Red-Green-Blue) values of the images taken from a white-single LED light source and the randomness tests of the produced numbers were carried out with the tests provided by NIST (National Institute of Standards and Technology). As a result, the numbers derived from the images successfully passed NIST tests and true random number sequences were obtained.
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.
Web services of quantum random number generators (QRNG) open new opportunities for enhancing the resilience of cryptographic systems due to their ability to generate true random numbers based on quantum effects. Unlike pseudo-random number generators (PRNG), the QRNG ensures a high level of unpredictability in output data, making them critical components in modern security systems. However, their implementation is accompanied by significant challenges, particularly due to potential attacks at the software level and during integration with hardware infrastructure. At the software level, major threats include attacks on cryptographic libraries, substitution or manipulation of runtime output data, and side-channel attacks exploiting information leaks from physical number generation processes. At the hardware level, risks arise from equipment defects, failures in integration processes, or improper operation of the QRNG in combination with other systems. This study provides a classification of the main types of attacks on QRNG web services, presents an analysis of existing attacks, and introduces modern approaches to their prevention. Among the key solutions are the certification of the QRNG during development and deployment, multi-factor verification of output data to ensure unpredictability, and the use of monitoring systems with artificial intelligence algorithms for anomaly detection. Special attention is given to hybrid protection methods that combine the QRNG with quantum key distribution (QKD) and post-quantum cryptographic algorithms, allowing for the mitigation of risks from both classical and quantum attacks. Thus, a comprehensive combination of software and hardware security methods will enhance the reliability of QRNG and their resilience to modern threats. Further research should focus on the implementation of unified standards for QRNG and the optimization of their integration into existing cryptographic systems.
Cybersecurity contains three basic features such as confidentiality, integrity and availability. Data confidentiality ensuring by encryption has faced quantum computing threat, but this problem can be solved by using post-quantum cryptography and / or quantum cryptography (quantum key distribution). For cryptographic applications statistical properties of the generated pseudorandom sequences should not be differ from random sequences. To determine such properties a number of statistical testing methods are used, but they all are focused on the evaluation of binary sequences. In quantum cryptography there are some protocols with Q-trits (qutrits), but these sequences cannot be assessed effectively by binary statistic methods. From this position in the paper quality assessment approach for Q-trits pseudo random number generators and formed sequences was proposed. Also the experimental study of proposed approach (in comparison with NIST STS) was carried out. Given results show that NIST STS technique cannot be used to evaluate the quality of the Q-trit sequences and generators, but developed method is suitable to use in practice for evaluating Q-trit sequences (generators) quality.