Security, Reliability and Trust; Computational Sciences

http://hdl.handle.net/10993/48038

QKD parameter estimation by two-universal hashing leads to faster convergence to the asymptotic rate

English

Ostrev, Dimiter[University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > APSIA >]

14-Sep-2021

No

[en] Quantum key distribution ; Parameter estimation ; Two-universal hashing ; Convergence of finite to asymptotic rate

[en] This paper proposes and proves security of a QKD protocol which uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors. For this protocol, the difference between asymptotic and finite key rate decreases with the number $n$ of qubits as $cn^{-1}$, where $c$ depends on the security parameter. For comparison, the same difference decreases no faster than $c'n^{-1/3}$ for an optimized protocol that uses random sampling and has the same asymptotic rate, where $c'$ depends on the security parameter and the error rate.

Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA)

Fonds National de la Recherche - FnR

FNR CORE project Q-CoDe (CORE17/IS/11689058)

Researchers ; Professionals ; Students ; General public