Bibliographic record
Abstract
The study of quantum computation has yielded many advantages over classical computing. One area in which quantum computation has been shown to be superior is encryption. The main advantage of quantum key distribution schemes over conventional ones is that the security of the former is guaranteed by the very laws of physics (quantum mechanics in this case), while the security of the latter usually rests on unproven assumptions about the computational difficulty of a certain problem (such as factoring a large integer).This study focuses on two key distribution protocols based on the quantum model: One developed by Charles Bennett and Gilles Brassard in 1984 (BB84), the other developed by Marius Nagy and Selim Akl in 2006 (NA06), which uses BB84 as a base, but expands on it using the Quantum Fourier Transform.Unlike conventional protocols, quantum protocols have the ability to detect eavesdropping and the NA06 protocol is the first key distribution scheme capable of detecting an eavesdropper by testing bits that were not even eavesdropped on while in transit. The purpose of this study is to asses the performance of this novel protocol relative to the now classical BB84. These protocols are simulated on a classical computer and compared to determine what advantages, if any, the NA06 protocol holds over the BB84. The results of this report have implications in the theory of quantum key distribution.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.008 | 0.032 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.008 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".