We introduce a constructive method to calculate the achievable secret key rate for a generic class of quantum key distribution protocols, when only a finite number
n of signals is given. Our approach is applicable to all scenarios in which the quantum state shared by Alice and Bob is known. In particular, we consider the six state protocol with symmetric eavesdropping attacks, and show that for a small number of signals, i.e., below $n\ensuremath{\sim}{10}^{4}$, the finite key rate differs significantly from the asymptotic value for $n\ensuremath{\rightarrow}\ensuremath{\infty}$. However, for larger
n, a good approximation of the asymptotic value is found. We also study secret key rates for protocols using higher-dimensional quantum systems.
Continuous-variable quantum key distribution (CVQKD) protocols with entanglement in the middle (EM) enable long maximal transmission distances for quantum communications. For the security analysis of the protocols, it is usually assumed that Eve performs collective Gaussian attacks and there is a lack of finite-size analysis of the protocols. However, in this paper we consider the finite-size regime of the EM-based CVQKD protocols by exposing the protocol to collective attacks and coherent attacks. We differentiate between the collective attacks and the coherent attacks while comparing asymptotic key rate and the key rate in the finite-size scenarios. Moreover, both symmetric and asymmetric configurations are collated in a contrastive analysis. As expected, the derived results in the finite-size scenarios are less useful than those acquired in the asymptotic regime. Nevertheless, we find that CVQKD with entanglement in the middle is capable of providing fully secure secret keys taking the finite-size effects into account with transmission distances of more than 30 km.
Quantum key distribution (QKD) enables secure information exchange with untrusted quantum links between remote communication parties. A central task in the studies of QKD protocols is security analysis, which aims at deriving the length of the final key such that it is secure regardless of the eavesdropper's computational power. In literature, the security analysis has been done both analytically and numerically. Compared to analytical methods which tend to require techniques specific to each QKD protocol, numerical ones are more general since they can be directly applied to many QKD protocols with little adaptation. However, current numerical methods are carried out based on some assumptions such as working in the asymptotic limit and collective attacks from eavesdroppers. In this work, we remove these assumptions and develop a numerical finite-size security analysis against general attacks for a large class of QKD protocols. We also give an example of applying the method to the recent phase-matching QKD protocol with a simplified protocol design. Our result shows that the finite-size key rate can surpass the linear key-rate bound with a practical QKD system operated for only several hours.