| Autor: |
kumar, Vaishnavi, Pravinkumar, Padmapriya |
| Zdroj: |
Journal of Cryptographic Engineering; Jun2024, Vol. 14 Issue 2, p253-259, 7p |
| Abstrakt: |
Developing new prototypes and circuitry for producing random numbers is required for many areas of science and technology, from statistical physics to cryptography. The idea of making random numbers with quantum computers has recently received much interest. Our method creates completely random bits and integers by naturally superimposing quantum gates. Quantum random number generators (QRNGs) are constructed from the outcomes of inherently random measurements made in distinct quantum systems. This paper introduces an approach using SX (Square root of X) gate and CNOT (controlled NOT) gate combinations from IBM quantum experience to construct a quantum random number generator. Applied the SX gate on all qubits and performed measurements. As a result of repeatedly running this program, we obtained a sample with a length of 2 crores. We demonstrated the proposed design on the IBM QASM simulator by adding the barriers to the gates. We passed our suggested circuit outputs through the National Institute of Standards and Technology (NIST) test suite NIST 800-90B and NIST 800-22 to confirm that the generated bit sequences were random. Furthermore, our sequences pass randomness tests, thus certifying their randomness with a min-entropy of 0.999451. The average p value for the 16 passed tests is an average value of about 0.4888. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink