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

Lecture notes in electrical engineering

Quantum Random Number Generators for Cryptography: Design and Evaluation

Puspak Pain, Arindam Sadhu, Kunal Das, Maitreyi Ray Kanjilal

Published Oct 10, 2021• 5 citations
Publisher
DOI
10.1007/978-981-16-4035-3_28

Related papers

Quantum Random Number Generators for NIST Post-Quantum Cryptography Standard Algorithms

Abel C. H. Chen

In recent years, the advancement of quantum computing technology has posed potential security threats to RSA cryptography and elliptic curve cryptography. In response, the National Institute of Standards and Technology (NIST) published several Federal Information Processing Standards (FIPS) of post-quantum cryptography (PQC) in August 2024, including the Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM), Module-Lattice-Based Digital Signature Algorithm (ML-DSA), and Stateless Hash-Based Digital Signature Algorithm (SLH-DSA). Although these PQC algorithms are designed to resist quantum computing attacks, they may not provide adequate security in certain specialized application scenarios. To address this issue, this study proposes quantum random number generator (QRNG)-based PQC algorithms. These algorithms leverage quantum computing to generate random numbers, which serve as the foundation for key pair generation, key encapsulation, and digital signature generation. A generalized architecture of QRNG is proposed, along with the design of six QRNGs. Each generator is evaluated according to the statistical validation procedures outlined in NIST SP 800-90B, including tests for verification of entropy sources and independent and identically distributed (IID) outputs. Experimental results assess the computation time of the six QRNGs, as well as the performance of QRNG-based ML-KEM, QRNG-based ML-DSA, and QRNG-based SLH-DSA. These findings provide valuable reference data for future deployment of PQC-based Transport Layer Security in web systems.

arXiv:2507.21151•Journal of Web Engineering•Jul 6, 2026•0 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

Study of quantum random number generators

Patrik Mäki

•May 15, 2021•0 citations

Design and Analysis of a Quantum Random Number Platform

Nithin Parvatham, Venkatesh Somagani, Anirudh Alimineti +1 more

ABSTRACT Quantum random number generator (QRNG) platforms use principles of quantum mechanics to create truly random numbers. Traditional pseudo-random number generators (PRNGs) generate numbers based on deterministic formulas. QRNG's use of the principles of superposition and measurement can provide numbers that cannot be predicted or replicated; therefore, they have been used as a source of randomness in various fields. In this research project, an experimental QRNG was designed and built using Qiskit simulations. Each experiment consisted of a series of two-qubit circuits. The circuits were created to place both qubits into an equal probability state. This was done by applying a pair of Hadamard gates (Hadamard gate applies a rotation operator of π/2 radians). Then each circuit was measured. For each measurement, there would be one output from each qubit. Since the Hadamard gate creates an equal-probability superposition, the combination of each qubit will either add up to 1 or subtract from -1. These combinations will be recorded and processed through several methods to evaluate their quality. Those methods include: Shannon Entropy Analysis, Frequency Distribution Analysis and Chi-Square Uniformity Testing. Keywords: Quantum Random Number Generator, Quantum Computing, Quantum Measurement, Cryptography, Secure Randomness, Qiskit Simulation

INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT•Apr 11, 2026•0 citations

Quantum Random Number Generator-Based Cryptographic Algorithm Design

Jincheng Zhang

This paper explores the design of cryptographic algorithms leveraging the inherent randomness of quantum random number generators (QRNGs). Traditional cryptographic algorithms often rely on pseudo-random number generators (PRNGs), which are deterministic and therefore vulnerable to attacks if their internal state is compromised. QRNGs, on the other hand, derive their randomness from quantum mechanical phenomena, offering a fundamentally unpredictable source of numbers. This research investigates the application of QRNGs to enhance cryptographic security, focusing on constructing algorithms that exploit this unique property. The core claim is that utilizing QRNG characteristics allows for the design of more secure cryptographic algorithms. The proposed mechanism involves capitalizing on the non-deterministic nature of QRNGs to build algorithms with heightened security levels. This approach presents a novel security guarantee method by incorporating true randomness into cryptographic processes. We examine specific algorithm designs and analyze their security implications compared to traditional PRNG-based approaches. The paper concludes with a discussion on the challenges and future directions of utilizing QRNGs in cryptography.

