⚛️ quantum physics

From Link Availability to Deadline-Constrained Key Service: A Feasibility Framework for Mobile Free-Space Quantum Key Distribution

This paper presents a systems-level feasibility framework that distinguishes between intermittent optical link availability and deadline-constrained key service delivery for mobile free-space QKD, utilizing a time-indexed inventory model to determine whether cryptographic demands can be met without borrowing from future contact windows.

Original authors: Hasan Abbas Al-Mohammed

Published 2026-10-26

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Hasan Abbas Al-Mohammed

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the high-stakes world of secure communication, there is a growing race to build systems that cannot be cracked by future computers. One of the most promising solutions involves sending information using individual particles of light, a method known as quantum key distribution. This technique allows two parties to generate a shared, secret code that is mathematically guaranteed to be secure, provided the laws of physics hold true. However, for this technology to be useful in the real world, it must work not just in a controlled laboratory, but on moving vehicles like trains, drones, or satellites, where the connection is often broken by clouds, distance, or the curve of the earth. The central challenge is not merely whether the light can travel from point A to point B, but whether the secret code arrives exactly when the application needs it. A connection that works for a few seconds might produce a secret key, but if that key is generated too late to unlock a door or encrypt a message, the entire effort is useless.

A recent technical note by researcher Hasan Al-Mohammed addresses this specific gap between the physics of light and the timing of real-world needs. The work does not propose a new way to send light or a new mathematical proof of security. Instead, it offers a clear accounting framework to determine if a mobile quantum system can actually deliver a service. The author breaks down the process into three distinct stages. First, the physical link must be established, meaning the transmitter and receiver must successfully align and see each other through the atmosphere. Second, the system must process the data collected during that brief window to generate a verified secret key. Third, that key must be available in the right place before a specific deadline. The paper argues that passing the first two stages does not guarantee success in the third. A system might have a healthy total amount of light collected over a day, yet fail completely if the key material arrives after the moment it was needed.

To illustrate this, the author uses a simple inventory model. Imagine a train equipped with a quantum receiver that can only connect to a ground station for short bursts as it passes through a valley. The system collects data during these bursts and turns it into secret keys. The paper shows that even if the total number of keys generated over the day is enough to cover all the train's security needs, the timing might be wrong. If the train needs a key at 9:00 AM to secure a message, but the only connection that produces a key happens at 9:15 AM, the system has failed its service requirement. The author introduces a straightforward test to check this: at every moment in time, the total amount of key material available must be greater than or equal to the total amount of key material demanded up to that point. If the demand ever outstrips the supply, even by a small margin, the service is broken, regardless of how much extra key is generated later.

The paper also explores how the way data is collected affects the final result. In quantum systems, the security of the key depends on the size of the data block being processed. If a system breaks a long period of observation into many tiny, fragmented pieces, each piece might be too small to yield a secure key on its own. The author demonstrates that combining these small fragments into a single, larger block can sometimes turn a zero result into a positive one. However, this is not a universal rule; it depends on whether the system can legally and securely combine data from different moments without compromising the security proof. The analysis suggests that simply counting the total time the link is active is misleading; one must look at the size and timing of each individual contact window.

Through two specific numerical examples, the study highlights the difference between total yield and timely delivery. In one scenario, a system generates a large amount of secret key early in the day, easily covering all subsequent demands. In another scenario, the exact same total amount of key is generated, but it all arrives at the very end of the day. While the total number of bits is identical, the second scenario fails completely because the keys were not available when needed. The author calculates a "deficit" for the failed scenario, showing exactly how much extra initial storage would have been required to prevent the outage. This approach shifts the focus from asking "how much key did we make?" to "did we have the right key at the right time?"

The work concludes by outlining a checklist for future experiments and operational systems. It calls for researchers to report not just the total secret bits produced, but the precise timing of when those bits became usable, the specific conditions of each connection window, and the exact demands of the application. By separating the physics of the light link, the security of the key generation, and the logistics of the service delivery, the paper provides a tool for engineers to benchmark their systems realistically. It warns that a positive result in one area, such as a strong optical signal, does not automatically imply a positive result in the next. For mobile quantum communication to become a reliable service, it must be judged not just by its ability to connect, but by its ability to deliver security exactly when it is required.

Technical Summary: From Link Availability to Deadline-Constrained Key Service

Problem Statement
Mobile free-space quantum key distribution (QKD) links, such as those involving trains, UAVs, or satellites, often provide secret bits intermittently. However, cryptographic applications require key material at specific, predetermined times. A critical discrepancy exists between three distinct claims often conflated in literature:

Optical Feasibility: The physical link yields a valid observation window (positive received power).
Finite-Key Output: The QKD protocol produces a non-negative, security-qualified secret key from those observations.
Deadline-Constrained Service: The resulting keys are available in the correct trust domain before the application's demand deadline.

