All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

The Throughput Bottleneck of Quantum-Secure Communication Links: Analysis and Mitigation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F24%3A00377616" target="_blank" >RIV/68407700:21230/24:00377616 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/TCOMM.2024.3394746" target="_blank" >https://doi.org/10.1109/TCOMM.2024.3394746</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TCOMM.2024.3394746" target="_blank" >10.1109/TCOMM.2024.3394746</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    The Throughput Bottleneck of Quantum-Secure Communication Links: Analysis and Mitigation

  • Original language description

    The use of quantum key distribution (QKD) to improve security may impact the quality of service (Qos) of high rate classical data links. The key generation process with an empty buffer can be modeled as a queuing system, and data throughput limits can be determined using queueing theory to assess the impact on the QoS. The proposed key generation model is based on an on-demand paradigm. Based on the results of this study, a discrete variable (DV)-QKD-secured link could be designed using the data rate bounds to guarantee a given QoS. Furthermore, we validate the derived bounds by comparing the theoretical derivations with simulations. We show that in a one-time-pad system, the achievable throughput approaches 0.59 times the secret key rate as the key length increases. In the case of a key scheme with key reuse, the throughput is asymptotically linear with the number of key reuses, and the slope of the curve corresponds to the secret key rate multiplied by a function of the protocol and channel characteristics. The analysis is carried out on optical fiber and free-space links.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20202 - Communication engineering and systems

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2024

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    IEEE Transactions on Communications

  • ISSN

    0090-6778

  • e-ISSN

    1558-0857

  • Volume of the periodical

    72

  • Issue of the periodical within the volume

    10

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    11

  • Pages from-to

    6416-6426

  • UT code for WoS article

    001340385300021

  • EID of the result in the Scopus database

    2-s2.0-85192148892