Potentially Information-theoretic Secure Y00 Quantum Stream Cipher with Limited Key Lengths beyond One-Time Pad
Takehisa Iwakoshi

TL;DR
This paper demonstrates that the Y00 quantum stream cipher can achieve information-theoretic security with limited key lengths, surpassing traditional cryptographic limits, under well-designed system conditions.
Contribution
It shows that the Y00 protocol can be secure against quantum computational attacks with proper design, extending its security beyond previous assumptions.
Findings
Y00 can be information-theoretically secure with limited keys
Security holds against quantum computational cryptanalysis
Y00 surpasses Shannon limit in cryptography
Abstract
The previous work showed that the Y00 protocol could stay secure with the eavesdropper's guessing probability on the secret keys being strictly less than one under an unlimitedly long known-plaintext attack with quantum memory. However, an assumption that at least a fast correlation attack is completely disabled by irregular mapping. The present study shows that the Y00 protocol can be information-theoretic secure under any quantum-computational crypto-analyses if the Y00 system is well designed. The Y00 protocol directly encrypts messages with short secret keys expanded into pseudo-random running keys unlike One-Time Pad. However, it may offer information-theoretic security beyond the Shannon limit of cryptography.
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
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Chaos-based Image/Signal Encryption
