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

Dr. Dimiter Ostrev

German Aerospace Center (DLR)

Meeting Details
Meeting Link: tum-conf.zoom.us/j/66647562383
Meeting ID: 666 4756 2383
Meeting Passcode: 638025

Abstract:

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.

Biography:

Dimiter Ostrev received a Bachelor of Science degree in Mathematics and in Economics from Yale University, a Master of Advanced Study degree in Mathematics from the University of Cambridge, and a PhD degree in Mathematics from Massachusetts Institute of Technology with advisor Prof. Peter Shor. From 2016 to 2021, he was a research associate in the Interdisciplinary Centre for Security, Reliability and Trust at the University of Luxembourg. From October 2021, he is a research associate at Deutsches Zentrum für Luft- und Raumfahrt -- Institut für Kommunikation und Navigation.