Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Experimental free-space quantum key distribution with efficient error correction

Open Access Open Access

Abstract

We report a 17-km free-space quantum key distribution (QKD) experiment using an engineering model of the space-bound optical transmitter and a ground station for satellite-ground QKD. The final key rate of ~ 0.5 kbps is achieved in this experiment with the quantum bit error rate (QBER) of ~ 3.4%. An efficient error correction algorithm, Turbo Code, is employed. Compared with the current error correction algorithm of Cascade, a high-efficiency error correction is realized by Turbo Code with only one-time data exchange. For a low QBER, with only one-time data exchange, the final key rates based on Turbo code are similar with Cascade. As the QBER increases, Turbo Code gives higher final key rates than Cascade. Our results experimentally demonstrate the feasibility of satellite-ground QKD and show that the efficient error correction based on Turbo Code is potentially useful for the satellite-ground quantum communication.

© 2017 Optical Society of America

1. Introduction

Quantum key distribution (QKD) offers an approach of sharing unconditional secure keys between two remote parties based on the principle of quantum mechanics. From the first concrete QKD protocol (BB84) established by Bennet and Brassard in 1984 [1] to the simplest entanglement based schemes (BBM92) developed by Bennett et al. in 1992 [2], QKD has become the most active research field for practicability in quantum information science. Typically, there are two main types of quantum channels, fiber links and free-space links. Due to absorptive channel losses and detector dark counts, current transmission distances are limited to the order of hundreds of kilometers in a fiber [3–7]. Fortunately, considering the photon losses and photon decoherence are almost negligible in outer space, QKD based on satellites is treated as one of the most promising solutions to realize a global quantum communication network. In order to test the feasibility of QKD based on satellites, many excellent experimental works have been performed on the ground in the past decade [8–15]. Recently, China launched the world’s first quantum science satellite (QSS) dedicated to testing the fundamentals of quantum communication in space [16]. This exciting development has made it urgent to design an efficient error correction algorithm suitable for satellite-ground QKD.

In general, the postprocessing of QKD mainly includes basis sifting, error correction and privacy amplification [17]. Previous error correction algorithms for QKD are mostly based on the Cascade protocol [18, 19], which needs many times of data exchange. However, the frequent data exchange between satellite and ground is very difficult and challenging. First, data exchange can be carried out only when a satellite passes through a ground monitoring station. The lasting time is typically several minutes for a low earth orbit satellite. Second, a few ground monitoring stations are shared by many satellites, which greatly reduces the opportunities of data exchange for QSS. Also, comparing with ground fiber communication systems, satellite-ground data interaction is slower and less stable. Thus, the postprocessing of satellite-ground QKD should be performed with as few data exchanges as possible. Here, considering its excellent performance with one-time data exchange, we improve Turbo Code to make it suitable for QKD. Furthermore, based on Turbo Code, we implement a 17-km free-space experiment to simulate satellite-ground QKD with a engineering model of an optical transmitter of QSS in Delingha, Qinghai Province.

2. Experimental implementation

We perform a 17-km free-space QKD experiment in Delingha, Qinghai province. As shown in Fig. 1, the transmitter is located in a removable container which is 17 km away from the receiver. At the transmitter, the core equipment is an engineering model of QSS. We place it on a turntable to simulate the satellite movement in orbit. The receiver terminal is at the Qinghai station of Purple Mountain Observatory, which is one of five ground stations for QSS. The quantum optical signal is transmitted by the engineering model with a telescope diameter of 200 mm. To collect the incident light efficiently, we use an optical telescope with a diameter of 1.2 m to receive quantum signals at the receiver station.

 figure: Fig. 1

Fig. 1 The transmitter (a) and receiver (b) telescope. The transmitter telescope is a engineering model of QSS. We place it on a turntable to simulate the satellite movement in orbit. The receiver telescope is a Cassegrain telescope which used to receive the quantum signals at receiver station.

Download Full Size | PDF

