In mathematics and computer science, random numbers have the role of a resource for assisting proofs, making cryptography secure, and enabling computational protocols. This role motivates efforts to produce random numbers as a physical process. Potential physical sources abound, but arguably the most fundamental are those based on elementary quantum mechanical processes. This review discusses the current status of devices that generate quantum random numbers.
In mathematics and computer science, random numbers have the role of a resource for assisting proofs, making cryptography secure, and enabling computational protocols. This role motivates efforts to produce random numbers as a physical process. Potential physical sources abound, but arguably the most fundamental are those based on elementary quantum mechanical processes. This review discusses the current status of devices that generate quantum random numbers.
Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.
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.
Quantum information science has completely changed the way we think about and process information. From the simple realization that information is physical, we have been able to use the peculiar features of quantum mechanical phenomena to our advantage. Designing algorithms whose performance exceeds those running on classical computers, and performing secret communication whose security can actually be proven from sound assumptions are two main catalysts for the establishment of the field. This thesis discusses some progress in quantum key distribution and quantum randomness generation. Quantum key distribution, which is motivated by the increasing need to communicate securely, is on the verge of becoming an established technology. With the goal of extending the reach of quantum key distribution to more realistic scenarios, we present a study on reference-frame-independent protocols whose knowledge can help design more efficient protocols, and a framework to the security analysis of distributed-phase-reference protocols, which have been missing for many years. This allows these protocols to be used in practice against the most general adversary, although the key rate is rather pessimistic. In quantum randomness generation, the amount of extractable randomness from a quantum system depends on the level of trust or characterization of the devices; we present a study into such interaction. In the extreme situation of distrust, i.e. device-independent scenarios, we study the effect of the input randomness on the certifying power of such scenarios, and realize that one cannot amplify an arbitrary min-entropy source device-independently. Finally we discuss the amount of randomness in post-selected data, which has consequences on practical randomness generation protocols. The in depth study of randomness generation from quantum processes is well justified by the important role of randomness in modern computer science and other fields.
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
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 is essential in cryptography for key generation and secure information exchange, ensuring confidentiality and protection. Quantum Random Number Generators (QRNGs) leverage quantum mechanics to produce truly random numbers, offering a major advantage over Pseudo Random Number Generators (PRNGs), which are slower and less secure due to their deterministic nature. Quantum computing boosts QRNG efficiency, making them ideal for cryptographic applications, such as secure key exchange and encrypted communication. QRNGs generate stronger encryption systems by utilizing quantum phenomena like Bloch sphere rotations. The integration of machine learning (ML) with QRNGs further enhances their effectiveness, optimizing random sequences for improved speed and security. This combination of QRNGs and ML provides a powerful approach to cryptography, ensuring more secure communication channels and better protection against potential attacks.