Semi-Quantum Random Number Generation
Julia Guskind, Walter O. Krawec

TL;DR
This paper introduces the first semi-quantum protocol for random number generation, providing a security proof and a noise-dependent rate bound, expanding semi-quantum cryptography applications.
Contribution
It demonstrates that quantum random number generation is feasible in semi-quantum settings with limited user capabilities, along with a rigorous security proof.
Findings
Secure semi-quantum random number generation protocol developed
Derived noise-dependent rate bounds for the protocol
Potential applicability to other semi-quantum cryptographic scenarios
Abstract
Semi-quantum cryptography involves at least one user who is semi-quantum or "classical" in nature. Such a user can only interact with the quantum channel in a very restricted way. Many semi-quantum key distribution protocols have been developed, some with rigorous proofs of security. Here we show for the first time, to our knowledge, that quantum random number generation is possible in the semi-quantum setting. We also develop a rigorous proof of security, deriving a bound on the random bit generation rate of the protocol as a function of noise in the channel. Our protocol and proof may be broadly applicable to other quantum and semi-quantum cryptographic scenarios where users are limited in their capabilities.
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.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Quantum Mechanics and Applications · Cryptography and Data Security