The paper argues that positive optical availability or a positive long-run secret-key rate does not guarantee that keys are available when needed. Specifically, keys generated after a deadline cannot retroactively serve that deadline, and fragmented short contacts may fail to yield positive keys even if the total observation time is sufficient.

Methodology
The paper proposes a systems-level accounting framework rather than a new cryptographic proof or hardware experiment. The methodology consists of:

Three Feasibility Gates: The author formalizes a sequence of evaluations: Physical Contact (geometry/atmosphere), Secret-Key Certification (finite-key analysis), and Service Delivery (inventory management against deadlines).
Time-Indexed Key-Inventory Model: The operating horizon is partitioned into discrete time slots $t = 1, \dots, T$ $t = 1, \dots, T$ .
- $K_j$ : The certified usable yield from contact window $j$ , derived from a finite-key security analysis $\ell_{sec}$ minus reserved bits $c_j$ .
- $A_t$ : The total usable key arrival in slot $t$ .
- $D_t$ : The application's key demand due in slot $t$ .
- $B_t$ : The inventory balance, governed by the recurrence $B_t = B_{t-1} + A_t - D_t$ , with the constraint $B_t \geq 0$ .
Prefix-Feasibility Criterion: The paper derives a deterministic condition (Proposition 1) stating that all demands can be met if and only if the cumulative supply (initial inventory plus arrivals) meets or exceeds cumulative demand for every time prefix $u$ .
Finite-Block Fragmentation Analysis: A stylized surrogate model ( $e\ell(n) = an - b\sqrt{n} - c$ ) is used to illustrate how splitting observations into small blocks can result in zero output due to finite-size penalties, whereas aggregating the same data into a single block could yield positive keys. This is presented as an illustrative threshold, not a universal cryptographic bound.

Key Contributions

Formal Separation of Claims: The paper explicitly distinguishes between optical link feasibility, block-level security-qualified output, and deadline-constrained service, arguing that the latter cannot be inferred solely from the former.
Prefix-Feasibility Condition: It provides a simple, necessary, and sufficient condition (Eq. 3) to determine if a sequence of intermittent key arrivals can satisfy a time-indexed demand schedule without borrowing from future windows.
Deficit Diagnostic ( $\Gamma$ ): A metric is introduced to quantify the minimum additional initial inventory required to satisfy all deadlines in a given scenario, serving as a benchmark for service reliability.
Illustrative Numerical Examples:
- Timing Mismatch: Demonstrates that two scenarios with identical total key yields (16 kbit) and total demand (12 kbit) have different outcomes based on when the keys arrive. A delay in arrival can cause a service outage even if the total supply is sufficient.
- Fragmentation Effect: Shows that processing four separate contacts of 10,000 units each might yield zero keys due to finite-size penalties, while processing the combined 40,000 units as one block yields a positive result.
Reproducible Data Ledger: The author proposes a standardized reporting framework for future studies, requiring separate reporting of contact traces, QKD observations, security accounting, and service accounting to enable controlled sensitivity analysis.

Results
The analysis yields no new security proofs or experimental data. Instead, the results are analytical:

Inadequacy of Aggregate Metrics: The paper demonstrates that $\sum A_t \geq \sum D_t$ is an insufficient condition for service feasibility; the temporal distribution of arrivals is critical.
Impact of Fragmentation: The illustrative model confirms that short contact windows can fail to produce usable keys even when the total observation time is theoretically sufficient, highlighting the importance of aggregation strategies where protocol and trust domains permit.
Boundary Clarification: The paper clarifies that machine learning estimators or classical throughput benchmarks (e.g., from cryptocurrency mining) cannot substitute for physical security proofs or QKD-specific latency measurements.

Significance and Scope
The paper positions itself as a "systems-level accounting and benchmarking framework." Its significance lies in:

Operational Realism: It bridges the gap between theoretical QKD rates and practical application requirements, specifically for mobile and intermittent links (trains, UAVs, HAPs, satellites).
Auditability: By separating physical inputs, security proofs, and service constraints, the framework allows researchers to identify exactly where a system fails (e.g., is it the weather, the finite-key analysis, or the scheduling?).
Modesty of Claims: The author explicitly states they introduce no new QKD protocol, hardware, or validated rate prediction. The mathematical statements are elementary bookkeeping tests, not novel cryptographic theorems. The paper does not claim to solve the problem of optimal scheduling or provide stochastic outage models but rather provides the necessary accounting tools to evaluate service feasibility against application-level requirements.

The intended outcome is to guide future research toward combining measured acquisition windows with actual QKD event logs and application demand traces to test real-world service guarantees.

More like this