dorsal/arxiv
View SchemaFundamentals for immediate implementation of a quantum secured Internet
| Authors | Geraldo A. Barbosa |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0607093 |
| URL | https://arxiv.org/abs/quant-ph/0607093 |
Abstract
This work shows how a secure Internet for users A and B can be implemented through a fast key distribution system that uses physical noise to encrypt information transmitted in deterministic form. Starting from a shared secret random sequence between them, long sequences of fresh random bits can be shared in a secure way and not involving a third party. The shared decrypted random bits -encrypted by noise at the source- are subsequently utilized for one-time-pad data encryption. The physical generated protection is not susceptible to advances in computation or mathematics. In particular, it does not depend on the difficulty of factoring numbers in primes. Also, there is no use of Linear Feed Back Shift Registers. The attacker has free access to the communication channels and may acquire arbitrary number of copies of the transmitted signal without lowering the security level. No intrusion detection method is needed.
{
"annotation_id": "39e24c0e-7810-4622-90ee-0c4a23557f27",
"date_created": "2026-03-02T18:02:27.671000Z",
"date_modified": "2026-03-02T18:02:27.671000Z",
"file_hash": "eb729a77ee2e98c137287ad5bedf195dbf7f5c37c7ced0c94ebecd9f79c89d8d",
"private": false,
"record": {
"abstract": "This work shows how a secure Internet for users A and B can be implemented\nthrough a fast key distribution system that uses physical noise to encrypt\ninformation transmitted in deterministic form. Starting from a shared secret\nrandom sequence between them, long sequences of fresh random bits can be shared\nin a secure way and not involving a third party. The shared decrypted random\nbits -encrypted by noise at the source- are subsequently utilized for\none-time-pad data encryption. The physical generated protection is not\nsusceptible to advances in computation or mathematics. In particular, it does\nnot depend on the difficulty of factoring numbers in primes. Also, there is no\nuse of Linear Feed Back Shift Registers. The attacker has free access to the\ncommunication channels and may acquire arbitrary number of copies of the\ntransmitted signal without lowering the security level. No intrusion detection\nmethod is needed.",
"arxiv_id": "quant-ph/0607093",
"authors": [
"Geraldo A. Barbosa"
],
"categories": [
"quant-ph"
],
"title": "Fundamentals for immediate implementation of a quantum secured Internet",
"url": "https://arxiv.org/abs/quant-ph/0607093"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e5455671-d7f4-4dea-8817-91e9f8be3342",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}