Security Analysis of a Next Generation TF-QKD for Secure Public Key Distribution with Coherent Detection over Classical Optical Fiber Networks
Bibliographic record
Abstract
Twin-field quantum key distribution (TF-QKD) has recently attracted attention for its ability to overcome the fundamental limits of secret key rate for point-to-point connectivity without quantum repeaters in QKD. Coherent-based TF-QKD or CTF-QKD, which utilizes coherent states for both transmissions and detections, has allowed systems to be designed for existing optical fiber communication networks allowing for improved performance compared to conventional QKD. Here, we report a theoretical study of CTF-QKD security from an eavesdropper. Compared to conventional QKD and TF-QKD systems, CTF-QKD system is not limited to using only single photon sources/detectors allowing this system to have comparable performance and range as current optical fiber networks. Using commercially available simulation software, we verify the efficacy by studying three different preventative measures for different modulation formats to prevent an eavesdropper from obtaining any secret key information. Results show that parameters can be limited to prevent an eavesdropper from obtaining any information. The simulation also demonstrates that the photon number-phase uncertainty principle for coherent states starts to play major role of security at 128-QAM modulation. Additional security measures are also described to detect the presence of an eavesdropper and improve the system integrity.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
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".