We present a new post-processing method for Quantum Key Distribution (QKD) that raises cubically the secret key rate in the number of double matching detection events. In Shannon’s communication model, information is prepared at Alice’s side, and it is then intended to pass it over a noisy channel. In our approach, secret bits do not rely in Alice’s transmitted quantum bits but in Bob’s basis measurement choices. Therefore, measured bits are publicly revealed, while bases selections remain secret. Our method implements sifting, reconciliation, and amplification in a unique process, and it just requires a round iteration; no redundancy bits are sent, and there is no limit in the correctable error percentage. Moreover, this method can be implemented as a post-processing software into QKD technologies already in use.

We present a new post-processing method for Quantum Key Distribution (QKD) that raise cubically the secret key rate in the number of double matching detection events. In Shannon’s communication model information is prepared at Alice’s side then it is intended to pass it over a noisy channel. In our approach, secret bits do not rely in Alice’s transmitted quantum bits but in Bob’s basis measurement choices. Therefore measured bits are publicly revealed while bases selections remain secret. Our method implements sifting, reconciliation and amplification in a unique process, it just require a round iteration, no redundancy bits are sent and there is no limit in the correctable error percentage. Moreover, this method can be implemented as a post processing software into QKD technologies already in use.