•Sep 1, 2026•0 citations

New concepts and construction of quantum random number generators

Piotr Paweł Jóźwiak, Janusz Edward Jacak, Witold Aleksander Jacak

Quantum Information Processing•Mar 28, 2024•9 citations
In recent years, the advancement of quantum computing technology has posed potential security threats to RSA cryptography and elliptic curve cryptography. In response, the National Institute of Standards and Technology (NIST) published several Federal Information Processing Standards (FIPS) of post-quantum cryptography (PQC) in August 2024, including the Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM), Module-Lattice-Based Digital Signature Algorithm (ML-DSA), and Stateless Hash-Based Digital Signature Algorithm (SLH-DSA). Although these PQC algorithms are designed to resist quantum computing attacks, they may not provide adequate security in certain specialized application scenarios. To address this issue, this study proposes quantum random number generator (QRNG)-based PQC algorithms. These algorithms leverage quantum computing to generate random numbers, which serve as the foundation for key pair generation, key encapsulation, and digital signature generation. A generalized architecture of QRNG is proposed, along with the design of six QRNGs. Each generator is evaluated according to the statistical validation procedures outlined in NIST SP 800-90B, including tests for verification of entropy sources and independent and identically distributed (IID) outputs. Experimental results assess the computation time of the six QRNGs, as well as the performance of QRNG-based ML-KEM, QRNG-based ML-DSA, and QRNG-based SLH-DSA. These findings provide valuable reference data for future deployment of PQC-based Transport Layer Security in web systems.
ABSTRACT Quantum random number generator (QRNG) platforms use principles of quantum mechanics to create truly random numbers. Traditional pseudo-random number generators (PRNGs) generate numbers based on deterministic formulas. QRNG's use of the principles of superposition and measurement can provide numbers that cannot be predicted or replicated; therefore, they have been used as a source of randomness in various fields. In this research project, an experimental QRNG was designed and built using Qiskit simulations. Each experiment consisted of a series of two-qubit circuits. The circuits were created to place both qubits into an equal probability state. This was done by applying a pair of Hadamard gates (Hadamard gate applies a rotation operator of π/2 radians). Then each circuit was measured. For each measurement, there would be one output from each qubit. Since the Hadamard gate creates an equal-probability superposition, the combination of each qubit will either add up to 1 or subtract from -1. These combinations will be recorded and processed through several methods to evaluate their quality. Those methods include: Shannon Entropy Analysis, Frequency Distribution Analysis and Chi-Square Uniformity Testing. Keywords: Quantum Random Number Generator, Quantum Computing, Quantum Measurement, Cryptography, Secure Randomness, Qiskit Simulation
This paper explores the design of cryptographic algorithms leveraging the inherent randomness of quantum random number generators (QRNGs). Traditional cryptographic algorithms often rely on pseudo-random number generators (PRNGs), which are deterministic and therefore vulnerable to attacks if their internal state is compromised. QRNGs, on the other hand, derive their randomness from quantum mechanical phenomena, offering a fundamentally unpredictable source of numbers. This research investigates the application of QRNGs to enhance cryptographic security, focusing on constructing algorithms that exploit this unique property. The core claim is that utilizing QRNG characteristics allows for the design of more secure cryptographic algorithms. The proposed mechanism involves capitalizing on the non-deterministic nature of QRNGs to build algorithms with heightened security levels. This approach presents a novel security guarantee method by incorporating true randomness into cryptographic processes. We examine specific algorithm designs and analyze their security implications compared to traditional PRNG-based approaches. The paper concludes with a discussion on the challenges and future directions of utilizing QRNGs in cryptography.