To establish a stable free-space optical link, we employ an acquisition, pointing, and tracking (APT) system. The two-stage APT system, coarse and fine stage, is designed in the transmitter and the receiver. For the transmitter, the coarse pointing stage consists of a two-dimensional rotatable telescope with a turning range of ±90° in azimuth and −30° ~ 70° in elevation and a camera with a field-of-view of 2.3° × 2.3° and frame rate of 40 Hz. The fine stage is realized via a fast steering mirror (FSM) driven by piezo ceramics. Similar coarse and fine APT systems are also equipped in the ground station (receiver). When we start the QKD experiment, the receiver points the transmitter by its 671 nm beacon laser with a divergence angle of ~1 mrad. The coarse camera in the transmitter detects the 671 nm beacon laser to measure the tracking error. With the feedback control of the two-dimensional rotatable telescope and the camera, the coarse tracking error is less than 300 µrad, which is much smaller than the camera’s field of view. As a subsequent step, the fine close-loop worked via utilizing the FSM and the camera. Simultaneously, the transmitter points a beacon laser with wavelength of 532 nm and divergence angle of 1.25 mrad to the receiver. With a similar cascaded two-stage APT technique, the receiver corrects its pointing direction further. Finally, we establish a stable 17-km free-space optical link with a pointing error of 3 ~ 4 µrad, as shown in Fig. 2

 figure: Fig. 2

Fig. 2 Performance of APT on the X and Y axis measured in the transmitter.

Download Full Size | PDF

2.1. Experiment setup

The experiment setup is shown in Fig. 3. In the transmission system, the quantum optical source is composed of eight laser diodes (LDs) which have four polarization states (H, V, +, −) with two intensity states (signal state, decoy state) of the decoy-state BB84 protocol [20–22]. These LDs are modulated by a 100 MHz pulse train based on random numbers. The random numbers are generated from a random physical noise device. This module also simultaneously generates 10 KHz clock synchronous signals to drive a synchronous LD. Finally, according to the experimental requirements, the transmitter can send four types of polarization states of single-photon pulses and synchronous optical signal to implement quantum communication and auxiliary time calibration respectively. In the transmission payload, the quantum optical signal and synchronous light are coupled into the same optical path and transmitted by a telescope system. Through a beam expander, emitted light with a narrow divergence angle can be transmitted farther with a lower loss of quantum signals. The deviation of beam directivity between synchronous light and the quantum optical signal is smaller than the divergence angle of 1/10, which is sufficient to ensure covering of the receiving telescope simultaneously.

 figure: Fig. 3

Fig. 3 A schematic diagram of the QKD setup. In transmission system, the quantum optical source is composed of eight laser diodes (LDs), these LDs are modulated by the 100 MHz pulse train based on random numbers and can send four kinds of polarization states of single photon pulses and synchronous optical signal to implement quantum communication and auxiliary time calibration. In the receiving system, we use telescope to collect the photons flying from the transmitter. After the optical encoding process and detected by SPCMs, the raw key is sent to the upper computer for postprocessing of error correction and privacy amplification. HWP: half-wave plate; BS: beam splitter; PBS: polarizing beam splitter, reflecting vertically polarized photons; DM: dichroic mirror; FSM: fast steering mirror.

Download Full Size | PDF

In the receiving system, we use a 1.2-m-diameter telescope to collect the photons transmitted from the transmitter. An integrated optical measurement system consisting of a beam splitter (BS), two polarization beam splitters (PBS), and an half wave plate (HWP) is assembled at the telescope. The polarization compensation against the rotational movement is implemented by a HWP in the receiver, as shown in Fig. 3. Passing through a narrow-band interference filter (full-width at half-maximum bandwidth ΔFWHM = 10 nm) used to reduce background noise, the photons are coupled in multimode fibers and then detected by single-photon counting modules (SPCMs) with low dark counts (≤ 100/s). After detection by SPCMs, the signal is recorded by a high-time-resolution time-to-digital converter (TDC). Finally, the raw key is sent to the upper computer for post-processing of error correction and privacy amplification.

2.2. Error correction based on turbo code

Error correction in QKD is the process by which Alice and Bob correct discrepancies between two strings, X and Y, via an authenticated classical channel. In any practical implementation of a QKD protocol, X and Y suffer from discrepancies mainly due to losses and fidelity of the channel. Therefore, all QKD protocols must include a classical post-processing to extract the final secret key from X and Y. In a QKD protocol, the information is encoded in binary variables. Errors are usually uncorrelated. For this reason, X and Y can be seen as the input and output of a binary symmetric channel (BSC). Typically, the crossover probability p of the BSC is supposed to be known.

There is one main measure of performance of an error correction scheme: reconciliation efficiency. Reconciliation efficiency f(p) is given by

f(p)=I(p)/H(p).
The definition of H(p) is the minimum information needed for reconciliation. I(p) represents the actual information needed.

In the following, we will use this expression to compare the efficiencies of different error correction schemes.

