QKD based on symmetric entangled Bernstein-Vazirani

TL;DR

This paper proposes a novel entanglement-based quantum key distribution protocol utilizing a symmetric Bernstein-Vazirani algorithm, offering secure and efficient key sharing with two variants and analysis of eavesdropper resistance.

Contribution

Introduces a new symmetric entanglement-based QKD protocol based on Bernstein-Vazirani, with two variants and security analysis against attacks.

Findings

Protocols enable secure key sharing between parties.

Performance analysis shows robustness against eavesdropping.

Practical examples demonstrate protocol operation.

Abstract

This paper introduces a novel entanglement-based QKD protocol, that makes use of a modified symmetric version of the Bernstein-Vazirani algorithm, in order to achieve a secure and efficient key distribution. Two variants of the protocol, one fully symmetric and one semi-symmetric, are presented. In both cases, the spatially separated Alice and Bob share multiple EPR pairs, one qubit of the pair each. The fully symmetric version allows both parties to input a secret key from the irrespective location and, finally, acquire in the end a totally new and original key, an idea which was inspired by the Diffie-Hellman key exchange protocol. In the semi-symmetric version, Alice sends her chosen secret key to Bob (or vice versa). Furthermore, their performance against an eavesdropper's attack is analyzed. Finally, in order to illustrate the operation of the protocols in practice, two small scale but detailed examples are given.