From Received Power to Certified Secret Keys: A General Method for Bridging Classical FSO Link Budgets and Decoy-State QKD

In the world of secure communication, there is a fundamental difference between sending a message and sending a secret. Traditional free-space optical communication, which uses lasers to transmit data through the air between buildings, satellites, or moving vehicles, is excellent at moving large amounts of information quickly. Engineers have long known how to calculate whether a laser beam will reach its destination with enough power to be read, accounting for how much the atmosphere absorbs the light or how much the beam spreads out over distance. However, quantum key distribution uses light for a different, more delicate purpose: creating a secret code that is mathematically guaranteed to be unbreakable, even by an adversary with unlimited computing power. This process relies on individual particles of light, called photons, arriving at a detector. The challenge arises because the tools used to design a standard laser link—calculating power and distance—do not automatically tell engineers how many secret bits can be safely extracted from those photons. A strong signal does not guarantee a secure key, and a weak signal does not necessarily mean the key is lost; the relationship depends on the precise behavior of individual particles and the statistical rules that govern their detection.

A new study by Hasan Abbas Al-Mohammed addresses this gap by creating a practical bridge between the engineering of classical laser links and the strict requirements of quantum security. The research does not propose a new way to generate secrets, a new physical law, or a universal range; instead, it offers a method for translating the familiar numbers of a laser link budget into the specific inputs needed for a quantum security calculation. The author demonstrates that while a classical link might successfully deliver a bright beam of light over a certain distance, the number of secret bits that can be certified from that same beam is often far more limited. The study provides a step-by-step interface that takes standard variables—such as the size of the telescope, the clarity of the air, the precision of the pointing system, and the efficiency of the detector—and converts them into a prediction of how many secret bits can be generated in a real-world scenario.

The core of the work involves a detailed simulation of a system using a specific type of quantum protocol known as decoy-state BB84. In this setup, the sender transmits pulses of light that are intentionally varied in brightness, including some that are so faint they contain only a single photon. This variation is crucial for detecting eavesdroppers, but it also makes the math of counting secret bits much more complex than simply measuring total power. The study separates the different factors that reduce the signal: the geometric spreading of the beam, the absorption by the atmosphere, the tiny errors in keeping the laser aimed at the receiver, and the limitations of the detector itself. By isolating these factors, the method allows engineers to see exactly how much each one costs in terms of security. For instance, if a laser beam spreads out too much or the atmosphere is foggy, the number of photons arriving drops, and the statistical certainty required to prove the key is secret diminishes rapidly.

The researchers tested this method across a range of weather conditions, from very clear air to dense fog, and for various distances. They found that while a standard laser link might theoretically work over distances of fifty kilometers in clear air, the distance at which a certified secret key can be generated is significantly shorter. In the most favorable conditions simulated, the maximum distance for generating a secret key at a rate of one thousand bits per second was just under three kilometers. As the weather worsened, this distance shrank quickly; in dense fog, the secure range dropped to less than one kilometer. These results highlight a critical distinction: the ability to receive a signal is not the same as the ability to certify a secret. The study shows that even when a detector registers a signal, the statistical fluctuations inherent in counting individual particles mean that the system must often abort the process to avoid generating an insecure key.

The paper also explores how the design of the system affects these limits. The researchers varied the probability of sending different types of light pulses and the frequency with which they checked for errors. They discovered that there is an optimal balance; sending too many pulses for testing and not enough for the actual key, or vice versa, reduces the total distance the system can cover. In their simulations, the best performance was achieved when the system dedicated sixty percent of its time to generating the key and forty percent to testing, a specific ratio that maximized the secure distance. Furthermore, the study compared different mathematical methods for estimating the security of the key. One method, which assumes a simpler statistical behavior, predicted slightly longer distances than a more conservative method that accounts for the worst-case statistical deviations. The author notes that while the simpler method suggests better performance, the more conservative approach is necessary for real-world guarantees, and the difference between the two can be significant in marginal conditions.

Importantly, the study clarifies what its results do and do not represent. The numbers provided are conditional predictions based on a specific set of assumptions about the equipment and the environment. They are not experimental certificates of security from a physical test, nor do they claim to solve the problem for every possible scenario or provide a universal range. The method is designed to be a tool for engineers to plug in their own specific data—whether they are building a link between two buildings, a drone, a satellite, or a high-speed train. The study explicitly states that for each of these different applications, the specific details of the geometry, the weather, and the device performance must be substituted into the framework, as each deployment requires its own propagation, acquisition, and device inputs. The author emphasizes that while the mathematical bridge is reusable across different geometries, the actual security of any link depends entirely on the real-world data fed into it.

The research also touches on the issue of interference from other light sources. In a real-world setting, a sensitive detector might pick up stray light from the sun or other lasers, which could be mistaken for the quantum signal. The study calculates how much isolation is needed to prevent this "crosstalk" from overwhelming the system. It finds that in some scenarios, the amount of background noise could be so high that the detector would be flooded, rendering the system useless unless extremely effective filters are used. This reinforces the idea that the theoretical limits of distance are often constrained not just by the atmosphere, but by the practical realities of the environment and the hardware.

Ultimately, this work provides a clear, engineering-focused roadmap for moving from the concept of a laser link to the reality of a secure quantum network. It demystifies the transition from measuring light power to counting secret bits, showing that the two are related but distinct challenges. By providing a general method that can be adapted for satellites, drones, and ground-based systems alike, the study helps engineers understand that achieving quantum security is not just about having a powerful laser, but about carefully managing the statistics of every single photon that arrives. The findings suggest that while the technology is ready for deployment, the secure range is often much shorter than the range of a standard communication link, and that success depends on a precise understanding of the specific conditions and the statistical rules that govern the quantum world.