Papers
Topics
Authors
Recent
Search
2000 character limit reached

Photon-Number-Splitting-attack resistant Quantum Key Distribution Protocols without sifting

Published 25 Jun 2013 in quant-ph | (1306.6061v2)

Abstract: We propose a family of sifting-less quantum-key-distribution protocols which use reverse-reconciliation, and are based on weak coherent pulses (WCPs) polarized along m different directions. When m=4, the physical part of the protocol is identical to most experimental implementations of BB84 and SARG04 protocols and they differ only in classical communications and data processing. We compute their total keyrate as function of the channel transmission T, using general information theoretical arguments and we show that they have a higher keyrate than the more standard protocols, both for fixed and optimized average photon number of the WCPs. When no decoy-state protocols (DSPs) are applied, the scaling of the keyrate with transmission is improved from T<sup\>2</sup> for BB84 to T1+1/(m-2). If a DSP is applied, we show how the keyrates scale linearly with T, with an improvement of the prefactor by 75.96 % for m=4. High values of $ m $ allow to asymptotically approach the keyrate obtained with ideal single photon pulses. The fact that the keyrates of these sifting-less protocols are higher compared to those of the aforementioned more standard protocols show that the latter are not optimal, since they do not extract all the available secret key from the experimental correlations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.