SCR-QRNG: Side-Channel Resistant Design using Quantum Random Number Generator

Jungmin Park, Seong-Joon Cho, Taejin Lim, Swarup Bhunia, Mark Mohammad Tehranipoor

Published Nov 1, 2019• 6 citations

Abstract

Random number generators play a pivotal role in generating security primitives, e.g., encryption keys, nonces, initial vectors, and random masking for side-channel countermeasures. A quantum entropy source based on radioactive isotope decay can be exploited to generate random numbers with sufficient entropy. If a deterministic random bit generator (DRBG) is combined for post-processing, throughput of the quantum random number generator (QRNG) can be improved. However, general DRBGs are susceptible to side-channel attacks. In this paper, we propose a framework called SCR-QRNG framework, which offers Side-Channel Resistant primitives using QRNG. The QRNG provides sources of randomness for modulating the clock frequency of a DRBG to obfuscate side-channel leakages, and to generate unbiased random numbers for security primitives. The QRNG has robustness against power side-channel attacks and is in compliance with NIST SP 800-22/90B and BSI AIS 31. We fabricate a quantum entropy chip, and implement a PCB module for a random frequency clock generator and a side-channel resistant QRNG on an FPGA.

DOI: 10.1109/iccad45719.2019.8942152

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.21151Journal of Web EngineeringJul 6, 20260 citations

AI-BASED QUANTUM RANDOM NUMBER GENERATION FOR SECURE COMMUNICATIONS

Narayana Gaddam

One of the solutions to the problem of secure communication is the Quantum Random Number Generators (QRNGs) which generate true randomness based on quantum mechanical principles.QRNGs are different from conventional pseudo random number generator in that they use quantum uncertainty to generate outputs which are very unpredictable.This work attempts to examine different QRNG architectures, study the possible integration of cryptographic frameworks with these architectures and highlight potential vulnerabilities in the integration of cryptographic frameworks with QRNG architectures.Post-processing techniques, i.e.Zero-Phase Component Analysis (ZPCA) and neural network based techniques are also studied to increase entropy and suppress environmental noise in QRNG systems.Key findings show that system jitter models based QRNG architectures are more scalable and less expensive for use in real world applications.Additionally, incorporating cryptographic protocols with the QRNGs endows them with the ability to resist quantum threats, and hence, provide better key distribution in the secure IoT communication frameworks.However, as security problems such as side channel attacks and hardware manipulation are still big issues.It also points out some of the emerging research trends including hybrid QRNG architectures, i.e., QRNG with classical PRNG to increase the entropy rate.As such, the proposed methodologies attempt to enhance QRNG scalability, security, and energy efficiency in cloud infrastructures, in mobile systems and in critical security environments.The advancement of these technologies will assume a crucial function in the advancement of quantum-safe frames for current advanced computerized foundation.

May 10, 20230 citations

Quantum True Randomness in Satellite Communications: Integrating QRNGs for Secure and Efficient Protocols

S Harikaran, S Karthikabharani, T. S. Gururaja +1 more

Defense, finance, navigation and global internet constellations are now dependent on satellite communication. Nevertheless, the majority of systems continue to use classical pseudo-random number generators (PRNGs) to encrypt and authenticate, and these are susceptible to prediction, replay and side-channel attacks. This paper presents a design of a model to incorporate Quantum True Random Number Generators (QTRNGs) to tap into natural randomness of quantum phenomena into satellite communication systems. The design is a gate based QRNG design based on Hadamard, SX and Pauli-Z gates, which are implemented and tested with NIST 800-22 and NIST 800-90B tests. The protocol architecture uses QRNGs to generate secure keys in ground-to-satellite and inter-satellite links. It shows a better result in entropy, unpredictability and attack resistance. The suggested architecture illustrates the ability of satellites enabled by QRNG to ensure the real-time and futureproof security of the worldwide communication networks.

International Conference on Intelligent Systems for Cybersecurity (ISCS)Nov 14, 20250 citations

Quantum Randomness-Driven Authentication: A Novel Framework for Ultra-Secure Identity Verification

Sheng Chen, Zhiyuan Ye, Zhenya Wang +2 more

