Quantum cryptography with fewer random numbers

Simple item page
dc.creatorGisin, N.
dc.date2003-03-10
dc.date.accessioned2026-07-07T06:06:17Z
dc.date.available2026-07-07T06:06:17Z
dc.descriptionWe 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.
dc.description2 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/quant-ph/0303052
dc.identifierhttp://arxiv.org/abs/quant-ph/0303052
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90925
dc.subjectQuantum Physics
dc.titleQuantum cryptography with fewer random numbers
dc.typetext

Files

Collections

arXiv