Quantum cryptography with fewer random numbers
Quantum Physics
2007-05-23 v1
Abstract
We prove that in the BB84 quantum cryptography protocol Alice and Bob do not need to make random bases-choice for each qubit: they can keep the same bases for entire blocks of qubits. It suffices that the raw key consists of many such qubit-blocks. The practical advantage of reducing the need for random number is emphasized.
Keywords
Cite
@article{arxiv.quant-ph/0303052,
title = {Quantum cryptography with fewer random numbers},
author = {N. Gisin},
journal= {arXiv preprint arXiv:quant-ph/0303052},
year = {2007}
}
Comments
2 pages, 1 figure