2.2.1. Turbo code

Turbo code can perform very close to the Shannon limit, even with a suboptimal but fast iterative decoding scheme. For reconciliation of binary strings, the Turbo decoding algorithm, specifically the maximum posterior probability (MAP) algorithm, needs to be modified for BSC.

The MAP soft decisions are defined as the log-likelihood ratio:

Lmap=(śs)S+αk1(ś)×γk(ś,s)×βk(s)(śs)Sαk1(ś)×γk(ś,s)×βk(s)
We will use the following shorthand for the transmitted/received symbols
yk=(xk,pk),ýk=(xk,pk)
The term αk−1(ś) is the probability of arriving at a branch in a particular state ś, and the term βk (s) is the probability of exiting a branch via a particular state s. The term γk (ś, s) indicates the transfer of state, and can be expressed as
γk(ś,s)=Pr(sk=s,yk|sk1=ś)

In QKD, Alice encodes a classical bit onto the polarization or phase of a photon and sends this photon to Bob. After repeating this step k times, Alice and Bob share two k-bit strings, and the crossover probability p of BSC is supposed as known. In public discussion, parity pair yk is transmitted via an authenticated classical channel. Therefore, we can obtain the following expression:

Pr(pk,pk)=1,Pr(xk,xk)=p

We can now express the transition probability γk (ś, s) as

γk(ś,s)=(1p)exp(12La(xk))1+exp(12La(xk))exp(12xkLa(xk))
In order to reduce complexity of the algorithm, we take the logarithm operation in the MAP algorithm, and the soft decisions can be expressed as
ln(Lmap(xk))=ln((śs)S+αk1(ś)γk(ś,s)βk(s))ln((śs)Sαk1(ś)γk(ś,s)βk(s))

The structure of a Turbo information reconciliation is shown in Fig. 4. As a Turbo encoder, two identical convolutional encoders are used. The order of the information bits undergoes a pseudo random permutation P prior to been fed into the second convolutional encoder. Many types of permutation can be used, as long as they are sufficiently random. The permutation can guarantee that the two constituent encoders are uncorrelated. Each convolutional encoder is based on a recursive systematic convolutional code. As a turbo decoder, a pair of decoders are used. The decoders are based on the Log-MAP algorithm and output soft decision information learned from the noisy parity bits.

 figure: Fig. 4

Fig. 4 A structure of Turbo code system. In the part of turbo encoder, two identical convolutional encoders are used. In part of turbo decoder, it consists of a pair of decoders which work cooperatively in order to refine and improve the estimate of the original information bits.

Download Full Size | PDF

2.2.2. Simulation and analysis

In this section we discuss the simulation performances of Cascade and our Turbo Code for a block length of 104. We implement Cascade described in [5] and our Turbo Code decoded with Log-MAP algorithm. The remaining bit error probability is below 10−3 for both Cascade and Turbo Code.

The emulated results of Cascade and Turbo Code are shown in Tab. 1. In the case of a low QBER, better efficiency can be achieved by Cascade, which is very close to the Shannon limit of 1. However, the error correction based on Cascade needs many times of data exchange and the efficiency is significantly deteriorated as the QBER increases. In contrast with Cascade, only one-time data exchange is needed in Turbo Code. Furthermore, the efficiency of error correction based on Turbo Code is good even for high QBERs. Thus, Turbo code is more suitable for satellite-ground QKD.

Tables Icon

Table 1. EC f(p) achieved by Turbo code and Cascade. Denote number_Cas and number_Tur are the number of messages exchanged. The error correction efficiencies, f_Cas and f_Tur, represent error correction based on Turbo code and Cascade, respectively.

3. Postprocessing and results

Due to the detector’s dark counts and stray light, the background count rate was less than 400 s−1 in our experiment. A 2-ns time coincident window was obtained, with contributions of the timing jitter from the synchronous optical signals of 620 ps, avalanche photo diodes (APDs) of 350 ps and the optical pulse width of 125 ps.

The experiment lasted for nearly 2 h at nighttime. During the process, the average channel loss, taking into account the transmission and collection efficiency of the telescopes, the free-space channel loss, and the fiber coupling efficiency, was around 40 dB. Note that there was an additional loss of 1 ~ 2 dB loss introduced by the time coincidence window.

