Numerical Finite Key Analysis

Abstract

In this thesis, we begin by both expounding and improving the theory of finite key analysis. Our improvement of the analysis in turn improves the amount of key that can be generated for protocols without nice symmetries. Following this improvement, we present a numerical method for the finite key analysis of QKD protocols that can be represented in fi nite-dimensional Hilbert spaces without requiring specif c symmetries. Lastly, we present the nite key analysis for variations of the BB84 protocol [7] for both better understanding of the finite key analysis and proof of the general applicability of our numerical method.