Calculation of key reduction for B92 QKD protocol

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86094286" target="_blank" >RIV/61989100:27240/15:86094286 - isvavai.cz</a>
Result on the web
<a href="http://spie.org/Publications/Proceedings/Paper/10.1117/12.2177149" target="_blank" >http://spie.org/Publications/Proceedings/Paper/10.1117/12.2177149</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1117/12.2177149" target="_blank" >10.1117/12.2177149</a>

Result language
angličtina
Original language name
Calculation of key reduction for B92 QKD protocol
Original language description
It is well known that Quantum Key Distribution (QKD) can be used with the highest level of security for distribution of the secret key, which is further used for symmetrical encryption. B92 is one of the oldest QKD protocols. It uses only two non-orthogonal states, each one coding for one bit-value. It is much faster and simpler when compared to its predecessors, but with the idealized maximum efficiencies of 25% over the quantum channel. B92 consists of several phases in which initial key is significantly reduced: secret key exchange, extraction of the raw key (sifting), error rate estimation, key reconciliation and privacy amplification. QKD communication is performed over two channels: the quantum channel and the classical public channel. In order to prevent a man-in-the-middle attack and modification of messages on the public channel, authentication of exchanged values must be performed. We used Wegman-Carter authentication because it describes an upper bound for needed symmetric a
Czech name
—
Czech description
—

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)