The final key rate is one of main results in an QKD experiment. In our experiment, we obtain the final key rate of 513 bps with the QBER of 3.43 %. For comparison, Cascade and Turbo Code are employed in the same raw key groups. As shown in Tab. 2, with one-time data exchange, the final key rate of experiments based on Turbo Code is even higher than that of Cascade. Our results experimentally show that Turbo Code is a good alternative to Cascade and is potentially useful for satellite-ground quantum communication.

Tables Icon

Table 2. Experimental parameters and results. With T seconds effective key distribution, we get some raw key with QBER. We respectively adopt Turbo code and Cascade for error correction. After the process of error correction, we evaluate the RTur and RCas. In our table, f represents the error correction efficiencies. RTur and RCas are the final key generation rate based on Turbo code and Cascade.

4. Conclusion and discussions

We implement a 17-km free-space QKD with efficient Turbo Code error correction. The results show that Turbo Code can be used to reconcile two correlated discrete random variables. In terms of final key generation, using only one-time data exchange, it offers a similar behavior with Cascade for low QBER. For a QBER over 2.5%, Turbo code performs better than Cascade. For satellite-ground QKD, the error correction will require an timely processing, with as few times of data exchanges as possible. Thus, our results experimentally demonstrate that the efficient error correction based on Turbo Code is suitable for satellite-ground QKD. Another possible efficient error correction scheme for satellite-ground QKD might be Low Density Parity Code (LDPC) [23, 24]. Comparing with LDPC, the Turbo Code developed in this work performs better in the case of small block size, which is more suitable for online QKD. Furthermore, due to atmosphere turbulence and the changes in distance, QBER might be very unstable during the process of satellite-ground QKD. Given the QBER as p, the error correction efficiency of the code can be written as f=1H(p)(1R1). The upper bound of the code rate is Rmax=11+H(p). To achieve the best error correction efficiency, we need to design the error correction code according to the different QBERs. For the LDPC code, we need to construct different generator matrixes for different code rates. It is hard to construct a new generator matrix in real time when the QBER varies. Thus it is not convenient in satellite-ground QKD since the error rate is constantly changing. While for the Turbo code, it is easy to construct code simply by changing puncturing ratio.

Funding

National Fundamental Research Program (under grant no. 2013CB336800); National Natural Science Foundation of China; the Strategic Priority Research Program on Space Science, the Chinese Academy of Sciences; Zhejiang Provincial Natural Science Foundation of China (under Grant No. LY17F050004); K. C. Wong Magna Fund, Ningbo University.

Acknowledgments

This work has been supported by CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics, Shanghai Branch, University of Science and Technology of China.

References and links

1. C. H. Bennett and G. Brassard, “Quantum Cryptography: Public Key Distribution and Coin Tossing,” in Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, 175 (IEEE, 1985).

2. C. H. Bennett, G. Brassard, and N. D. Mermin, “Quantum cryptography without Bell’s theorem,” Phys. Rev. Lett. 68, 557–559 (1992). [CrossRef]   [PubMed]  

3. A. R. Dixon, Z. L. Yuan, J. F. Dynes, A. W. Sharpe, and A. J. Shields, “Gigahertz decoy quantum key distribution with 1 Mbit/s secure key rate,” Opt. Express 16, 18790–18979 (2008). [CrossRef]  

4. Z. L. Yuan, A. R. Dixon, J. F. Dynes, A. W. Sharpe, and A. J. Shields, “Practical gigahertz quantum key distribution based on avalanche photodiodes,” New J. Phys. 11, 045019 (2009). [CrossRef]  

5. J. F. Dynes, H. Takesue, Z. L. Yuan, A. W. Sharpe, K. Harada, T. Honjo, H. Kamada, O. Tadanaga, Y. Nishida, M. Asobe, and A. J. Shields, “Efficient entanglement distribution over 200 kilometers,” Opt. Express 17, 11440–11449 (2009). [CrossRef]   [PubMed]  

6. Y. Liu, T.-Y. Chen, J. Wang, W.-Q. Cai, X. Wan, L.-K. Chen, J.-H. Wang, S.-B. Liu, H. Liang, L. Yang, C.-Z. Peng, K. Chen, Z.-B. Chen, and J.-W. Pan, “Decoy-state quantum key distribution with polarized photons over 200 km,” Opt. Express 18, 8587–8594 (2010). [CrossRef]   [PubMed]  

