Publication | Open Access
Upper bounds of eavesdropper’s performances in finite-length code with the decoy method
118
Citations
20
References
2007
Year
EngineeringIterative DecodingComputational ComplexityHardware SecurityQuantum ComputingPost-quantum CryptographyQuantum EntanglementCoding TheoryVariable-length CodeQuantum Key DistributionQuantum CryptographyQuantum ScienceQuantum SecurityComputer EngineeringFinite-length CodeComputer ScienceSignal ProcessingError Correction CodeUpper BoundsCryptographyDecoy MethodSecurity FormulasQuantum Communication
Security formulas of quantum key distribution (QKD) with imperfect resources are obtained for finite-length code when the decoy method is applied. This analysis is useful for guaranteeing the security of implemented QKD systems. Our formulas take into account the effect of the vacuum state and dark counts in the detector. We compare the asymptotic key generation rate in the presence of dark counts to that without the presence of dark counts.
| Year | Citations | |
|---|---|---|
Page 1
Page 1