Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Smart innovation, systems and technologies

Implications of Quantum Superposition in Cryptography: A True Random Number Generation Algorithm

Dhananjay S. Deshpande, Aman Kumar Nirala, Ayodeji Olalekan Salau

Published Oct 29, 2020• 1 citation
Publisher
DOI
10.1007/978-981-15-7062-9_41

Related papers

TRNG (True Random Number Generator) Method Using Visible Spectrum for Secure Communication on 5G Network

Kyungroul Lee, Sun‐Young Lee, Changho Seo +1 more

The key point of cryptography is cryptographic algorithms and keys. The random number generator is used to generate seeds and keys randomly in many cryptographic systems. For this reason, it is essential to use keys to encrypt and decrypt the transferring information, and the security of these keys is closely related to the security of 5G network. We propose a true random number generator (TRNG) method in this paper, and are using visible spectrum for noise source. We consider that if the cryptography system utilizes data of visible spectrum using the proposed TRNG, and the TRNG generates random numbers with high entropy.

IEEE Access•Jan 1, 2018•68 citations

Quantum Random Number Generators for Cryptography: Design and Evaluation

Puspak Pain, Arindam Sadhu, Kunal Das +1 more

Lecture notes in electrical engineering•Oct 10, 2021•5 citations

Quantum random number generators and their use in cryptography

Mario Stipčević

International Convention on Information and Communication Technology, Electronics and Microelectronics•Jan 1, 2011•0 citations

Cloud Quantum Computer Random Number Generation for Cryptography

Pham, Andrew

Creating a true random number generator is a difficult problem that may be solved by leveraging quantum computing. A simple quantum random number generation program involves applying the Hadamard gate to all qubits then measuring each qubit for random data, repeating the program to obtain the desired bitstring length. Implementing this algorithm on IBM’s Manila and Rigetti’s Aspen-9 quantum computers, we obtained a sample of 1,000,000 potentially random bits. In this thesis, we evaluate the quality of random bits generated by using quantum computers as a hardware random number generator with statistical testing and present the implications of those results.

•Jan 1, 2022•0 citations

Quantum Random Number Generation: Theory and Practice

Christian Kollmitzer, Stefan Schauer, Stefan Raß +1 more

Quantum science and technology•Jan 1, 2020•22 citations

Advancing Cryptographic Security Through Quantum True Random Number Generation

T. S. Gururaja, Padmapriya Praveenkumar

True randomness is a basic necessity of secure cryptography. This secures the reliability of encryption keys, digital signatures and authentication mechanisms. Classical random number generators based on deterministic algorithms can introduce patterns and decrease reliability. This paper introduces a Quantum True Random Number Generator (QTRNG) takes advantage of the intrinsic unpredictability of quantum mechanics. The proposed quantum circuit uses$R Y(\pi / 2)$and$R Z(\pi / 2)$rotations to create superposition states like Hadamard operation. These gates control the phase and orientation of qubits on the Bloch sphere yields measurement outcomes are inherently random. The resulting distributions are unbiased and balanced offers a source of true randomness. The quality of the generated bitstrings is verified using statistical tests such as the NIST SP 800-22, SP 800-90 test suites and autocorrelation tests. The measurements show high entropy, uniform distribution and low bias satisfy the basic requirements for cryptographic security. Phase-based quantum operations provide an efficient for producing high-quality quantum randomness facilitates the construction of effective quantum-secure cryptographic systems.

International Conference on Intelligent Innovations in Engineering and Technology (ICIIET)•Dec 4, 2025•0 citations
The key point of cryptography is cryptographic algorithms and keys. The random number generator is used to generate seeds and keys randomly in many cryptographic systems. For this reason, it is essential to use keys to encrypt and decrypt the transferring information, and the security of these keys is closely related to the security of 5G network. We propose a true random number generator (TRNG) method in this paper, and are using visible spectrum for noise source. We consider that if the cryptography system utilizes data of visible spectrum using the proposed TRNG, and the TRNG generates random numbers with high entropy.
Creating a true random number generator is a difficult problem that may be solved by leveraging quantum computing. A simple quantum random number generation program involves applying the Hadamard gate to all qubits then measuring each qubit for random data, repeating the program to obtain the desired bitstring length. Implementing this algorithm on IBM’s Manila and Rigetti’s Aspen-9 quantum computers, we obtained a sample of 1,000,000 potentially random bits. In this thesis, we evaluate the quality of random bits generated by using quantum computers as a hardware random number generator with statistical testing and present the implications of those results.
True randomness is a basic necessity of secure cryptography. This secures the reliability of encryption keys, digital signatures and authentication mechanisms. Classical random number generators based on deterministic algorithms can introduce patterns and decrease reliability. This paper introduces a Quantum True Random Number Generator (QTRNG) takes advantage of the intrinsic unpredictability of quantum mechanics. The proposed quantum circuit usesRY(π/2)R Y(\pi / 2)RY(π/2)andRZ(π/2)R Z(\pi / 2)RZ(π/2)rotations to create superposition states like Hadamard operation. These gates control the phase and orientation of qubits on the Bloch sphere yields measurement outcomes are inherently random. The resulting distributions are unbiased and balanced offers a source of true randomness. The quality of the generated bitstrings is verified using statistical tests such as the NIST SP 800-22, SP 800-90 test suites and autocorrelation tests. The measurements show high entropy, uniform distribution and low bias satisfy the basic requirements for cryptographic security. Phase-based quantum operations provide an efficient for producing high-quality quantum randomness facilitates the construction of effective quantum-secure cryptographic systems.