7. H.-L. Yin, T.-Y. Chen, Z.-W. Yu, H. Liu, L.-X. You, Y.-H. Zhou, S.-J. Chen, Y.-Q. Mao, M.-Q. Huang, Zhang, W.-J. Zhang, H. Chen, M.-J. Li, N. Daniel, F. Zhou, X. Jiang, Z. Wang, Q. Zhang, X.-B. Wang, and J.-W. Pan, “Measurement device independent quantum key distribution over 404 km optical fibre,” Phys. Rev. Lett. 117, 190501 (2016). [CrossRef]  

8. C.-Z. Peng, T. Yang, X.-H. Bao, J. Zhang, X.-M. Jin, F.-Y. Feng, B. Yang, J. Yang, J. Yin, Q. Zhang, N. Li, B.-L. Tian, and J.-W. Pan, “Experimental free-space distribution of entangled photon pairs over 13 km: towards satellite-based global quantum communication,” Phys. Rev. Lett. 94, 150501 (2005). [CrossRef]   [PubMed]  

9. R. Ursin, F. Tiefenbacher, T. Schmitt-Manderbach, H. Weier, T. Scheidl, M. Lindenthal, B. Blauensteiner, T. Jen-newein, J. Perdigues, P. Trojek, B. Omer, M. Frst, M. Meyenburg, J. Rarity, Z. Sodnik, C. Barbieri, H. Weinfurter, and A. Zeilinger, “Entanglement-based quantum communication over 144 km,” Nat. Phys. 3, 481–486 (2007). [CrossRef]  

10. T. Schmitt-Manderbach, H. Weier, M. Furst, R. Ursin, F. Tiefenbacher, T. Scheidl, J. Perdigues, Z. Sodnik, J. G. Rarity, A. Zeilinger, and H. Weinfurter, “Experimental demonstration of free-space decoy-state quantum key distribution over 144 km,” Phys. Rev. Lett. 98, 010504 (2007). [CrossRef]   [PubMed]  

11. J. Yin, J.-G. Ren, H. Lu, Y. Cao, H.-L. Yong, Y.-P. Wu, C. Liu, S.-K. Liao, F. Zhou, Y. Jiang, X.-D. Cai, P. Xu, G.-S. Pan, J.-J. Jia, Y.-M. Huang, H. Yin, J.-Y. Wang, Y.-A. Chen, C.-Z. Peng, and J.-W. Pan, “Quantum teleportation and entanglement distribution over 100-kilometre free-space channels,” Nature 488, 185–188 (2012). [CrossRef]   [PubMed]  

12. X.-S. Ma, T. Herbst, T. Scheidl, D. Wang, S. Kropatschek, W. Naylor, B. Wittmann, A. Mech, J. Kofler, E. Anisimova, V. Makarov, T. Jennewein, R. Ursin, and A. Zeilinger, “Quantum teleportation over 143 kilometres using active feed-forward,” Nature 489, 269–273 (2012). [CrossRef]   [PubMed]  

13. J.-Y. Wang, B. Yang, S.-K. Liao, L. Zhang, Q. Shen, X.-F. Hu, J.-C. Wu, S.-J. Yang, H. Jiang, Y.-L. Tang, B. Zhong, H. Liang, W.-Y. Liu, Y.-H. Hu, Y.-M. Huang, B. Qi, J.-G. Ren, G.-S. Pan, J. Yin, J.-J. Jia, Y.-A. Chen, K. Chen, C.-Z. Peng, and J.-W. Pan, “Direct and full-scale experimental verifications towards ground-satellite quantum key distribution,” Nat. Photon. 7, 387–393 (2013). [CrossRef]  

14. S. Nauerth, F. Moll, M. Rau, J. Horwath, S. Frick, C. Fuchs, and H. Weinfurter, “Air-to-ground quantum communication,” Nat. Photon. 7, 382–386 (2013). [CrossRef]  

15. Y. Cao, H. Liang, J. Yin, H.-L. Yong, F. Zhou, Y.-P. Wu, J.-G. Ren, Y.-H. Li, G.-S. Pan, T. Yang, X. Ma, C.-Z Peng, and J.-W. Pan, “Entanglement-based quantum key distribution with biased basis choice via free space,” Opt. Express 21, 27260–27268 (2013). [CrossRef]   [PubMed]  

16. J. Wang, “China Launches First Quantum Science Satellite,” Aerospace China 17, 56 (2016).

17. X. Ma, C.-H. F. Fung, J.-C. Boileau, and H. F. Chau, “Universally composable and customizable post-processing for practical quantum key distribution,” Computers & Security 30, 172–177 (2011). [CrossRef]  

