Simultaneous Basis and Information Reconciliation in Quantum Key Distribution

We consider in this paper the practical implementation of a siftingless quantum key distribution protocol. The protocol is considered siftingless since it combines sifting and error correction in a single step for basis and information reconciliation, respectively. The protocol can be efficiently implemented even assuming the existence of errors in the communication. In this case, the correlations between the legitimate parties can be modeled by a binary symmetric channel with erasures. Specific codes for this channel are included and simulated for intermediate block lengths. Simulation results show that a key reconciliation step carrying simultaneously both basis and information reconciliation can be efficiently implemented.