Random numbers are the lifeline of any cryptographic operation in modern computing. Quantum True Random Number Generator (QTRNG) can yield real random data to replace random-looking periodic sequences. Here, we present the fastest QTRNG on factual Quantum Computational Devices (QCD) locally on our device to save time. To construct a random number generator, the IBM Q Experience called Qiskit is used. The ease of our source Hadamard gate pooled with its verifiably sole randomness is imperative for attaining quantum random number generators at no cost. The inner matrix product of the square of the Hadamard gate is proved to be identified in the quantum lab. Applying the H gate twice on the quantum register cancelled out the H gate pair. It acted as a single Hadamard gate that was practically visualised using the IMB Q experience. The 24-qubit random number is experimented with and investigated in this work. The min-entropy of such generated random numbers is 0.0007244 with the worst-case entropy value of 0.999507. Besides, subsequent verification of genuine randomness was confirmed by steering restart experimentation, & the statistical properties of TRNG were evaluated over autocorrelation study, National Institute of Standards and Technology (NIST) SP 800-90B & 800-22 tests.
Random numbers are the lifeline of any cryptographic operation in modern computing. Quantum True Random Number Generator (QTRNG) can yield real random data to replace random-looking periodic sequences. Here, we present the fastest QTRNG on factual Quantum Computational Devices (QCD) locally on our device to save time. To construct a random number generator, the IBM Q Experience called Qiskit is used. The ease of our source Hadamard gate pooled with its verifiably sole randomness is imperative for attaining quantum random number generators at no cost. The inner matrix product of the square of the Hadamard gate is proved to be identified in the quantum lab. Applying the H gate twice on the quantum register cancelled out the H gate pair. It acted as a single Hadamard gate that was practically visualised using the IMB Q experience. The 24-qubit random number is experimented with and investigated in this work. The min-entropy of such generated random numbers is 0.0007244 with the worst-case entropy value of 0.999507. Besides, subsequent verification of genuine randomness was confirmed by steering restart experimentation, & the statistical properties of TRNG were evaluated over autocorrelation study, National Institute of Standards and Technology (NIST) SP 800-90B & 800-22 tests.
We propose to develop quantum true random number generation (QTRNG) in IBM's quantum laboratory by implementing the Random Quantum Fourier Transform (RQFT) technique utilizing quantum gates. This approach overcomes the imperfections caused by noise and decoherence in quantum circuits by utilizing the quantum Fourier transform (QFT) to replace the computational basis with a Fourier basis comprising a complex superposition of qubit states. For usage in symmetric and asymmetric cryptographic applications, the RQFT-based QTRNG produces unpredictable high quality random numbers. It satisfies all the preliminary tests, Autocorrelation test, and extensive National Institute of Standards and Technology (NIST) test suites, such as SP 800-90 and SP 800-22 are used to assess the generated sequences randomness in order to guarantee their robustness and reliability.
Random numbers are used in various domains, including quantum communication and cryptography applications such as key generation and authentication. Quantum mechanics has the intrinsic ability to generate truly random numbers, making it an ideal alternative for scientific applications that require randomness. Quantum wireless communication is proposed as a new means of communication that is safe, secure, and efficient. The simplicity of our source rotation gate, combined with its independently verifiable solitary unpredictability, is essential to obtain quantum random number generators without spending any money. In this chapter, we explore and study the 24-qubit random number. The worst-case entropy value for such randomly produced integers is 0.999445, with the min-entropy of such numbers being 0.0008. Additionally, steering restart tests were used to validate later verification of true randomness, and the statistical characteristics of the True Random Number Generation (TRNG) were assessed using an autocorrelation study and the statistical test suites.
In secure IT systems, a One Time Password (OTP) is used.They can only be used once for a transaction or a login session.It is usually used for multi-factor authentication and is one of the security services based on human responses.In the field of cryptography, the creation of pseudo-random bitstreams is similar to how one-time passwords (OTPs) work.In modern computers, the security of cryptographic procedures is greatly enhanced by the use of random numbers.The use of a Quantum True Random Number Generator (QTRNG) makes it possible to replace periodic sequences that appear random with real random data.A QTRNG is used in this research on a real Quantum Computational Device (QCD) in a local environment.The IBM Quantum Experience Qiskit platform is used to build a random number generator.Qiskit is an open source platform that provides users to work with actual quantum devices for simulating quantum algorithms, different gates and circuits on IBM Quantum Experience or on simulators.The random number is investigated with different qubits (quantum bits) to generate random bits that can be used for One Time Password Generation.
Random number generation is fundamental for many modern applications including cryptography, simulations and machine learning. Traditional pseudo-random numbers may offer statistical unpredictability, but are ultimately deterministic. On the other hand, True Random Number Generation (TRNG) offers true randomness. One way of obtaining such randomness are quantum systems, including quantum computers. As such the use of quantum computers for TRNG has received considerable attention in recent years. However, existing studies almost exclusively consider IBM quantum computers, often stop at using simulations and usually test only a handful of different TRNG quantum circuits. In this paper, we address those issues by presenting a study of TRNG circuits on Odra 5 a real-life quantum computer installed at Wrocław University of Science and Technology. It is also the first study to utilize the IQM superconducting architecture. Since Odra 5 is available on-premises it allows for much more comprehensive study of various TRNG circuits. In particular, we consider 5 types of TRNG circuits with 105 circuit subvariants in total. Each circuit is used to generate 1 million bits. We then perform an analysis of the quality of the obtained random sequences using the NIST SP 800-22 and NIST SP 800-90B test suites. We also provide a comprehensive review of existing literature on quantum computer-based TRNGs.
Abstract Designing novel circuits and models for generating truly random numbers is of great importance. Recent attention has been focused on the idea of using real quantum computers to generate random numbers. In order to generate purely random bits and numbers, one method relies on the natural superposition of quantum gates. Here, we design a Quantum Random Number Generator (QRNG) exploiting combinations of Hadamard and controlled-Hadamard gates in IBM Quantum Experience (QX). In order to verify that the generated bit sequences were truly random, the proposed circuit’s outputs were subjected to the National Institute of Standards and Technology (NIST) test suite. In comparison to previous works, we found that not only had the total number of passed tests increased, but the P-values had also improved in many cases. For example, in the simulation style of the IBM QX, the number of passed tests is 14 out of 15 standard NIST tests. For the experimental mood of the IBM 16Q Melbourne, the number of passed tests is six without using any extractions. Furthermore, one more test is passed by adding Barrier operations to the circuits, and the P-values have increased. As a result, we found that the proposed method had more passed tests than previous works. The average of P-values for the six passed tests in former research for the mood of using a combination of extractors is about 0.43 . However, the best result we can get with our circuits is around 0.60 (the average of P-values for 14 passed tests), which is an improvement of 0.17 compared to former works . Because of this, our circuits are getting ever closer to being a true QRNG.
The reliability and security of telecommunication systems depend on the quality of random number generators (RNGs). Quantum Random Number Generators (QRNGs) enhance randomness over classical methods, improving cryptographic strength. This paper evaluates three QRNG implementations using IBM quantum computers, analyzing their methodologies, performance, and limitations. We introduce a new QRNG algorithm on the IBM Quantum Experience (IBMQ) platform, using real quantum computers instead of simulators, and incorporating post-processing with XOR bit masking. Our algorithm achieves entropy 0.86458 and passes more NIST 800-90B and NIST 800–22 randomness tests, demonstrating its effectiveness and reliability. This research supports secure telecommunication technologies by providing a reliable source of true randomness.