Paper
1 June 2005 Optimal alphabets for noise-resistant quantum cryptography
Denis V. Sych, Boris A. Grishanin, Victor N. Zadkov
Author Affiliations +
Proceedings Volume 5833, Quantum Informatics 2004; (2005) https://doi.org/10.1117/12.620519
Event: 18th International Conference on Photoelectronics and Night Vision Devices and Quantum Informatics 2004, 2004, Moscow, Russian Federation
Abstract
Possibilities of improving critical error rate of quantum key distribution (QKD) protocols for different strategies of eavesdropping are investigated. QKD-protocols with discrete alphabets letters of which form regular polyhedrons on the Bloch sphere (tetrahedron octahedron cube icosahedron and dodecahedron which have 4, 6, 8, 12 and 20 vertexes respectively) and QKD-protocol with continuous alphabet which corresponds to the limiting case of a polyhedron with infinitive number of vortexes are considered. Stability of such QKD-protocols to the noise in a quantum channel which is due to the Eve's interference that apply either intercept-receipt or optimal eavesdropping strategy at the individual attacks is studied in detail. It is shown that in case of optimal eavesdropping strategy after bases reconciliation the QKD-protocol with continuous alphabet surpasses all other protocols in terms of noise-resistance. Without basis reconciliation the highest critical error rate have the protocol with tetrahedron-type alphabet.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Denis V. Sych, Boris A. Grishanin, and Victor N. Zadkov "Optimal alphabets for noise-resistant quantum cryptography", Proc. SPIE 5833, Quantum Informatics 2004, (1 June 2005); https://doi.org/10.1117/12.620519
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Quantum key distribution

Quantum information

Error analysis

Quantum cryptography

Quantum communications

Optical spheres

Safety

Back to Top