Generalized approach for analysing quantum key distribution experiments

DOI10.1007/978-3-030-35423-7_24zbMath1456.94098OpenAlexW2995429123MaRDI QIDQ2179411

Suvra Sekhar Das, Arpita Maitra

Publication date: 12 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_24

zbMATH Keywords

quantum cryptographypassive BB84 QKDreference frame independent 6-4 QKDsynthesis toolwave-particle superposition

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Quantum cryptography: public key distribution and coin tossing
• McBits: Fast Constant-Time Code-Based Cryptography
• Lattice Reduction Algorithms: Theory and Practice
• Code-based cryptography
• Quantum cryptography based on Bell’s theorem
• One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games
• Public-key cryptosystems from the worst-case shortest vector problem
• A single quantum cannot be cloned
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Generalized approach for analysing quantum key distribution experiments