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

Advances in information security, privacy, and ethics book series

Harnessing Quantum Uncertainty

Riddhi B. Prajapati, Bhavesh B. Prajapati

Published Nov 27, 2024• 0 citations
Publisher

Abstract

This chapter provides a concise yet thorough examination of Quantum True Random Number Generators (QTRNGs), focusing on their critical role in generating truly unpredictable and irretrievable random numbers, essential for various security algorithms. The study delves into the foundational principles of QTRNGs, highlighting the physical processes that enable genuine randomness. It also evaluates the security attributes of QTRNGs, discussing potential vulnerabilities and defenses against manipulation and attacks. The chapter concludes by assessing the practical applications and limitations of QTRNGs, offering insights into their current and future relevance in enhancing security in computational systems.

DOI
10.4018/979-8-3693-9220-1.ch005

Related papers

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

Design of a quantum true random number generator using quantum gates and benchmarking its performance on an IBM quantum-computer

Vaishnavi Kumar, Padmapriya Praveenkumar

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.

•Jul 20, 2023•1 citation

Quantum Random Number Generation

Jincheng Zhang

Quantum random number generation (QRNG) offers a fundamentally different approach to randomness compared to classical methods. This paper explores the design and principles of a QRNG based on harnessing the inherent uncertainty in quantum measurements. The core claim is the development of a system capable of generating truly random quantum bit sequences. This is achieved by exploiting the probabilistic nature of quantum measurement, specifically the collapse of the wave function upon observation, which yields unpredictable outcomes. The generated sequences are expected to exhibit statistical independence, a crucial property for various quantum computing applications. This work lays the groundwork for a detailed exploration of QRNG techniques, highlighting their potential impact on secure quantum communication and simulation. We will detail the theoretical underpinnings, focusing on the mathematical formulation of the process and the statistical properties of the generated random numbers.

•Aug 31, 2026•0 citations

Quantum Secure Key Generation for QKD Protocols Using Quantum Gates

T. S. Gururaja, Padmapriya Praveenkumar, Nirbhay Kumar Chaubey

Cryptography is evolving to meet the demands of future cyber technologies, but classical cryptographic methods remain vulnerable to interception. Cryptographic techniques struggle to address the evolving landscape of cybersecurity threats, Quantum Key Distribution (QKD) emerges as a superior alternative, leveraging quantum mechanics principles such as superposition and entanglement for secure key exchanges. This chapter details the implementation of a Quantum True Random Number Generator (QTRNG) using fundamental single-qubit operation including Hadamard (H), Rotation (RZ) and square-root NOT (SX) gates using IBM Quantum Platform. We evaluate the integration of this QTRNG across several discrete variable QKD protocols: BB84, B92, E91, T22, Differential Phase Shift, and SARG04. The study focuses on how the QTRNG contributes to the randomness and security of these protocols, demonstrating its effectiveness in producing high-quality quantum keys that meet rigorous cryptographic standards.

Advances in information security, privacy, and ethics book series•Nov 27, 2024•4 citations

Quantum Random Number Generators (QRNG)

Bruno Huttner, Gilles Trachsel

Abstract Cryptographic processes rely on randomness to ensure secure encryption by generating unpredictable keys and patterns, thereby preventing attackers from guessing them. This chapter explores various methods for generating randomness, with a focus on Quantum Random Number Generators (QRNGs), which are considered the most secure option for cryptographic implementations. QRNGs leverage the inherent unpredictability of quantum phenomena and are being explored for a variety of use cases, from small devices to large-scale servers, with the potential to enhance security in diverse systems. However, their broader adoption faces limitations, such as cost, scalability, and integration challenges, which must be addressed for widespread practical implementation.

Springer eBooks•Dec 1, 2025•0 citations

Quantum TRNG for Secure Data Transmission

DR. S. K. Rajalakshmi, M. Logeshwari, S. Swasthika Janani +1 more

Secure data transmission depends on unpredictable cryptographic keys. Conventional pseudorandom number generators are deterministic and vulnerable to prediction. This work proposes a Quantum True Random Number Generator (Q-TRNG) that uses quantum superposition and noise to produce truly random numbers. The generated quantum entropy is converted into high-quality random bits and applied to secure encryption, improving confidentiality and resistance to attacks. The proposed system offers a reliable and future- ready solution for quantum-grade secure communication.

International Journal of Research and Innovation in Applied Science•Jan 1, 2026•0 citations
This chapter provides a concise yet thorough examination of Quantum True Random Number Generators (QTRNGs), focusing on their critical role in generating truly unpredictable and irretrievable random numbers, essential for various security algorithms. The study delves into the foundational principles of QTRNGs, highlighting the physical processes that enable genuine randomness. It also evaluates the security attributes of QTRNGs, discussing potential vulnerabilities and defenses against manipulation and attacks. The chapter concludes by assessing the practical applications and limitations of QTRNGs, offering insights into their current and future relevance in enhancing security in computational systems.
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.
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.
Quantum random number generation (QRNG) offers a fundamentally different approach to randomness compared to classical methods. This paper explores the design and principles of a QRNG based on harnessing the inherent uncertainty in quantum measurements. The core claim is the development of a system capable of generating truly random quantum bit sequences. This is achieved by exploiting the probabilistic nature of quantum measurement, specifically the collapse of the wave function upon observation, which yields unpredictable outcomes. The generated sequences are expected to exhibit statistical independence, a crucial property for various quantum computing applications. This work lays the groundwork for a detailed exploration of QRNG techniques, highlighting their potential impact on secure quantum communication and simulation. We will detail the theoretical underpinnings, focusing on the mathematical formulation of the process and the statistical properties of the generated random numbers.
Cryptography is evolving to meet the demands of future cyber technologies, but classical cryptographic methods remain vulnerable to interception. Cryptographic techniques struggle to address the evolving landscape of cybersecurity threats, Quantum Key Distribution (QKD) emerges as a superior alternative, leveraging quantum mechanics principles such as superposition and entanglement for secure key exchanges. This chapter details the implementation of a Quantum True Random Number Generator (QTRNG) using fundamental single-qubit operation including Hadamard (H), Rotation (RZ) and square-root NOT (SX) gates using IBM Quantum Platform. We evaluate the integration of this QTRNG across several discrete variable QKD protocols: BB84, B92, E91, T22, Differential Phase Shift, and SARG04. The study focuses on how the QTRNG contributes to the randomness and security of these protocols, demonstrating its effectiveness in producing high-quality quantum keys that meet rigorous cryptographic standards.
Abstract Cryptographic processes rely on randomness to ensure secure encryption by generating unpredictable keys and patterns, thereby preventing attackers from guessing them. This chapter explores various methods for generating randomness, with a focus on Quantum Random Number Generators (QRNGs), which are considered the most secure option for cryptographic implementations. QRNGs leverage the inherent unpredictability of quantum phenomena and are being explored for a variety of use cases, from small devices to large-scale servers, with the potential to enhance security in diverse systems. However, their broader adoption faces limitations, such as cost, scalability, and integration challenges, which must be addressed for widespread practical implementation.
Secure data transmission depends on unpredictable cryptographic keys. Conventional pseudorandom number generators are deterministic and vulnerable to prediction. This work proposes a Quantum True Random Number Generator (Q-TRNG) that uses quantum superposition and noise to produce truly random numbers. The generated quantum entropy is converted into high-quality random bits and applied to secure encryption, improving confidentiality and resistance to attacks. The proposed system offers a reliable and future- ready solution for quantum-grade secure communication.