dorsal/arxiv
View SchemaQuantum cryptography with fewer random numbers
| Authors | N. Gisin |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0303052 |
| URL | https://arxiv.org/abs/quant-ph/0303052 |
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.
{
"annotation_id": "525a59ec-faff-411b-8b9e-dbd950949d0d",
"date_created": "2026-03-02T18:01:56.277000Z",
"date_modified": "2026-03-02T18:01:56.277000Z",
"file_hash": "197adc4fe5e20ec4fbb7b077d6c6eeea3a0137ef8d228bbc092b4dd80b91aee1",
"private": false,
"record": {
"abstract": "We prove that in the BB84 quantum cryptography protocol Alice and Bob do not\nneed to make random bases-choice for each qubit: they can keep the same bases\nfor entire blocks of qubits. It suffices that the raw key consists of many such\nqubit-blocks. The practical advantage of reducing the need for random number is\nemphasized.",
"arxiv_id": "quant-ph/0303052",
"authors": [
"N. Gisin"
],
"categories": [
"quant-ph"
],
"title": "Quantum cryptography with fewer random numbers",
"url": "https://arxiv.org/abs/quant-ph/0303052"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c803f8fc-8f5e-4694-876f-a19d7c5e7ee1",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}