Quantum mechanical phenomena are revolutionizing classical engineering fields such as signal processing or cryptography. When randomness plays an important role, like in cryptography where random bit sequences guarantee certain levels of security, quantum mechanical phenomena allow new ways of generating random bit sequences. Such sequences have a lot of applications in the communication sector, e.g., regarding data transmission, simulation, sensors or radars, and beyond. They can be generated deterministically (e.g., by using polynomials, resulting in pseudo-random sequences) or in a non-deterministic way (e.g., by using physical noise sources like external devices or sensors, resulting in random sequences). Important characteristics of such binary sequences can be modelled by gap processes in conjunction with the probability theory. Recently, all-optical approaches have attracted a lot of research interest. In this work, an adaptation of the quantum key distribution setup is utilized for generating randomised bit sequences. The simulation results show that all-optically generated sequences very well resemble the theoretically ideal probability density characteristic. Additionally, an experimental optical setup is developed that confirms the simulation results. Furthermore, m-sequences show very promising results as well as Gold sequences. Additionally, the level of burstiness, i.e., the distribution of ones and zeros throughout the sequence, is studied for the different sequences. The results enable the finding that generator polynomials with concentrated non-zero coefficients lead to more bursty bit sequences.
A physical random number generator based on the intrinsic randomness of quantum mechanics is described. The random events are realized by the choice of single photons between the two outputs of a beamsplitter. We present a simple device, which minimizes the impact of the photon counters ’ noise, dead-time and after pulses. Random numbers are employed today as well for numerical simulations as for cryptography. Unfortunately computers are not able to generate true random numbers, as they are deterministic systems. Numerical pseudo-random generators rely on complexity [1]. Although such pseudo-random numbers can generally be employed for numerical computation, such as Monte-Carlo simulations, their use in cryptography, for example to generate keys, is more critical. The only way to get true random numbers, hence true security for crypto-systems, is to build a generator based on a random physical phenomenon [2,3,4]. As quantum theory is intrinsically random, a quantum process is an ideal base for a physical random number generator. The randomness of a sequence of numbers can be extensively tested, though not proven. It is thus of interest to thoroughly understand the behavior of the random process, so as to gain
Quantum mechanical phenomena are revolutionizing classical engineering fields such as signal processing or cryptography. When randomness plays an important role, like in cryptography where random bit sequences guarantee certain levels of security, quantum mechanical phenomena allow new ways of generating random bit sequences. Such sequences have a lot of applications in the communication sector and beyond. They can be generated deterministically (e.g. by using polynomials, resulting in pseudo-random sequences) or in a non-deterministic way (e.g. by using physical noise sources like external devices or sensors, resulting in random sequences). Important characteristics of such binary sequences can be modelled by gap processes in conjunction with the probability theory. Recently, all-optical approaches have attracted a lot of research interest. In this work, an adaptation of the quantum key distribution (QKD) setup is utilized for generating randomised bit sequences. The simulation results show that all-optically generated sequences very well resemble the theoretically ideal probability density characteristic. Furthermore, m-sequences show very promising results as well as Gold sequences. Additionally, the level of burstiness, i. e. the distribution of one’s and zero’s throughout the sequence, is studied for the different sequences. The results lead to the finding that generator polynomials with concentrated non-zero coefficients lead to more bursty bit sequences.
This paper explores the generation of high-quality random numbers utilizing the principles of quantum chaos. Traditional random number generators often exhibit limitations in terms of randomness and predictability, posing challenges for applications in secure communication and cryptography. This research investigates the potential of quantum chaos to overcome these limitations, proposing a novel approach based on quantum chaotic algorithms. The core of this approach lies in the generation of sequences exhibiting chaotic properties, subsequently analyzed to extract random numbers. The generated numbers are characterized by their enhanced randomness and unpredictability, offering a significant advancement over conventional methods. This work outlines the theoretical framework, the underlying mathematical principles, and the potential applications of quantum chaotic random number generation. The primary goal is to demonstrate a method capable of producing truly random sequences, crucial for secure systems.