Base Selection and Transmission Synchronization Algorithm in Quantum Cryptography
Catalin Anghel

TL;DR
This paper introduces the BSTS algorithm for quantum networks, enhancing secure communication by leveraging quantum phenomena to detect eavesdropping and ensure perfect security.
Contribution
The paper proposes the BSTS algorithm, a novel quantum network protocol that improves secure communication by synchronizing base selection and transmission.
Findings
BSTS achieves perfect security in quantum communication.
The algorithm effectively detects eavesdropping attempts.
Enhances the reliability of quantum key distribution.
Abstract
One Achilles heal of classical cryptographic communication systems is that secret communication can only take place after a key is communicated in secret over a totally secure communication channel. Here comes quantum key distribution which takes advantage of certain phenomena that occur at the subatomic level, so that any attempt by an enemy to obtain the bits in a key not only fails, but gets detected as well. This paper proposes the idea of on algorithm, intended to be a quantum network algorithm named Base Selection and Transmission Synchronization - BSTS, which can realize a perfectly secure communication between two computers.
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 Computing Algorithms and Architecture · Quantum Information and Cryptography · Chaos-based Image/Signal Encryption
