|
Descripción
|
|
|---|---|
| Cascade is probably the best known protocol for error reconciliation in QKD. Although this is a highly interactive protocol, since it requires many communication between the parties, it is reasonably efficient and easy to implement. Accordingly, a number of modifications and optimizations have been proposed in the literature. Most of these works concentrate on how to optimize the efficiency of reconciliation by modifying the block length, but others propose modifications to the protocol itself, combining a version of the original Cascade with a second algorithm with a specific focus on improving the reconciliation efficiency, or the number of channel communications. The aim of this contribution is to study the modifications of Cascade, comparing them with the original protocol on the grounds of a full set of parameters, so that the effect of these modifications can be fairly assessed. A number of simulations were performed to study not only the efficiency but also other characteristics of the protocol that are important for its practical application, such as the number of communications and the failure probability. Note that, although it is generally believed that the only price to pay for an improved efficiency is an increased interactivity, when looking at all the significant magnitudes a different view emerges, showing that, for instance, the failure probability eliminate some the supposed advantages of these improvements. | |
|
Internacional
|
Si |
|
Entidad
|
QCRYPT 2014 |
|
Lugar
|
|
|
Páginas
|
|
|
Referencia/URL
|
|
|
Tipo de publicación
|
Poster |