Hiding Signals in Quantum Random Noise
dc.contributor.author | Fiske, Michael | |
dc.date.accessioned | 2024-12-26T21:11:03Z | |
dc.date.available | 2024-12-26T21:11:03Z | |
dc.date.issued | 2025-01-07 | |
dc.description.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. | |
dc.format.extent | 10 | |
dc.identifier.doi | 10.24251/HICSS.2025.854 | |
dc.identifier.isbn | 978-0-9981331-8-8 | |
dc.identifier.other | af86dc41-a9fe-4155-92b0-d6dc4c5565c3 | |
dc.identifier.uri | https://hdl.handle.net/10125/109705 | |
dc.relation.ispartof | Proceedings of the 58th Hawaii International Conference on System Sciences | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.subject | Cybersecurity and Software Assurance | |
dc.subject | key exchange, perfect secrecy, quantum computing, quantum randomness, scatter map | |
dc.title | Hiding Signals in Quantum Random Noise | |
dc.type | Conference Paper | |
dc.type.dcmi | Text | |
prism.startingpage | 7141 |
Files
Original bundle
1 - 1 of 1