Quantum Key Distillation using Binary Frames

López²,

Samperio³

2020

Preprint

Self Cite

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.

Section: Quantum Communicationmentioning

confidence: 99%

“…As specified in the framed reconciliation method [12], Bob must reveal the sifting bits along the measured bits. However, each SS maps two different MRs as it can be verified in Tab.5.…”

Section: One Time Pad Xor Equivalencymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Beyond the Limits of Shannon’s Information in Quantum Key Distribution

López²,

Samperio³

2020

Preprint

Self Cite

“…The eavesdropper cannot control quantum communication because she produces a detectable noise. Recent works has been done to resist quantum attacks [7,8,9].…”

Section: Introductionmentioning

confidence: 99%

Non-invertible Public Key Certificates

López²

2020

Preprint

Self Cite

Post-quantum public cryptosystems introduced so far do not define an scalable public key infrastructure for the quantum era. We demonstrate here a public certification system based in Lizama’s non-invertible Key Exchange Protocol which can be used to implement a public key infrastructure (PKI), secure, scalable, interoperable and efficient. We show functionality of certificates across different certification domains. Finally, we discuss that non-invertible certificates can exhibit Perfect Forward Secrecy (PFS).

Non-Commutative Key Exchange Protocol

Romero²

2022

Preprint

We introduce a novel key exchange protocol based on non-commutative matrix multiplication defined in $\mathbb{F}_p^{n \times n}$. The security of our method does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured. We show that the public, secret and channel keys become indistinguishable to the eavesdropper under matrix multiplication. Remarkably, for achieving a 512-bit security level, the public key is 1024 bits and the private key is 768 bits, making them the smallest keys among post-quantum key exchange algorithms. Also, we discuss how to achieve key authentication, interdomain certification and Perfect Forward Secrecy (PFS). Therefore, Lizama's algorithm becomes a promising candidate to establish shared keys and secret communication between (IoT) devices in the quantum era.