In the face of escalating threats against conventional cryptographic authentication systems, quantum random number generators (QRNGs) offer a promising path toward unforgeable and unpredictable security primitives. This paper presents a quantum randomness-driven identity authentication framework that leverages device-independent QRNGs to generate ephemeral, irreproducible identity tokens. Unlike classical pseudo-random methods, QRNG-based schemes produce entropy from fundamental quantum phenomena, ensuring resistance to reverse engineering and side-channel attacks. The proposed protocol integrates quantum tokens into a mutual challenge–response structure, employs lightweight post-processing via entropy extractors, and supports deployment in low-latency IoT and edge computing scenarios. Experimental evaluations using QRNG-augmented authentication on simulated identity datasets demonstrate marked improvements in authentication unpredictability, collision resistance, and robustness under adversarial impersonation attempts. This work provides an end-to-end blueprint for embedding quantum entropy into next-generation identity frameworks, bridging the gap between quantum hardware and practical cybersecurity applications.

International Conference on Cyber Security and Information Engineering (ICCSIE)Jul 23, 20250 citations

Non Deterministic Pseudorandom Generator for Quantum Key Distribution

Arun Mishra, Kanaka Raju P., Anupama Arjun Pandit +1 more

Quantum Key Distribution(QKD) thrives to achieve perfect secrecy of One time Pad (OTP) through quantum processes. One of the crucial components of QKD are Quantum Random Number Generators(QRNG) for generation of keys. Unfortunately, these QRNG does not immediately produce usable bits rather it produces raw bits with high entropy but low uniformity which can be hardly used by any cryptographic system. A lot of pre-processing is required before the random numbers generated by QRNG to be usable. This causes a bottle neck in random number generation rate as well as QKD system relying on it. To avoid this lacuna of post-processing methods employed as a central part of Quantum Random Number Generators alternative approaches that satisfy the entropy(non determinism) and quantum security is explored. Pseudorandom generators based on quantum secure primitives could be an alternative to the post-processing problem as PRNGs are way more faster than any random number generator employing physical randomness (quantum mechanical process in QRNG) as well as it can provide uniform bits required for cryptography application. In this work we propose a pseudorandom generator based on post quantum primitives. The central theme of this random number generator is designing PRNG with non deterministic entropy generated through hard lattice problem - Learning with errors. We leverage the non determinism by Gaussian errors of LWE to construct non-deterministic PRNG satisfying the entropy requirement of QKD. Further, the paper concludes by evaluating the PRNG through Die-Harder Test.

arXiv:2311.03024Nov 6, 20230 citations

Analysis of a Programmable Quantum Annealer as a Random Number Generator

Elijah Pelofske

Quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate qubits in a uniform superposition and then measure the state of those qubits. If the preparation of the qubits in a uniform superposition is unbiased, then quantum computers can be used to create high entropy, secure random numbers. Typically, preparing and measuring such quantum systems requires more time compared to classical pseudo random number generators (PRNGs) which are inherently deterministic algorithms. Therefore, the typical use of quantum random number generators (QRNGs) is to provide high entropy secure seeds for PRNGs. Quantum annealing (QA) is a type of analog quantum computation that is a relaxed form of adiabatic quantum computation and uses quantum fluctuations in order to search for ground state solutions of a programmable Ising model. Here we present extensive experimental random number results from a D-Wave 2000Q quantum annealer, totaling over 20 billion bits of QA measurements, which is significantly larger than previous D-Wave QA random number generator studies. Current quantum annealers are susceptible to noise from environmental sources and calibration errors, and are not in general unbiased samplers. Therefore, it is of interest to quantify whether noisy quantum annealers can effectively function as an unbiased QRNG. The amount of data that was collected from the quantum annealer allows a comprehensive analysis of the random bits to be performed using the NIST SP 800-22 Rev 1a testsuite, as well as min-entropy estimates from NIST SP 800-90B. The randomness tests show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences. With no server-side sampling post-processing, the 1 microsecond annealing time measurements had a min-entropy of 0.824.

arXiv:2307.02573IEEE Transactions on Information Forensics and SecurityJan 1, 20244 citations