REVIEW 1 cited by
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Strengthening the No-Go Theorem for QRNGs
read the original abstract
Quantum random numbers are essential for security against quantum algorithms. Randomness as a beacon is a service being provided for companies and governments to upgrade their security standards from RSA to PQC-QKD or PQC-RSA protocols. Both security mechanisms assume trust in the service provider unless one aims for device-independent protocols. How does an entity ensure that the beacon service has a quantum signature other than relying on faith? Specifically, given a bit-stream, can a user verify a quantum signature in it? Researchers claim this is indecipherable and have stated a no-go theorem for post-processed bit-streams [Physical Review A \textbf{109}, 022243 (2024)]. In this article, we corroborate the results of the no-go theorem while discussing its nuances using two different random number generators and four test methods. These include the NIST statistical test suite and machine learning algorithms that strengthen the theorem. This work is relevant for companies and governments using QRNG, provided to enhance security against quantum threats.
Forward citations
Cited by 1 Pith paper
-
Demonstration of quantum random number generation using nitrogen vacancy centres
QRNG using photon arrival times from NV centers in nanodiamonds achieves rates from 0.173 to 4.77 Mbits/s with min-entropy close to 1 and passes ENT/NIST tests without post-processing.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.