Write, autoreview, editor, reviewer
3,129
edits
Line 51: | Line 51: | ||
and <math>h(\cdot)</math> is the [[binary entropy function]]. | and <math>h(\cdot)</math> is the [[binary entropy function]]. | ||
In | In the above equation for key length, the parameters <math>\epsilon_{\rm EC}</math> and <math>\epsilon'_{\rm EC}</math> are error probabilities of the classical error correction subroutine. At the end of the error correction step, if the protocol does not abort, then Alice and Bob share equal strings of bits with probability at least <math>1-\epsilon_{\rm EC}</math>. The parameter <math>\epsilon'_{\rm EC}</math> is related with the completeness of the error correction subroutine, namely that for an honest implementation, the error correction protocol aborts with probability at most <math>\epsilon'_{\rm EC}+\epsilon_{\rm EC}</math>. | ||
The parameter | The parameter <math>\epsilon_{\rm PA}</math> is the error probability of the privacy amplification subroutine and <math>\epsilon_{\rm PE}</math> is the error probability of the parameter estimation subroutine used to estimate <math>Q_X</math>. | ||
(See [[Quantum Key Distribution]] for the precise security definition) | (See [[Quantum Key Distribution]] for the precise security definition) | ||