Hiding Signals in Quantum Random Noise
Files
Date
2025-01-07
Authors
Contributor
Advisor
Department
Instructor
Depositor
Speaker
Researcher
Consultant
Interviewer
Narrator
Transcriber
Annotator
Journal Title
Journal ISSN
Volume Title
Publisher
Volume
Number/Issue
Starting Page
7141
Ending Page
Alternative Title
Abstract
An O(n) procedure for hiding m bits of signal inside of n−m bits of quantum random noise is introduced. When the signal and quantum noise have a uniform probability distribution, and the signal size is fixed, the security of a single, hidden signal transmission can be made arbitrarily close to perfect secrecy. Our hiding procedures are implemented with commercially available quantum random number generators, and current TCP/IP infrastructure. A random nonce helps unpredictably change the bit locations of the signal: a prior hidden signal transmission does not reveal information to Eve on where the current signal is hidden. This security property enables a new key exchange that hides public keys in quantum randomness; introduces a post-quantum key exchange with substantially smaller key sizes; offers a substantially greater classical complexity than the underlying public keys; and provides quantum complexity that is comparable to Grover’s quantum computing algorithm.
Description
Keywords
Cybersecurity and Software Assurance, key exchange, perfect secrecy, quantum computing, quantum randomness, scatter map
Citation
Extent
10
Format
Geographic Location
Time Period
Related To
Proceedings of the 58th Hawaii International Conference on System Sciences
Related To (URI)
Table of Contents
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International
Rights Holder
Local Contexts
Collections
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.