18. D. Elkouss, J. Martinez-Mateo, and V. Martin, “Information reconciliation for QKD,” Quantum Inf. Comput. 11, 226 (2011).

19. T.-B. Pedersen and M. Toyran, “High Performance Information Reconciliation for QKD with Cascade,” Quantum Inf. Comput. 15, 419 (2015).

20. W.-Y. Hwang, “Quantum key distribution with high loss: toward global secure communication,” Phys. Rev. Lett. 91, 057901 (2003). [CrossRef]   [PubMed]  

21. X.-B. Wang, “Beating the photon-number-splitting attack in practical quantum cryptography,” Phys. Rev. Lett. 94, 230503 (2005). [CrossRef]   [PubMed]  

22. H.-K. Lo, X.-F. Ma, and K. Chen, “Decoy state quantum key distribution,” Phys. Rev. Lett. 94, 230504 (2005). [CrossRef]   [PubMed]  

23. D. Dlkouss, A. Leverrier, R. Alleaume, and J. J. Boutros, “Efficient reconciliation protocol for discrete-variable quantum key distribution,” IEEE International Conference on Symposium on Information Theory, 1879–1883 (2009)

24. K. Kasai, R. Matsumoto, and K. Sakaniwa, “Information reconciliation for QKD with rate-compatible non-binary LDPC codes,” International Symposium on Information Theory & Its Applications 16, 922–927(2010).

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (4)

Fig. 1
Fig. 1 The transmitter (a) and receiver (b) telescope. The transmitter telescope is a engineering model of QSS. We place it on a turntable to simulate the satellite movement in orbit. The receiver telescope is a Cassegrain telescope which used to receive the quantum signals at receiver station.
Fig. 2
Fig. 2 Performance of APT on the X and Y axis measured in the transmitter.
Fig. 3
Fig. 3 A schematic diagram of the QKD setup. In transmission system, the quantum optical source is composed of eight laser diodes (LDs), these LDs are modulated by the 100 MHz pulse train based on random numbers and can send four kinds of polarization states of single photon pulses and synchronous optical signal to implement quantum communication and auxiliary time calibration. In the receiving system, we use telescope to collect the photons flying from the transmitter. After the optical encoding process and detected by SPCMs, the raw key is sent to the upper computer for postprocessing of error correction and privacy amplification. HWP: half-wave plate; BS: beam splitter; PBS: polarizing beam splitter, reflecting vertically polarized photons; DM: dichroic mirror; FSM: fast steering mirror.
Fig. 4
Fig. 4 A structure of Turbo code system. In the part of turbo encoder, two identical convolutional encoders are used. In part of turbo decoder, it consists of a pair of decoders which work cooperatively in order to refine and improve the estimate of the original information bits.

Tables (2)

Tables Icon

Table 1 EC f(p) achieved by Turbo code and Cascade. Denote number_Cas and number_Tur are the number of messages exchanged. The error correction efficiencies, f_Cas and f_Tur, represent error correction based on Turbo code and Cascade, respectively.

Tables Icon

Table 2 Experimental parameters and results. With T seconds effective key distribution, we get some raw key with QBER. We respectively adopt Turbo code and Cascade for error correction. After the process of error correction, we evaluate the RTur and RCas. In our table, f represents the error correction efficiencies. RTur and RCas are the final key generation rate based on Turbo code and Cascade.

Equations (7)

Equations on this page are rendered with MathJax. Learn more.

f ( p ) = I ( p ) / H ( p ) .
L m a p = ( ś s ) S + α k 1 ( ś ) × γ k ( ś , s ) × β k ( s ) ( ś s ) S α k 1 ( ś ) × γ k ( ś , s ) × β k ( s )
y k = ( x k , p k ) , ý k = ( x k , p k )
γ k ( ś , s ) = Pr ( s k = s , y k | s k 1 = ś )
Pr ( p k , p k ) = 1 , Pr ( x k , x k ) = p
γ k ( ś , s ) = ( 1 p ) exp ( 1 2 L a ( x k ) ) 1 + exp ( 1 2 L a ( x k ) ) exp ( 1 2 x k L a ( x k ) )
ln ( L m a p ( x k ) ) = ln ( ( ś s ) S + α k 1 ( ś ) γ k ( ś , s ) β k ( s ) ) ln ( ( ś s ) S α k 1 ( ś ) γ k ( ś , s ) β k ( s ) )
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.