Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Quantum cryptography without conjugate coding

Simon J. D. Phoenix

Published Jul 1, 1993• 24 citations
Publisher

Abstract

We extend the quantum key distribution method of Bennett and Brassard [IBM Tech. Discl. Bull. 28, 3153 (1985)] by exploiting a nonconjugate coding scheme. Using this scheme we are able to show that the original method of Bennett and Brassard gives optimal security.
DOI
10.1103/physreva.48.96

Related papers

Quantum Key Distribution Using Multilevel Encoding

Mohamed Bourennane, Anders Karlsson, Gunnar G. Bjork

We extend the original Bennett and Brassard for quantum key distribution protocol by using M mutually complementary bases and N orthogonalvectors in each base. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Feb 24, 2006•5 citations

Security of quantum key distribution with imperfect devices

GottesmanDaniel, LoHoi-Kwong, LütkenhausNorbert +1 more

We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol in the case where the source and detector are under the limited control of an adversary. Our proof applies whe...

Quantum Information and Computation•Sep 1, 2004•7 citations

Quantum cryptography with polarizing interferometers

Marek Czachor

Cryptographic scheme proposed by Bennett, Brassard, and Mermin [Phys. Rev. Lett. {\\bf 68}, 557 (1992)] is reformulated in a version involving two polarizing Mach-Zehnder interferometers. Such a form, although physically equivalent to the original one, makes its security explicit, suggestive and easy to explain to non-experts.

•Jan 1, 1999•3 citations

Quantum dense key distribution

Ivo Pietro Degiovanni, Ivano Ruo Berchera, Stefania Castelletto +4 more

This paper proposes a protocol for quantum dense key distribution. This protocol embeds the benefits of a quantum dense coding and a quantum key distribution and is able to generate shared secret keys four times more efficiently than the Bennet-Brassard 1984 protocol. We hereinafter prove the security of this scheme against individual eavesdropping attacks, and we present preliminary experimental results, showing its feasibility.

arXiv:quant-ph/0312128•Physical Review A•Mar 16, 2004•53 citations

Estimates for practical quantum cryptography

Norbert Lütkenhaus

In this paper I present a protocol for quantum cryptography which is secure against attacks on individual signals. It is based on the Bennett-Brassard protocol of 1984. The security proof is complete as far as the use of single photons as signal states is concerned. Emphasis is placed on the practicability of the resulting protocol. For each run of the quantum key distribution the security statement gives the probability of a successful key generation and the probability for an eavesdropper's knowledge, measured as change in Shannon entropy, to be below a specified maximal value.

arXiv:quant-ph/9806008•Physical Review A•May 1, 1999•219 citations

Quantum Cryptography and Teleportation

F.J. Duarte

Cryptography is a word derived from the Greek that is approximately translated as hidden writing. There are various forms and styles of cryptography; however, since ancient times the aim of cryptography has been the same: secure the transmission of information from an emitter to a receiver. A classical form of cryptography involves the sharing of a code between the emitter and the receiver. A different algorithmic approach allows the use of a public key and is known as public key cryptography. This approach uses a public key and a secured key, both of which are mathematically connected. Quantum cryptography was first introduced by Weisner in 1983 and then by C. H. Bennett and G. Brassard. A refined protocol was introduced by Bennett et al. The Bennett and Brassard approach relies on the straightforward polarization property of single photons. An alternative method, based on the quantum entanglement of pairs of photons, was introduced by A. K. Ekert.

CRC Press eBooks•Oct 29, 2013•0 citations
In this paper I present a protocol for quantum cryptography which is secure against attacks on individual signals. It is based on the Bennett-Brassard protocol of 1984. The security proof is complete as far as the use of single photons as signal states is concerned. Emphasis is placed on the practicability of the resulting protocol. For each run of the quantum key distribution the security statement gives the probability of a successful key generation and the probability for an eavesdropper's knowledge, measured as change in Shannon entropy, to be below a specified maximal value.
Cryptography is a word derived from the Greek that is approximately translated as hidden writing. There are various forms and styles of cryptography; however, since ancient times the aim of cryptography has been the same: secure the transmission of information from an emitter to a receiver. A classical form of cryptography involves the sharing of a code between the emitter and the receiver. A different algorithmic approach allows the use of a public key and is known as public key cryptography. This approach uses a public key and a secured key, both of which are mathematically connected. Quantum cryptography was first introduced by Weisner in 1983 and then by C. H. Bennett and G. Brassard. A refined protocol was introduced by Bennett et al. The Bennett and Brassard approach relies on the straightforward polarization property of single photons. An alternative method, based on the quantum entanglement of pairs of photons, was introduced by A. K. Ekert.