NIST Post-Quantum Cryptography Standard Algorithms Based on Quantum Random Number Generators
Abel C. H. Chen

TL;DR
This paper introduces quantum random number generator-based post-quantum cryptography algorithms to enhance security against quantum attacks, detailing their architecture, design, and performance validation.
Contribution
It proposes QRNG-based PQC algorithms, including their architecture, six generator designs, and comprehensive evaluation, addressing security gaps in existing PQC methods.
Findings
QRNGs successfully generate high-quality random numbers for cryptographic use
QRNG-based algorithms meet NIST validation standards for entropy and IID properties
Performance assessments show feasible computation times for practical deployment
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
