|
Descripción
|
|
|---|---|
| We consider in this thesis the problem of information reconciliation in the context of secret key distillation between two legitimate parties. In some scenarios of interest this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel. In particular, we demonstrate that our method leads to a signi?cant ef?ciency improvement, with respect to earlier interactive reconciliation methods. We propose a protocol based on LDPC codes that can be adapted to changes in the communication channel extending the original source. The ef?ciency of our protocol is only limited by the quality of the code and, while transmitting more information than needed to reconcile Alice?s and Bob?s sequences, it does not reveal any more information on the original source than an ad-hoc code would have revealed. | |
|
Internacional
|
Si |
|
ISBN
|
|
|
Tipo de Tesis
|
Doctoral |
|
Calificación
|
Sobresaliente cum laude |
|
Fecha
|
13/12/2011 |